답안 #290383

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
290383 2020-09-03T17:21:13 Z rocks03 Lost in the cycle (IOI19_cycle) C++14
0 / 100
1 ms 256 KB
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
using namespace std;

bool jump(int x);

void escape(int N){
    ll comeback = 0;
    for(int i = 31; i >= 0; i--){
        if(1ll << i > N) continue;
        ll dist = (comeback + (1ll<<i)) % N;
        comeback = 0;
        if(jump(dist)){
            continue;
        }
        comeback += N - (1ll<<i);
    }
}

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Incorrect 0 ms 256 KB The exit was not found.
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 256 KB The exit was not found.
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Incorrect 0 ms 256 KB The exit was not found.
4 Halted 0 ms 0 KB -