#include "dungeons.h"
#include <vector>
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
typedef long long ll;
ll s[400005],p[400005],w[400005],l[400005],cost[400005],to[25][400005];
ll n;
int dp[25][400005][9];
ll suma[25][400005][9];
int who[25][400005][9];
ll smax=0;
void init(int N, std::vector<int> S, std::vector<int> P, std::vector<int> W, std::vector<int> L)
{
n=N;
for(int i=0;i<n;i++)
{
s[i]=S[i];
smax=max(smax,s[i]*1LL);
p[i]=P[i];
w[i]=W[i];
l[i]=L[i];
}
w[n]=n;
for(int k=0;k<25;k++)
{
for(int i=0;i<n;i++)
{
if(s[i]<(1<<k))
{
to[k][i]=w[i];
cost[i]=s[i];
}
else
{
to[k][i]=l[i];
cost[i]=p[i];
}
suma[k][i][0]=cost[i];
who[k][i][0]=to[k][i];
}
cost[n]=0;
to[k][n]=n;
who[k][n][0]=n;
suma[k][n][0]=0;
for(int j=1;j<9;j++)
{
for(int i=0;i<=n;i++)
{
ll sum=0;
ll x=i;
for(int c=1;c<=8;c++)
{
sum+=suma[k][x][j-1];
x=who[k][x][j-1];
}
who[k][i][j]=x;
suma[k][i][j]=sum;
}
}
for(int i=0;i<n;i++)
{
if(s[i]>=(1<<k))
dp[k][i][0]=0-s[i];
else
dp[k][i][0]=-1e9;
}
for(int j=1;j<9;j++)
{
for(int i=0;i<=n;i++)
{
ll x=i;
ll maxim=-1e9;
ll sum=0;
for(int c=1;c<=8;c++)
{
ll val=-1e9;
if(dp[k][x][j-1]>-1e9)
val=min(0LL,dp[k][x][j-1]+sum);
maxim=max(maxim,val);
sum+=suma[k][x][j-1];
x=who[k][x][j-1];
}
dp[k][i][j]=maxim;
}
}
}
}
long long simulate(int x, int z)
{
ll rez=z;
int cnt=0;
while(x!=n)
{
cnt++;
ll k=0;
for(int i=0;i<25;i++)
if((1<<i)<rez)
k=i;
if(k==24)
{
while(x!=n)
{
rez+=suma[k][x][11];
x=who[k][x][11];
}
continue;
}
for(int i=8;i>=0;i--)
{
while(rez+dp[k][x][i]<0)
{
rez+=suma[k][x][i];
x=who[k][x][i];
}
}
rez+=s[x];
//assert(x==n||s[x]>=(1<<k));
x=w[x];
}
return rez;
}
Compilation message
dungeons.cpp: In function 'long long int simulate(int, int)':
dungeons.cpp:105:35: warning: array subscript 11 is above array bounds of 'll [9]' {aka 'long long int [9]'} [-Warray-bounds]
105 | rez+=suma[k][x][11];
| ~~~~~~~~~~~~~^
dungeons.cpp:106:31: warning: array subscript 11 is above array bounds of 'int [9]' [-Warray-bounds]
106 | x=who[k][x][11];
| ~~~~~~~~~~~~^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
213852 KB |
Output is correct |
2 |
Correct |
21 ms |
213800 KB |
Output is correct |
3 |
Correct |
36 ms |
226088 KB |
Output is correct |
4 |
Correct |
521 ms |
404176 KB |
Output is correct |
5 |
Correct |
36 ms |
226052 KB |
Output is correct |
6 |
Correct |
510 ms |
404520 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
27 ms |
217936 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
30 ms |
218028 KB |
Output is correct |
2 |
Correct |
627 ms |
405208 KB |
Output is correct |
3 |
Incorrect |
560 ms |
405112 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
30 ms |
218028 KB |
Output is correct |
2 |
Correct |
627 ms |
405208 KB |
Output is correct |
3 |
Incorrect |
560 ms |
405112 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
30 ms |
218028 KB |
Output is correct |
2 |
Correct |
627 ms |
405208 KB |
Output is correct |
3 |
Incorrect |
560 ms |
405112 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
27 ms |
217936 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |