oj.uz

Submission #990943

# Submission time Handle Problem Language Result Execution time Memory
990943 2024-05-31T20:45:58 Z AdamGS Dungeons Game (IOI21_dungeons) C++17
89 / 100
 7000 ms 1867376 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#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) {
        int a=nxt[j][i][l-1], b=nxt[a][i][l-1];
        nxt[j][i][l]=nxt[b][i][l-1];
        sum[j][i][l]=sum[j][i][l-1]+sum[a][i][l-1]+sum[b][i][l-1];
        ile[j][i][l]=min(ile[j][i][l-1], min(ile[a][i][l-1]-sum[j][i][l-1], ile[b][i][l-1]-sum[j][i][l-1]-sum[a][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) if(nxt[x][i][j]<n && ile[x][i][j]>z) {
      z+=sum[x][i][j];
      x=nxt[x][i][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 16728 KB Output is correct
2 Correct 1 ms 12884 KB Output is correct
3 Correct 10 ms 19292 KB Output is correct
4 Correct 335 ms 246484 KB Output is correct
5 Correct 8 ms 19292 KB Output is correct
6 Correct 351 ms 246364 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 16476 KB Output is correct
2 Correct 4551 ms 1867376 KB Output is correct
3 Correct 4493 ms 1867344 KB Output is correct
4 Correct 4195 ms 1867324 KB Output is correct
5 Correct 3340 ms 1867348 KB Output is correct
6 Correct 5157 ms 1867312 KB Output is correct
7 Correct 4634 ms 1867160 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 16476 KB Output is correct
2 Correct 467 ms 247276 KB Output is correct
3 Correct 328 ms 247124 KB Output is correct
4 Correct 301 ms 247140 KB Output is correct
5 Correct 320 ms 247064 KB Output is correct
6 Correct 484 ms 247124 KB Output is correct
7 Correct 481 ms 247120 KB Output is correct
8 Correct 538 ms 247208 KB Output is correct
9 Correct 334 ms 247116 KB Output is correct
10 Correct 508 ms 247124 KB Output is correct
11 Correct 837 ms 247272 KB Output is correct
12 Correct 1956 ms 247120 KB Output is correct
13 Correct 1552 ms 247204 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 16476 KB Output is correct
2 Correct 467 ms 247276 KB Output is correct
3 Correct 328 ms 247124 KB Output is correct
4 Correct 301 ms 247140 KB Output is correct
5 Correct 320 ms 247064 KB Output is correct
6 Correct 484 ms 247124 KB Output is correct
7 Correct 481 ms 247120 KB Output is correct
8 Correct 538 ms 247208 KB Output is correct
9 Correct 334 ms 247116 KB Output is correct
10 Correct 508 ms 247124 KB Output is correct
11 Correct 837 ms 247272 KB Output is correct
12 Correct 1956 ms 247120 KB Output is correct
13 Correct 1552 ms 247204 KB Output is correct
14 Correct 5 ms 16472 KB Output is correct
15 Correct 358 ms 247232 KB Output is correct
16 Correct 443 ms 247124 KB Output is correct
17 Correct 355 ms 247124 KB Output is correct
18 Correct 361 ms 247164 KB Output is correct
19 Correct 527 ms 247320 KB Output is correct
20 Correct 477 ms 247400 KB Output is correct
21 Correct 554 ms 247380 KB Output is correct
22 Correct 557 ms 247276 KB Output is correct
23 Correct 1120 ms 247120 KB Output is correct
24 Correct 1439 ms 247120 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 16476 KB Output is correct
2 Correct 467 ms 247276 KB Output is correct
3 Correct 328 ms 247124 KB Output is correct
4 Correct 301 ms 247140 KB Output is correct
5 Correct 320 ms 247064 KB Output is correct
6 Correct 484 ms 247124 KB Output is correct
7 Correct 481 ms 247120 KB Output is correct
8 Correct 538 ms 247208 KB Output is correct
9 Correct 334 ms 247116 KB Output is correct
10 Correct 508 ms 247124 KB Output is correct
11 Correct 837 ms 247272 KB Output is correct
12 Correct 1956 ms 247120 KB Output is correct
13 Correct 1552 ms 247204 KB Output is correct
14 Correct 5 ms 16472 KB Output is correct
15 Correct 358 ms 247232 KB Output is correct
16 Correct 443 ms 247124 KB Output is correct
17 Correct 355 ms 247124 KB Output is correct
18 Correct 361 ms 247164 KB Output is correct
19 Correct 527 ms 247320 KB Output is correct
20 Correct 477 ms 247400 KB Output is correct
21 Correct 554 ms 247380 KB Output is correct
22 Correct 557 ms 247276 KB Output is correct
23 Correct 1120 ms 247120 KB Output is correct
24 Correct 1439 ms 247120 KB Output is correct
25 Correct 466 ms 246472 KB Output is correct
26 Correct 490 ms 247376 KB Output is correct
27 Correct 359 ms 247120 KB Output is correct
28 Correct 352 ms 247124 KB Output is correct
29 Correct 490 ms 247124 KB Output is correct
30 Correct 577 ms 247120 KB Output is correct
31 Correct 673 ms 247268 KB Output is correct
32 Correct 1105 ms 247268 KB Output is correct
33 Correct 479 ms 247044 KB Output is correct
34 Correct 597 ms 247124 KB Output is correct
35 Correct 783 ms 247120 KB Output is correct

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 16476 KB Output is correct
2 Correct 4551 ms 1867376 KB Output is correct
3 Correct 4493 ms 1867344 KB Output is correct
4 Correct 4195 ms 1867324 KB Output is correct
5 Correct 3340 ms 1867348 KB Output is correct
6 Correct 5157 ms 1867312 KB Output is correct
7 Correct 4634 ms 1867160 KB Output is correct
8 Correct 5 ms 16476 KB Output is correct
9 Correct 467 ms 247276 KB Output is correct
10 Correct 328 ms 247124 KB Output is correct
11 Correct 301 ms 247140 KB Output is correct
12 Correct 320 ms 247064 KB Output is correct
13 Correct 484 ms 247124 KB Output is correct
14 Correct 481 ms 247120 KB Output is correct
15 Correct 538 ms 247208 KB Output is correct
16 Correct 334 ms 247116 KB Output is correct
17 Correct 508 ms 247124 KB Output is correct
18 Correct 837 ms 247272 KB Output is correct
19 Correct 1956 ms 247120 KB Output is correct
20 Correct 1552 ms 247204 KB Output is correct
21 Correct 5 ms 16472 KB Output is correct
22 Correct 358 ms 247232 KB Output is correct
23 Correct 443 ms 247124 KB Output is correct
24 Correct 355 ms 247124 KB Output is correct
25 Correct 361 ms 247164 KB Output is correct
26 Correct 527 ms 247320 KB Output is correct
27 Correct 477 ms 247400 KB Output is correct
28 Correct 554 ms 247380 KB Output is correct
29 Correct 557 ms 247276 KB Output is correct
30 Correct 1120 ms 247120 KB Output is correct
31 Correct 1439 ms 247120 KB Output is correct
32 Correct 466 ms 246472 KB Output is correct
33 Correct 490 ms 247376 KB Output is correct
34 Correct 359 ms 247120 KB Output is correct
35 Correct 352 ms 247124 KB Output is correct
36 Correct 490 ms 247124 KB Output is correct
37 Correct 577 ms 247120 KB Output is correct
38 Correct 673 ms 247268 KB Output is correct
39 Correct 1105 ms 247268 KB Output is correct
40 Correct 479 ms 247044 KB Output is correct
41 Correct 597 ms 247124 KB Output is correct
42 Correct 783 ms 247120 KB Output is correct
43 Correct 2 ms 16732 KB Output is correct
44 Correct 6 ms 16384 KB Output is correct
45 Correct 5839 ms 1867320 KB Output is correct
46 Correct 3689 ms 1867344 KB Output is correct
47 Correct 3674 ms 1867316 KB Output is correct
48 Correct 3378 ms 1867316 KB Output is correct
49 Correct 6092 ms 1867316 KB Output is correct
50 Correct 4854 ms 1867348 KB Output is correct
51 Correct 3262 ms 1867344 KB Output is correct
52 Correct 4855 ms 1867320 KB Output is correct
53 Execution timed out 7129 ms 1718904 KB Time limit exceeded
54 Halted 0 ms 0 KB -