제출 #819718

#제출 시각아이디문제언어결과실행 시간메모리
819718alvingogo던전 (IOI21_dungeons)C++17
0 / 100
3026 ms2097152 KiB
#include "dungeons.h" #include <bits/stdc++.h> #define fs first #define sc second #define p_q priority_queue using namespace std; const int A=25; typedef long long ll; struct xe{ int to; ll cost=0; ll mx=0; }; struct no{ vector<xe> as; no(){ as.resize(A); } }; vector<vector<no> > f; vector<int> s,p,w,l; int n; void init(int N, vector<int> S, vector<int> P, vector<int> W, vector<int> L) { n=N; s=S; p=P; w=W; l=L; f.resize(A); for(int z=0;z<A;z++){ auto &v=f[z]; v.resize(n+1); for(int i=0;i<n;i++){ if((1<<z)>=s[i]){ v[i].as[0].to=w[i]; v[i].as[0].cost=s[i]; v[i].as[0].mx=0; } else{ v[i].as[0].to=l[i]; v[i].as[0].cost=p[i]; v[i].as[0].mx=s[i]; } } for(int i=1;i<A;i++){ for(int j=0;j<n;j++){ auto a=v[j].as[i-1],b=v[v[j].as[i-1].to].as[i-1]; if(a.to==n){ v[j].as[i]=a; } else{ v[j].as[i].to=b.to; v[j].as[i].cost=a.cost+b.cost; } } } } return; } ll simulate(int x, int Z) { long long z=Z; for(int j=0;j<A;j++){ for(int i=A-1;i>=0;i--){ if(z+f[j][x].as[i].cost<f[j][x].as[i].mx){ z+=f[j][x].as[i].cost; x=f[j][x].as[i].to; if(x==n){ return z; } } } if(z>=s[x]){ z+=s[x]; x=w[x]; } else{ z+=p[x]; x=l[x]; } if(x==n){ return z; } } return z; }
#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...