oj.uz

Submission #990958

# Submission time Handle Problem Language Result Execution time Memory
990958 2024-05-31T20:59:29 Z AdamGS Dungeons Game (IOI21_dungeons) C++17
63 / 100
 732 ms 234704 KB 
#include "dungeons.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=5e4+7, LG=24, LG2=15, INF=1e9+7;
int nxt[LIM][LG2][LG], sum[LIM][LG2][LG], ile[LIM][LG2][LG], pot[LG2+1];
ll nxt2[LIM][LG], sum2[LIM][LG], S[LIM], P[LIM], W[LIM], L[LIM], n;
void init(int _n, vector<int>_s, vector<int>_p, vector<int>_w, vector<int>_l) {
  pot[0]=1;
  rep(i, LG2) pot[i+1]=pot[i]*3;
  n=_n;
  rep(i, n) {
    S[i]=_s[i];
    P[i]=_p[i];
    W[i]=_w[i];
    L[i]=_l[i];
  }
  rep(i, LG2) {
    nxt[n][i][0]=n;
    rep(j, n) {
      if(S[j]>=pot[i]) {
        nxt[j][i][0]=L[j];
        sum[j][i][0]=P[j];
        ile[j][i][0]=min(S[j], pot[i+1]-P[j]);
      } else {
        nxt[j][i][0]=W[j];
        sum[j][i][0]=S[j];
        ile[j][i][0]=pot[i+1]-S[j];
      }
    }
    for(int l=1; l<LG; ++l) {
      rep(j, n+1) {
        nxt[j][i][l]=nxt[nxt[j][i][l-1]][i][l-1];
        sum[j][i][l]=sum[j][i][l-1]+sum[nxt[j][i][l-1]][i][l-1];
        ile[j][i][l]=min(ile[j][i][l-1], ile[nxt[j][i][l-1]][i][l-1]-sum[j][i][l-1]);
        sum[j][i][l]=min(sum[j][i][l], INF);
        ile[j][i][l]=max(ile[j][i][l], 0);
      }
    }
  }
  nxt2[n][0]=n;
  rep(i, n) {
    nxt2[i][0]=W[i];
    sum2[i][0]=S[i];
  }
  for(int j=1; j<LG; ++j) {
    rep(i, n+1) {
      nxt2[i][j]=nxt2[nxt2[i][j-1]][j-1];
      sum2[i][j]=sum2[nxt2[i][j-1]][j-1]+sum2[i][j-1];
    }
  }
  return;
}
ll simulate(int x, int _z) {
  ll z=_z;
  int i=0;
  while(true) {
    while(i<LG2 && pot[i+1]<=z) ++i;
    if(i==LG2) break;
    for(int j=LG-1; j>=0; --j) if(nxt[x][i][j]<n && ile[x][i][j]>z) {
      z+=sum[x][i][j];
      x=nxt[x][i][j];
    }
    if(z>=S[x]) {
      z+=S[x];
      x=W[x];
    } else {
      z+=P[x];
      x=L[x];
    }
    if(x==n) return z;
  }
  for(int i=LG-1; i>=0; --i) if(nxt2[x][i]<n) {
    z+=sum2[x][i];
    x=nxt2[x][i];
  }
  z+=sum2[x][0];
  x=nxt2[x][0];
  return z;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 6 ms 18780 KB Output is correct
4 Correct 164 ms 233704 KB Output is correct
5 Correct 8 ms 18776 KB Output is correct
6 Correct 162 ms 233676 KB Output is correct

Subtask #2
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14684 KB Output is correct
2 Runtime error 107 ms 44352 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14684 KB Output is correct
2 Correct 203 ms 234416 KB Output is correct
3 Correct 195 ms 234492 KB Output is correct
4 Correct 185 ms 234324 KB Output is correct
5 Correct 193 ms 234468 KB Output is correct
6 Correct 226 ms 234324 KB Output is correct
7 Correct 217 ms 234464 KB Output is correct
8 Correct 282 ms 234420 KB Output is correct
9 Correct 179 ms 234320 KB Output is correct
10 Correct 289 ms 234324 KB Output is correct
11 Correct 241 ms 234324 KB Output is correct
12 Correct 704 ms 234324 KB Output is correct
13 Correct 732 ms 234320 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14684 KB Output is correct
2 Correct 203 ms 234416 KB Output is correct
3 Correct 195 ms 234492 KB Output is correct
4 Correct 185 ms 234324 KB Output is correct
5 Correct 193 ms 234468 KB Output is correct
6 Correct 226 ms 234324 KB Output is correct
7 Correct 217 ms 234464 KB Output is correct
8 Correct 282 ms 234420 KB Output is correct
9 Correct 179 ms 234320 KB Output is correct
10 Correct 289 ms 234324 KB Output is correct
11 Correct 241 ms 234324 KB Output is correct
12 Correct 704 ms 234324 KB Output is correct
13 Correct 732 ms 234320 KB Output is correct
14 Correct 3 ms 14680 KB Output is correct
15 Correct 185 ms 234480 KB Output is correct
16 Correct 198 ms 234324 KB Output is correct
17 Correct 209 ms 234320 KB Output is correct
18 Correct 207 ms 234324 KB Output is correct
19 Correct 245 ms 234320 KB Output is correct
20 Correct 250 ms 234476 KB Output is correct
21 Correct 287 ms 234324 KB Output is correct
22 Correct 305 ms 234704 KB Output is correct
23 Correct 394 ms 234324 KB Output is correct
24 Correct 485 ms 234580 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14684 KB Output is correct
2 Correct 203 ms 234416 KB Output is correct
3 Correct 195 ms 234492 KB Output is correct
4 Correct 185 ms 234324 KB Output is correct
5 Correct 193 ms 234468 KB Output is correct
6 Correct 226 ms 234324 KB Output is correct
7 Correct 217 ms 234464 KB Output is correct
8 Correct 282 ms 234420 KB Output is correct
9 Correct 179 ms 234320 KB Output is correct
10 Correct 289 ms 234324 KB Output is correct
11 Correct 241 ms 234324 KB Output is correct
12 Correct 704 ms 234324 KB Output is correct
13 Correct 732 ms 234320 KB Output is correct
14 Correct 3 ms 14680 KB Output is correct
15 Correct 185 ms 234480 KB Output is correct
16 Correct 198 ms 234324 KB Output is correct
17 Correct 209 ms 234320 KB Output is correct
18 Correct 207 ms 234324 KB Output is correct
19 Correct 245 ms 234320 KB Output is correct
20 Correct 250 ms 234476 KB Output is correct
21 Correct 287 ms 234324 KB Output is correct
22 Correct 305 ms 234704 KB Output is correct
23 Correct 394 ms 234324 KB Output is correct
24 Correct 485 ms 234580 KB Output is correct
25 Correct 169 ms 233552 KB Output is correct
26 Correct 206 ms 234324 KB Output is correct
27 Correct 185 ms 234476 KB Output is correct
28 Correct 188 ms 234316 KB Output is correct
29 Correct 204 ms 234320 KB Output is correct
30 Correct 301 ms 234324 KB Output is correct
31 Correct 340 ms 234320 KB Output is correct
32 Correct 341 ms 234496 KB Output is correct
33 Correct 262 ms 234324 KB Output is correct
34 Correct 373 ms 234324 KB Output is correct
35 Correct 287 ms 234320 KB Output is correct

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14684 KB Output is correct
2 Runtime error 107 ms 44352 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -