| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1282140 | cjspd_oly | Lost in the cycle (IOI19_cycle) | C++17 | 1 ms | 400 KiB |
#include "cycle.h"
#include <bits/stdc++.h>
using namespace std;
void escape(int n)
{
int l = 0, r = n - 1;
int prev = n;
while (l < r)
{
int mid = (l + r + 1) / 2;
int x = jump(max((mid - prev + n) % n, 1));
if (x)
l = mid;
else
r = mid - 1;
prev = mid;
}
jump((l - prev + n) % n);
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
