oj.uz

Submission #990936

# Submission time Handle Problem Language Result Execution time Memory
990936 2024-05-31T20:36:07 Z AdamGS Dungeons Game (IOI21_dungeons) C++17
89 / 100
 7000 ms 1879052 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=4e5+7, LG=24, LG2=15, INF=1e9+7;
int nxt[LIM][LG][LG2], sum[LIM][LG][LG2], ile[LIM][LG][LG2];
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) {
  n=_n;
  rep(i, n) {
    S[i]=_s[i];
    P[i]=_p[i];
    W[i]=_w[i];
    L[i]=_l[i];
  }
  rep(i, LG) {
    nxt[n][i][0]=n;
    rep(j, n) {
      if(S[j]>=(1<<i)) {
        nxt[j][i][0]=L[j];
        sum[j][i][0]=P[j];
        ile[j][i][0]=min(S[j], (1<<(i+1))-P[j]);
      } else {
        nxt[j][i][0]=W[j];
        sum[j][i][0]=S[j];
        ile[j][i][0]=(1<<(i+1))-S[j];
      }
    }
    for(int l=1; l<LG2; ++l) {
      rep(j, n+1) {
        nxt[j][i][l]=nxt[nxt[nxt[j][i][l-1]][i][l-1]][i][l-1];
        sum[j][i][l]=sum[j][i][l-1]+sum[nxt[j][i][l-1]][i][l-1]+sum[nxt[nxt[j][i][l-1]][i][l-1]][i][l-1];
        ile[j][i][l]=ile[j][i][l-1];
        ile[j][i][l]=min(ile[j][i][l], ile[nxt[j][i][l-1]][i][l-1]-sum[j][i][l-1]);
        ile[j][i][l]=min(ile[j][i][l], ile[nxt[nxt[j][i][l-1]][i][l-1]][i][l-1]-sum[j][i][l-1]-sum[nxt[j][i][l-1]][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;
  rep(i, LG) if(z<(1ll<<(ll)(i+1))) {
    for(int j=LG2-1; j>=0; --j) rep(xd, 2) 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 2 ms 16732 KB Output is correct
2 Correct 2 ms 16732 KB Output is correct
3 Correct 10 ms 25136 KB Output is correct
4 Correct 203 ms 252324 KB Output is correct
5 Correct 8 ms 24920 KB Output is correct
6 Correct 202 ms 252500 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 20824 KB Output is correct
2 Correct 4932 ms 1867392 KB Output is correct
3 Correct 4343 ms 1874256 KB Output is correct
4 Correct 4176 ms 1875844 KB Output is correct
5 Correct 3626 ms 1875796 KB Output is correct
6 Correct 5772 ms 1874276 KB Output is correct
7 Correct 5271 ms 1872508 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 21080 KB Output is correct
2 Correct 248 ms 254800 KB Output is correct
3 Correct 239 ms 254912 KB Output is correct
4 Correct 243 ms 254288 KB Output is correct
5 Correct 232 ms 254292 KB Output is correct
6 Correct 292 ms 254524 KB Output is correct
7 Correct 284 ms 254524 KB Output is correct
8 Correct 422 ms 254292 KB Output is correct
9 Correct 217 ms 254116 KB Output is correct
10 Correct 370 ms 254040 KB Output is correct
11 Correct 368 ms 254528 KB Output is correct
12 Correct 1235 ms 254544 KB Output is correct
13 Correct 1234 ms 254548 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 21080 KB Output is correct
2 Correct 248 ms 254800 KB Output is correct
3 Correct 239 ms 254912 KB Output is correct
4 Correct 243 ms 254288 KB Output is correct
5 Correct 232 ms 254292 KB Output is correct
6 Correct 292 ms 254524 KB Output is correct
7 Correct 284 ms 254524 KB Output is correct
8 Correct 422 ms 254292 KB Output is correct
9 Correct 217 ms 254116 KB Output is correct
10 Correct 370 ms 254040 KB Output is correct
11 Correct 368 ms 254528 KB Output is correct
12 Correct 1235 ms 254544 KB Output is correct
13 Correct 1234 ms 254548 KB Output is correct
14 Correct 5 ms 20828 KB Output is correct
15 Correct 228 ms 254612 KB Output is correct
16 Correct 244 ms 254808 KB Output is correct
17 Correct 268 ms 254292 KB Output is correct
18 Correct 269 ms 254528 KB Output is correct
19 Correct 280 ms 254548 KB Output is correct
20 Correct 355 ms 254264 KB Output is correct
21 Correct 437 ms 254292 KB Output is correct
22 Correct 418 ms 254396 KB Output is correct
23 Correct 606 ms 254544 KB Output is correct
24 Correct 773 ms 254548 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 21080 KB Output is correct
2 Correct 248 ms 254800 KB Output is correct
3 Correct 239 ms 254912 KB Output is correct
4 Correct 243 ms 254288 KB Output is correct
5 Correct 232 ms 254292 KB Output is correct
6 Correct 292 ms 254524 KB Output is correct
7 Correct 284 ms 254524 KB Output is correct
8 Correct 422 ms 254292 KB Output is correct
9 Correct 217 ms 254116 KB Output is correct
10 Correct 370 ms 254040 KB Output is correct
11 Correct 368 ms 254528 KB Output is correct
12 Correct 1235 ms 254544 KB Output is correct
13 Correct 1234 ms 254548 KB Output is correct
14 Correct 5 ms 20828 KB Output is correct
15 Correct 228 ms 254612 KB Output is correct
16 Correct 244 ms 254808 KB Output is correct
17 Correct 268 ms 254292 KB Output is correct
18 Correct 269 ms 254528 KB Output is correct
19 Correct 280 ms 254548 KB Output is correct
20 Correct 355 ms 254264 KB Output is correct
21 Correct 437 ms 254292 KB Output is correct
22 Correct 418 ms 254396 KB Output is correct
23 Correct 606 ms 254544 KB Output is correct
24 Correct 773 ms 254548 KB Output is correct
25 Correct 214 ms 253764 KB Output is correct
26 Correct 231 ms 254800 KB Output is correct
27 Correct 213 ms 254288 KB Output is correct
28 Correct 212 ms 254288 KB Output is correct
29 Correct 237 ms 254780 KB Output is correct
30 Correct 413 ms 254548 KB Output is correct
31 Correct 488 ms 254292 KB Output is correct
32 Correct 489 ms 254392 KB Output is correct
33 Correct 309 ms 254548 KB Output is correct
34 Correct 379 ms 254396 KB Output is correct
35 Correct 347 ms 254632 KB Output is correct

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 20824 KB Output is correct
2 Correct 4932 ms 1867392 KB Output is correct
3 Correct 4343 ms 1874256 KB Output is correct
4 Correct 4176 ms 1875844 KB Output is correct
5 Correct 3626 ms 1875796 KB Output is correct
6 Correct 5772 ms 1874276 KB Output is correct
7 Correct 5271 ms 1872508 KB Output is correct
8 Correct 6 ms 21080 KB Output is correct
9 Correct 248 ms 254800 KB Output is correct
10 Correct 239 ms 254912 KB Output is correct
11 Correct 243 ms 254288 KB Output is correct
12 Correct 232 ms 254292 KB Output is correct
13 Correct 292 ms 254524 KB Output is correct
14 Correct 284 ms 254524 KB Output is correct
15 Correct 422 ms 254292 KB Output is correct
16 Correct 217 ms 254116 KB Output is correct
17 Correct 370 ms 254040 KB Output is correct
18 Correct 368 ms 254528 KB Output is correct
19 Correct 1235 ms 254544 KB Output is correct
20 Correct 1234 ms 254548 KB Output is correct
21 Correct 5 ms 20828 KB Output is correct
22 Correct 228 ms 254612 KB Output is correct
23 Correct 244 ms 254808 KB Output is correct
24 Correct 268 ms 254292 KB Output is correct
25 Correct 269 ms 254528 KB Output is correct
26 Correct 280 ms 254548 KB Output is correct
27 Correct 355 ms 254264 KB Output is correct
28 Correct 437 ms 254292 KB Output is correct
29 Correct 418 ms 254396 KB Output is correct
30 Correct 606 ms 254544 KB Output is correct
31 Correct 773 ms 254548 KB Output is correct
32 Correct 214 ms 253764 KB Output is correct
33 Correct 231 ms 254800 KB Output is correct
34 Correct 213 ms 254288 KB Output is correct
35 Correct 212 ms 254288 KB Output is correct
36 Correct 237 ms 254780 KB Output is correct
37 Correct 413 ms 254548 KB Output is correct
38 Correct 488 ms 254292 KB Output is correct
39 Correct 489 ms 254392 KB Output is correct
40 Correct 309 ms 254548 KB Output is correct
41 Correct 379 ms 254396 KB Output is correct
42 Correct 347 ms 254632 KB Output is correct
43 Correct 2 ms 16732 KB Output is correct
44 Correct 5 ms 20828 KB Output is correct
45 Correct 4271 ms 1879052 KB Output is correct
46 Correct 3520 ms 1874260 KB Output is correct
47 Correct 3462 ms 1874820 KB Output is correct
48 Correct 3120 ms 1876968 KB Output is correct
49 Correct 4629 ms 1879020 KB Output is correct
50 Correct 4917 ms 1876608 KB Output is correct
51 Correct 3060 ms 1876996 KB Output is correct
52 Correct 4814 ms 1874656 KB Output is correct
53 Execution timed out 7094 ms 1727580 KB Time limit exceeded
54 Halted 0 ms 0 KB -