oj.uz

답안 #373976

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
373976 2021-03-06T10:37:10 Z ritul_kr_singh Lost in the cycle (IOI19_cycle) C++17
33 / 100
 1 ms 364 KB 
//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
#include "cycle.h"
using namespace std;
#define sp << " " <<
#define nl << "\n"
 
void escape(int n){
    if(n==1) return;
    bool inTrue = jump(n/2);
    for(int j=n/2; true; j=(j+1)/2){
        bool ok;
        if(inTrue) ok = jump(j);
        else ok = jump(n-j);
//        cout << j sp inTrue sp ok nl;
        inTrue = ok;
        if(j==1) break;
    }
    if(!inTrue) jump(n-1);
}

Subtask #1
0 / 11.0

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

Subtask #2
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct

Subtask #3
0 / 56.0

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