CF936D.World of Tank

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Vitya loves programming and problem solving, but sometimes, to distract himself a little, he plays computer games. Once he found a new interesting game about tanks, and he liked it so much that he went through almost all levels in one day. Remained only the last level, which was too tricky. Then Vitya remembered that he is a programmer, and wrote a program that helped him to pass this difficult level. Try do the same.

The game is organized as follows. There is a long road, two cells wide and nn cells long. Some cells have obstacles. You control a tank that occupies one cell. Initially, the tank is located before the start of the road, in a cell with coordinates (0,1)(0,1) . Your task is to move the tank to the end of the road, to the cell (n+1,1)(n+1,1) or (n+1,2)(n+1,2) .

Every second the tank moves one cell to the right: the coordinate xx is increased by one. When you press the up or down arrow keys, the tank instantly changes the lane, that is, the yy coordinate. When you press the spacebar, the tank shoots, and the nearest obstacle along the lane in which the tank rides is instantly destroyed. In order to load a gun, the tank needs tt seconds. Initially, the gun is not loaded, that means, the first shot can be made only after tt seconds after the tank starts to move.

If at some point the tank is in the same cell with an obstacle not yet destroyed, it burns out. If you press the arrow exactly at the moment when the tank moves forward, the tank will first move forward, and then change the lane, so it will not be possible to move diagonally.

Your task is to find out whether it is possible to pass the level, and if possible, to find the order of actions the player need to make.

输入格式

The first line contains four integers nn , m1m_{1} , m2m_{2} and tt , the length of the field, the number of obstacles in the first lane, the number of obstacles in the second lane and the number of tank steps before reloading, respectively ( 1<=n<=1091<=n<=10^{9} ; 0<=m1,m2<=n0<=m_{1},m_{2}<=n ; 0<=m1+m2<=1060<=m_{1}+m_{2}<=10^{6} ; 1<=t<=n1<=t<=n ).

The next two lines contain a description of the obstacles. The first of these lines contains m1m_{1} numbers xix_{i} — the obstacle coordinates in the first lane ( 1<=xi<=n1<=x_{i}<=n ; x_{i}<x_{i+1} ). The yy coordinate for all these obstacles will be 11 .

The second line contains m2m_{2} numbers describing the obstacles of the second lane in the same format. The yy coordinate of all these obstacles will be 22 .

输出格式

In the first line print «Yes», if it is possible to pass the level, or «No», otherwise.

If it is possible, then in the second line print the number of times the tank moves from one lane to another, and in the next line print the coordinates of the transitions, one number per transition: the coordinate xx ( 0<=x<=n+10<=x<=n+1 ). All transition coordinates coordinates must be distinct and should be output in strictly increasing order.The number of transitions should not exceed 21062·10^{6} . If the tank can pass the level, then it can do it using no more than 21062·10^{6} transitions.

In the fourth line print the number of shots that the tank makes during the movement, in the following lines print two numbers, xx and yy coordinates of the point ( 1<=x<=n1<=x<=n , 1<=y<=21<=y<=2 ), from which the tank fired a shot, the number of shots must not exceed m1+m2m_{1}+m_{2} . Shots must be output in the order in which they are fired.

If there are several solutions, output any one.

输入输出样例

  • 输入#1

    6 2 3 2
    2 6
    3 5 6
    

    输出#1

    Yes
    2
    0 3 
    2
    2 2
    4 1
    
  • 输入#2

    1 1 1 1
    1
    1
    

    输出#2

    No
    
  • 输入#3

    9 5 2 5
    1 2 7 8 9
    4 6
    

    输出#3

    Yes
    4
    0 3 5 10 
    1
    5 2
    

说明/提示

Picture for the first sample test.

首页