Submission #439260

#TimeUsernameProblemLanguageResultExecution timeMemory
439260zaneyuLost in the cycle (IOI19_cycle)C++14
100 / 100
2 ms384 KiB
#include "cycle.h" #include<bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set; #pragma GCC optimize("O2","unroll-loops","no-stack-protector") //order_of_key #of elements less than x // find_by_order kth element using ll=long long; using ld=long double; using pii=pair<ld,ld>; #define f first #define s second #define pb push_back #define REP(i,n) for(ll i=0;i<n;i++) #define REP1(i,n) for(ll i=1;i<=n;i++) #define FILL(n,x) memset(n,x,sizeof(n)) #define ALL(_a) _a.begin(),_a.end() #define sz(x) (int)x.size() #define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end())))) const ll INF64=1e18+1; const int INF=0x3f3f3f3f; const ll MOD=998244353; const ld PI=acos(-1); const ld eps=1e-3; #define lowb(x) x&(-x) #define MNTO(x,y) x=min(x,(__typeof__(x))y) #define MXTO(x,y) x=max(x,(__typeof__(x))y) inline ll mult(ll a,ll b){ if(a>=MOD) a%=MOD; if(b>=MOD) b%=MOD; return (a*b)%MOD; } inline ll mypow(ll a,ll b){ if(b<=0) return 1; ll res=1LL; while(b){ if(b&1) res=mult(res,a); a=mult(a,a); b>>=1; } return res; } const int maxn=1e3+5; const int maxlg=__lg(maxn)+2; void escape(int n){ if(!jump(0)) jump(n/2); int z=__lg(n/2); for(int i=(1<<z);i>=1;i/=2){ if(!jump(i)){ i/=2; while(i and !jump(n-i)){ i/=2; } } } if(!jump(0)) jump(n-1); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...