oj.uz

답안 #290386

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
290386 2020-09-03T17:26:09 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){
    if(!jump(0)) jump(N/2);
    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);
    }
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 33.0

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

Subtask #3
0 / 56.0

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