#include "dungeons.h"
#include <bits/stdc++.h>
using namespace std;
const int base=6,sz=9;
const long long INF=1e18;
int N,nxt[24][400001][sz];
long long mn[24][400001][sz],sum[24][400001][sz];
vector <int> S,P,W,L,ve={1};
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=1;i<sz;i++)
ve.push_back(ve.back()*base);
memset(nxt,-1,sizeof(nxt));
for (int i=0;i<n;i++){
for (int j=0;j<sz;j++)
if (s[i]<=ve[j]){
nxt[0][i][j]=w[i];
sum[0][i][j]=s[i];
mn[0][i][j]=INF;
}
else{
nxt[0][i][j]=l[i];
sum[0][i][j]=p[i];
mn[0][i][j]=s[i];
}
nxt[0][i][sz]=w[i];
}
for (int j=1;j<24;j++){
for (int i=0;i<n;i++)
for (int k=0;k<sz;k++){
if (nxt[j-1][i][k]==-1)
continue;
int u=nxt[j-1][i][k];
nxt[j][i][k]=nxt[j-1][u][k];
mn[j][i][k]=min(mn[j-1][i][k],mn[j-1][u][k]-sum[j-1][i][k]);
sum[j][i][k]=sum[j-1][i][k]+sum[j-1][u][k];
}
}
}
long long simulate(int x, int Z){
int j=0;
long long z=Z;
while (x<N){
while (j<sz&&ve[j]<=z)
j++;
j--;
for (int i=23;i>=0;i--)
if (nxt[i][x][j]!=-1&&z<mn[i][x][j]){
z+=sum[i][x][j];
x=nxt[i][x][j];
}
if (x==N)
break;
if (z<S[x]){
z+=P[x];
x=L[x];
}
else{
z+=S[x];
x=W[x];
}
}
return z;
}
Compilation message
dungeons.cpp: In function 'void init(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
dungeons.cpp:26:21: warning: array subscript 9 is above array bounds of 'int [9]' [-Warray-bounds]
26 | nxt[0][i][sz]=w[i];
| ~~~~~~~~~~~~^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
101 ms |
435220 KB |
Output is correct |
2 |
Correct |
50 ms |
435140 KB |
Output is correct |
3 |
Correct |
52 ms |
441428 KB |
Output is correct |
4 |
Correct |
126 ms |
609988 KB |
Output is correct |
5 |
Correct |
51 ms |
441420 KB |
Output is correct |
6 |
Correct |
112 ms |
610000 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
52 ms |
439360 KB |
Output is correct |
2 |
Correct |
936 ms |
1710684 KB |
Output is correct |
3 |
Correct |
816 ms |
1710928 KB |
Output is correct |
4 |
Correct |
631 ms |
1710652 KB |
Output is correct |
5 |
Correct |
628 ms |
1710904 KB |
Output is correct |
6 |
Correct |
946 ms |
1710808 KB |
Output is correct |
7 |
Correct |
551 ms |
1710732 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
53 ms |
439380 KB |
Output is correct |
2 |
Correct |
212 ms |
610896 KB |
Output is correct |
3 |
Execution timed out |
7048 ms |
610900 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
53 ms |
439380 KB |
Output is correct |
2 |
Correct |
212 ms |
610896 KB |
Output is correct |
3 |
Execution timed out |
7048 ms |
610900 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
53 ms |
439380 KB |
Output is correct |
2 |
Correct |
212 ms |
610896 KB |
Output is correct |
3 |
Execution timed out |
7048 ms |
610900 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
52 ms |
439360 KB |
Output is correct |
2 |
Correct |
936 ms |
1710684 KB |
Output is correct |
3 |
Correct |
816 ms |
1710928 KB |
Output is correct |
4 |
Correct |
631 ms |
1710652 KB |
Output is correct |
5 |
Correct |
628 ms |
1710904 KB |
Output is correct |
6 |
Correct |
946 ms |
1710808 KB |
Output is correct |
7 |
Correct |
551 ms |
1710732 KB |
Output is correct |
8 |
Correct |
53 ms |
439380 KB |
Output is correct |
9 |
Correct |
212 ms |
610896 KB |
Output is correct |
10 |
Execution timed out |
7048 ms |
610900 KB |
Time limit exceeded |
11 |
Halted |
0 ms |
0 KB |
- |