제출 #623891

#제출 시각아이디문제언어결과실행 시간메모리
623891sofapuden던전 (IOI21_dungeons)C++17
36 / 100
6831 ms1358440 KiB
#include "dungeons.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; const int mxn = 4e5+1; const int m = 9; const int c = 19; int b[mxn][m][c]; ll t[mxn][m][c], a[mxn][m][c]; vector<int> s, p, w, l; int n; const ll inf = (1ll<<60); 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; for(int i = 0; i < c; ++i){ b[n][0][i] = n; t[n][0][i] = inf; a[n][0][i] = 0; for(int k = 0; k < n; ++k){ if(s[k] <= (1<<i<<7)){ t[k][0][i] = inf; a[k][0][i] = s[k]; b[k][0][i] = w[k]; } else{ t[k][0][i] = s[k]; a[k][0][i] = p[k]; b[k][0][i] = l[k]; } } for(int j = 1; j < 2*m; ++j){ for(int k = 0; k < n; ++k){ int cur = (j-1)%m; t[k][j%m][i] = (t[b[k][cur][i]][cur][i] == inf ? t[k][cur][i] : min(t[b[k][cur][i]][cur][i] - a[k][cur][i], t[k][cur][i])); a[k][j%m][i] = a[b[k][cur][i]][cur][i] + a[k][cur][i]; b[k][j%m][i] = b[b[k][cur][i]][cur][i]; } } } } ll simulate(int x, int _z) { ll z = _z; while(z <= 64 && x != n) { if(z >= s[x]){ z += s[x]; x = w[x]; } else { z += p[x]; x = l[x]; } } if(x != n){ for(int i = 0; i < c; ++i){ for(int j = m-1; ~j; --j){ while(x != n && z < t[x][j][i]){ z += a[x][j][i]; x = b[x][j][i]; } } while(x != n && z <= (1<<i<<8)){ if(z >= s[x]){ z += s[x]; x = w[x]; } else { z += p[x]; x = l[x]; } } if(x == n)break; } while(x != n) { if(z >= s[x]){ z += s[x]; x = w[x]; } else { z += p[x]; x = l[x]; } } } 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...