제출 #817942

#제출 시각아이디문제언어결과실행 시간메모리
817942FEDIKUS던전 (IOI21_dungeons)C++17
63 / 100
1718 ms1157372 KiB
#include<bits/stdc++.h> #include "dungeons.h" using namespace std; typedef long long ll; const int logz=25; const int logn=25; const int maxn=50000+10; struct{ ll gain,max; int pos; } lift[logz][logn][maxn]; int n; vector<int> s,p; vector<int> w,l; void init(int nn, vector<int> ss, vector<int> pp, vector<int> ww, vector<int> ll) { n=nn; s=ss; p=pp; w=ww; l=ll; s.resize(n+1); p.resize(n+1); w.resize(n+1), l.resize(n+1); s[n]=0; p[n]=0; w[n]=n; l[n]=n; for(int bit=0;bit<logz;bit++){ for(int jump=0;jump<logn;jump++){ for(int pos=0;pos<=n;pos++){ if(jump==0){ if((1<<bit*2)>=s[pos]) lift[bit][jump][pos]={s[pos],LLONG_MIN,w[pos]}; else lift[bit][jump][pos]={p[pos],-s[pos],l[pos]}; }else{ lift[bit][jump][pos]={lift[bit][jump-1][pos].gain+lift[bit][jump-1][lift[bit][jump-1][pos].pos].gain, max(lift[bit][jump-1][pos].max,lift[bit][jump-1][pos].gain+lift[bit][jump-1][lift[bit][jump-1][pos].pos].max), lift[bit][jump-1][lift[bit][jump-1][pos].pos].pos}; } } } } return; } int get_bit(ll a){ return min(63-__builtin_clzll(a),logz-1)/2; } long long simulate(int x, int z) { long long res=z; int klk=0; while(true){ klk++; if(klk>50) exit(-1); if(res==0){ res=p[x]; x=l[x]; continue; } int bit=get_bit(res); for(int jump=logn-1;jump>=0;jump--){ if(res+lift[bit][jump][x].max<0){ res+=lift[bit][jump][x].gain; x=lift[bit][jump][x].pos; } } if((1LL<<2*bit)<s[x] && res>=s[x]){ res+=s[x]; x=w[x]; } if(x==n) break; } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...