oj.uz

Submission #990931

# Submission time Handle Problem Language Result Execution time Memory
990931 2024-05-31T20:24:23 Z AdamGS Dungeons Game (IOI21_dungeons) C++17
63 / 100
 2021 ms 361480 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, INF=1e9+7;
int nxt[LIM][LG][LG], sum[LIM][LG][LG], ile[LIM][LG][LG];
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<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;
  rep(i, LG) if(z<(1ll<<(ll)(i+1))) {
    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 2 ms 10588 KB Output is correct
2 Correct 1 ms 10696 KB Output is correct
3 Correct 10 ms 25172 KB Output is correct
4 Correct 459 ms 360508 KB Output is correct
5 Correct 11 ms 24924 KB Output is correct
6 Correct 448 ms 360576 KB Output is correct

Subtask #2
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 16732 KB Output is correct
2 Runtime error 116 ms 40248 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 7 ms 16732 KB Output is correct
2 Correct 495 ms 361480 KB Output is correct
3 Correct 487 ms 361304 KB Output is correct
4 Correct 519 ms 361140 KB Output is correct
5 Correct 507 ms 361124 KB Output is correct
6 Correct 531 ms 361300 KB Output is correct
7 Correct 555 ms 361300 KB Output is correct
8 Correct 799 ms 361300 KB Output is correct
9 Correct 486 ms 361296 KB Output is correct
10 Correct 762 ms 361300 KB Output is correct
11 Correct 763 ms 361296 KB Output is correct
12 Correct 2021 ms 361300 KB Output is correct
13 Correct 1984 ms 361300 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16732 KB Output is correct
2 Correct 495 ms 361480 KB Output is correct
3 Correct 487 ms 361304 KB Output is correct
4 Correct 519 ms 361140 KB Output is correct
5 Correct 507 ms 361124 KB Output is correct
6 Correct 531 ms 361300 KB Output is correct
7 Correct 555 ms 361300 KB Output is correct
8 Correct 799 ms 361300 KB Output is correct
9 Correct 486 ms 361296 KB Output is correct
10 Correct 762 ms 361300 KB Output is correct
11 Correct 763 ms 361296 KB Output is correct
12 Correct 2021 ms 361300 KB Output is correct
13 Correct 1984 ms 361300 KB Output is correct
14 Correct 6 ms 16732 KB Output is correct
15 Correct 484 ms 361108 KB Output is correct
16 Correct 472 ms 361300 KB Output is correct
17 Correct 535 ms 361292 KB Output is correct
18 Correct 549 ms 361300 KB Output is correct
19 Correct 536 ms 361108 KB Output is correct
20 Correct 630 ms 361300 KB Output is correct
21 Correct 652 ms 361296 KB Output is correct
22 Correct 725 ms 361296 KB Output is correct
23 Correct 1126 ms 361436 KB Output is correct
24 Correct 1224 ms 361300 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16732 KB Output is correct
2 Correct 495 ms 361480 KB Output is correct
3 Correct 487 ms 361304 KB Output is correct
4 Correct 519 ms 361140 KB Output is correct
5 Correct 507 ms 361124 KB Output is correct
6 Correct 531 ms 361300 KB Output is correct
7 Correct 555 ms 361300 KB Output is correct
8 Correct 799 ms 361300 KB Output is correct
9 Correct 486 ms 361296 KB Output is correct
10 Correct 762 ms 361300 KB Output is correct
11 Correct 763 ms 361296 KB Output is correct
12 Correct 2021 ms 361300 KB Output is correct
13 Correct 1984 ms 361300 KB Output is correct
14 Correct 6 ms 16732 KB Output is correct
15 Correct 484 ms 361108 KB Output is correct
16 Correct 472 ms 361300 KB Output is correct
17 Correct 535 ms 361292 KB Output is correct
18 Correct 549 ms 361300 KB Output is correct
19 Correct 536 ms 361108 KB Output is correct
20 Correct 630 ms 361300 KB Output is correct
21 Correct 652 ms 361296 KB Output is correct
22 Correct 725 ms 361296 KB Output is correct
23 Correct 1126 ms 361436 KB Output is correct
24 Correct 1224 ms 361300 KB Output is correct
25 Correct 466 ms 360532 KB Output is correct
26 Correct 482 ms 361180 KB Output is correct
27 Correct 463 ms 361296 KB Output is correct
28 Correct 467 ms 361244 KB Output is correct
29 Correct 510 ms 361196 KB Output is correct
30 Correct 694 ms 361180 KB Output is correct
31 Correct 739 ms 361300 KB Output is correct
32 Correct 792 ms 361132 KB Output is correct
33 Correct 606 ms 361040 KB Output is correct
34 Correct 695 ms 361040 KB Output is correct
35 Correct 621 ms 361300 KB Output is correct

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 16732 KB Output is correct
2 Runtime error 116 ms 40248 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -