#include<bits/stdc++.h>
#define ent '\n'
typedef long long ll;
using namespace std;
const int mx=1e6+12;
vector<int> A,B,C,D;
int up[23][mx];
ll ma[23][mx];
ll sum[23][mx];
int dist[mx];
int N,m,k;
bool ok=0;
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<22;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]=p[i];
dist[i]=dist[w[i]]+1;
for(int k=1;k<22;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){
if(ok)return 0;
int n=N;
ll x=d;
vector<int> s=A,p=B,w=C,l=D;
for(int k=21;k>=0;k--){
if(up[k][pos]<=n && sum[k][pos]+x<s[0]){
pos=up[k][pos];
x+=sum[k][pos];
}
}
if(pos==n)return x;
x+=p[pos];
pos=l[pos];
x+=s[0]*1ll*dist[pos];
return x;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
21 ms |
135732 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
21 ms |
135800 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
21 ms |
135772 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
21 ms |
135772 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
21 ms |
135772 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
21 ms |
135800 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |