# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
371192 | 2021-02-26T04:36:20 Z | evn | Lost in the cycle (IOI19_cycle) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include "cycle.h" using namespace std; #define f first #define s second #define pb push_back #define mp make_pair #define sz(a) a.size() typedef long long ll; typedef pair<int, int> pii; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; void escape(int n){ int lo = 0; int hi = n-1; while(lo < hi){ int mid = (lo+hi+1)/2; if(jump(mid)){ lo = mid; if(lo != hi){ jump(n-mid); } } else{ hi = mid-1; if(lo != hi){ jump(n-mid); } } } } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); }