Super-plane

Problem code: SUPERPLN

All submissions for this problem are available.

Dunno was invited by Roly-Poly to his birthday party. But he don't know how to get to Roly-Poly. So Dunno turned for advice to Doono. Doono reminded him that their country of shorties have a network of super-planes airlines, which can move not only in space but also in time. Thanks to a super engine, developed by Doono and constructed by Bendum and Twistum, such aircraft, flying from one city could get to the other even before they departed.

Dunno rejoiced and rushed into the super-airport. Not thinking through his route, Dunno began to fly at super-planes aimlessly, i.e. boarded the next flight out of that city, where he was. Dunno flies until he reaches the city where Roly-Poly lives not later than the start time of the birthday party, or until it reaches a certain city, where no longer be able to fly away. The closest flight is a flight in the same city, for which the departure time is not less than the arrival time of Dunno in this city, and the difference between these time points is minimal.

Write a program, that determines whether Dunno ever gets to Roly-Poly given the schedule of the super-plane flights. If he gets the party in time then find also the number of flights he uses.

Input

The first line contains a single positive integer T <= 10, the number of test cases. T test cases follow. The first line of each test case contains the number of available flights N (0 <= N <= 10000) . Each of the following N lines contains 4 space-separated integers C1, T1, C2, T2, where C1 is the departure city, T1 is departure time, C2 is the destination city, T2 is arrival time. It is guaranteed that there are no flights with the same departure city and time. The last line of each test case contains the city where Dunno lives, the time when he came to the super-airport, the city where Roly-Poly lives and the time when the birthday party starts. All city numbers are positive integers not greater than 10000 and all time points are not greater than 100000 in absolute value.

Output

For each test case, output a single line containing the word "Yes" followed by space and the number of flights that the Dunno uses if he gets the Roly-Poly birthday party in time and "No" otherwise.

Example

Input:
3
3
1 3 4 3
4 4 3 5
3 10 2 -1
1 2 2 0
1
1 2 3 0
1 2 2 2
2
2 0 2 0
2 1 4 0
2 0 4 0

Output:
Yes 3
No
No

Author: anton_lunyov
Date Added: 14-06-2011
Time Limit: 2 sec
Source Limit: 50000 Bytes
Languages: ADA, ASM, BASH, BF, C, C99 strict, CAML, CLOJ, CLPS, CPP 4.0.0-8, CPP 4.3.2, CS2, D, ERL, F#, FORT, GO, HASK, ICK, ICON, JAR, JAVA, JS, LISP clisp, LISP sbcl, LUA, NEM, NICE, PAS fpc, PAS gpc, PERL, PERL6, PHP, PIKE, PRLG, PYTH, PYTH 3.1.2, RUBY, SCALA, SCM guile, SCM qobi, ST, TCL, TEXT, WSPC


Comments

Sometimes I feel desperate

imdeepakg @ 23 Jun 2011 11:05 AM
Sometimes I feel desperate for test cases. Would not it be a good idea to show for what test cases a solution gives wrong answer, in the practice session?

I have tried a lot of test

yashdv @ 23 Jun 2011 01:11 PM
I have tried a lot of test cases and cant seem to figure out why i am getting a wrong answer. Can someone please let me know where my code fails ? thanks

Well i got my mistake. I was

yashdv @ 23 Jun 2011 04:41 PM
Well i got my mistake. I was not sorting all the vectors that neede to be sorted. So a case in which n = 3 and the cities are 1 2 and 7 gave an error.

Well i got my mistake. I was

yashdv @ 23 Jun 2011 04:41 PM
Well i got my mistake. I was not sorting all the vectors that neede to be sorted. So a case in which n = 3 and the cities are 1 2 and 7 gave an error.

SUCCESSFUL SUBMISSIONS FOR THIS PROBLEM:

HELP

Program should read from standard input and write to standard output. After you submit a solution you can see your results by clicking on the [My Submissions] tab on the problem page. Below are the possible results:

 

  • Accepted Your program ran successfully and gave a correct answer. If there is a score for the problem, this will be displayed in parenthesis next to the checkmark.
  • Time Limit Exceeded Your program was compiled successfully, but it didn't stop before time limit. Try optimizing your approach.
  • Wrong Answer Your program compiled and ran succesfully but the output did not match the expected output.
  • Runtime Error Your code compiled and ran but encountered an error. The most common reasons are using too much memory or dividing by zero. For the specific error codes see the help section.
  • Compilation Error Your code was unable to compile. When you see this icon, click on it for more information.

    • If you are still having problems, see a sample solution here.

CodeChef is a global programming communityCodeChef hosts online programming competitions