Submission #371197

#TimeUsernameProblemLanguageResultExecution timeMemory
371197evnLost in the cycle (IOI19_cycle)C++14
11 / 100
1 ms492 KiB
#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>; /** bool jump(int steps){ pos += steps; pos %= amt; cout << pos << '\n'; if(pos == 0)return true; if(pos + amt/2 >= amt)return true; return false; }**/ 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; jump(n-mid); } else{ hi = mid-1; jump(n-mid); } } jump(lo); } /** int main(){ escape(6); }**/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...