| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1308667 | avahw | Lost in the cycle (IOI19_cycle) | C++20 | 1 ms | 332 KiB |
#include "cycle.h"
void escape(int n) {
bool can = jump(1);
if(!can){
// go forwards until we can, then go forwards (n / 2)
while(true){
bool reach = jump(1);
if(reach){
jump(n / 2);
break;
}
}
}
if(can){
while(true){
bool reach = jump(1);
if(!reach){
jump(n / 2);
break;
}
}
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
