시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
8 초 | 256 MB | 2 | 0 | 0 | 0.000% |
This is an interactive problem.
There is an infinite grid. A token is placed in the square $(x, y)$. You are to put it in the square $(0, 0)$ following certain rules.
The possible moves are determined by a dice roll. Initially, you have one die which has the number $1$ on each of its six sides.
Each move consists of the following steps:
At the beginning, the jury program prints a line with two integers $x$ and $y$ ($|x|, |y| \leq 10^9$): the initial position of the token.
Next comes a cycle of the following actions:
take
" if it decided to take this die, or "pass
" otherwise. The total number of dice you have should not exceed $1000$.As soon as the token is in the square $(0, 0)$, the participant's program should immediately terminate.
Your solution can make at most 60,000 queries.
10 0 7447 5427 8484 1255 5704 7121 1 2645 6158 4699 4559 3646 4307 1 4080 7552 7 9823 4362 2892 8848 8
pass 9 0 pass 8 0 take 0 0 10 0
Camp > Petrozavodsk Programming Camp > Summer 2018 > Day 7: Izhevsk STU + Ufa SATU Contest G번
Contest > Open Cup > 2018/2019 Season > Stage 2: Grand Prix of Udmurtia G번