#include<bits/stdc++.h>
#define ent '\n'
typedef long long ll;
using namespace std;
const int mx=4e5+12;
vector<int> A,B,C,D;
int up[21][mx];
ll ma[21][mx];
ll sum[21][mx];
int N,m,k;
void init(int M, vector<int> s, vector<int> p, vector<int> w, vector<int> l){
N=M;
A=s,B=p;
C=w,D=l;
s.push_back(0);
s.push_back(0);
for(int k=0;k<20;k++){
up[k][N]=up[k][N+1]=N+1;
}
for(int i=N-1;i>=0;i--){
up[0][i]=w[i];
ma[0][i]=s[i];
sum[0][i]=s[i];
for(int k=1;k<20;k++){
up[k][i]=up[k-1][up[k-1][i]];
ma[k][i]=max(ma[k-1][i],ma[k-1][up[k-1][i]]);
sum[k][i]=sum[k-1][i]+sum[k-1][up[k-1][i]];
}
}
}
long long simulate(int pos, int d){
int n=N;
ll x=d;
vector<int> s=A,p=B,w=C,l=D;
while(pos<n){
ll d=0;
for(int k=19;k>=0;k--){
if(up[k][pos]<=n && ma[k][pos]<=x){
x+=sum[k][pos];
pos=up[k][pos];
}
}
if(pos==n)break;
if(s[pos]<=x){
x+=s[pos];
pos=w[pos];
}
else{
x+=p[pos];
pos=l[pos];
}
}
return x;
}
Compilation message
dungeons.cpp: In function 'long long int simulate(int, int)':
dungeons.cpp:40:6: warning: unused variable 'd' [-Wunused-variable]
40 | ll d=0;
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
22 ms |
111192 KB |
Output is correct |
2 |
Correct |
15 ms |
111196 KB |
Output is correct |
3 |
Correct |
16 ms |
111196 KB |
Output is correct |
4 |
Correct |
67 ms |
130176 KB |
Output is correct |
5 |
Correct |
18 ms |
111196 KB |
Output is correct |
6 |
Correct |
63 ms |
130188 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
18 ms |
111196 KB |
Output is correct |
2 |
Execution timed out |
7072 ms |
182732 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
17 ms |
111192 KB |
Output is correct |
2 |
Execution timed out |
7056 ms |
131412 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
17 ms |
111192 KB |
Output is correct |
2 |
Execution timed out |
7056 ms |
131412 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
17 ms |
111192 KB |
Output is correct |
2 |
Execution timed out |
7056 ms |
131412 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
18 ms |
111196 KB |
Output is correct |
2 |
Execution timed out |
7072 ms |
182732 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |