# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
543679 | 2022-03-31T08:34:29 Z | Sho10 | Lost in the cycle (IOI19_cycle) | C++17 | 1 ms | 208 KB |
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho #include "cycle.h" using ll=long long; using ld=long double; int const INF=1000000005; ll const LINF=1000000000000000005; ll const mod=1000000007; ld const PI=3.14159265359; ll const MAX_N=3e5+5; #pragma GCC optimize("O3") #pragma GCC optimize("Ofast") #define f first #define s second #define pb push_back #define mp make_pair #define endl '\n' #define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); using namespace std; void escape(int n){ ll st=0; if(n==2){ jump(1); return; } if(n==3){ if(!jump(2)){ jump(2); } return; } ll x=jump((n+1)/2); if(x==0){ jump((n+1)/2); } ll l=1,r=(n-1),res=0,last=0; while(l<=r){ ll mid=(l+r)/2; ll x=jump((n-mid+last)%n); if(x==0){ res=mid; r=mid-1; }else l=mid+1; last=mid; } jump(n/2); } /* int32_t main(){ CODE_START; #ifdef LOCAL ifstream cin("input.txt"); #endif */
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | The exit was not found. |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Correct | 0 ms | 208 KB | Output is correct |
3 | Incorrect | 1 ms | 208 KB | The exit was not found. |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | The exit was not found. |
2 | Halted | 0 ms | 0 KB | - |