oj.uz

Submission #440359

# Submission time Handle Problem Language Result Execution time Memory
440359 2021-07-02T07:16:17 Z two_sides Dungeons Game (IOI21_dungeons) C++17
100 / 100
 5127 ms 561732 KB 
#include <bits/stdc++.h>

using namespace std;

namespace {
    template <class X, class Y>
    bool cmin(X &a, const Y &b) {
        return a > b ? a = b, 1 : 0;
    }

    const int MAXN = 400005;
    const long long INF = 1e9;

    struct path {
        int dest;
        long long mini, suma;
    };

    long long str[MAXN], bns[MAXN];
    int win[MAXN], lose[MAXN], N;
    path jump[MAXN][3][19];
    long long tail[MAXN];
}

void init(int n, vector<int> s, vector<int> p,
vector<int> w, vector<int> l) {
    copy(s.begin(), s.end(), str);
    copy(p.begin(), p.end(), bns);
    copy(w.begin(), w.end(), win);
    copy(l.begin(), l.end(), lose);
    str[N = n] = bns[n] = INF;
    win[N] = lose[N] = N;
    for (int i = N - 1; i >= 0; i--)
        tail[i] = tail[win[i]] + str[i];
    for (int a = 0; a < 3; a++) {
        int lo = 1 << (a << 3);
        int hi = 1 << ((a + 1) << 3);
        for (int i = 0; i <= N; i++)
            if ((lo <= str[i] && str[i] < hi) || i == N)
                jump[i][a][0] = {lose[i], str[i], bns[i]};
            else if (str[i] < lo)
                jump[i][a][0] = {win[i], INF, str[i]};
            else jump[i][a][0] = {lose[i], INF, bns[i]};
        for (int b = 1; b < 19; b++)
            for (int i = 0; i <= N; i++) {
                path &cur = jump[i][a][b];
                cur.dest = i;
                cur.mini = INF; cur.suma = 0;
                for (int j = 0; j < 2; j++) {
                    path nxt = jump[cur.dest][a][b - 1];
                    cmin(cur.mini, nxt.mini - cur.suma);
                    cur.suma += nxt.suma;
                    cur.dest = nxt.dest;
                }
            }
    }
}

long long simulate(int x, int z) {
    path cur = {x, 0, z};
    for (int a = 0; a < 3; a++) {
        int lo = 1 << (a << 3);
        int hi = 1 << ((a + 1) << 3);
        while (cur.dest < N && lo <= cur.suma && cur.suma < hi) {
            for (int b = 18; b >= 0; b--)
                while (cur.suma < jump[cur.dest][a][b].mini &&
                cur.suma + jump[cur.dest][a][b].suma < hi) {
                    cur.suma += jump[cur.dest][a][b].suma;
                    cur.dest = jump[cur.dest][a][b].dest;
                }
            if (cur.dest < N) {
                if (cur.suma < str[cur.dest]) {
                    cur.suma += bns[cur.dest];
                    cur.dest = lose[cur.dest];
                } else {
                    cur.suma += str[cur.dest];
                    cur.dest = win[cur.dest];
                }
            }
        }
    }
    return cur.suma + tail[cur.dest];
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 4 ms 3144 KB Output is correct
4 Correct 175 ms 70336 KB Output is correct
5 Correct 4 ms 3020 KB Output is correct
6 Correct 154 ms 70336 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1740 KB Output is correct
2 Correct 1676 ms 561536 KB Output is correct
3 Correct 1523 ms 561584 KB Output is correct
4 Correct 1691 ms 561556 KB Output is correct
5 Correct 1681 ms 561604 KB Output is correct
6 Correct 2616 ms 561548 KB Output is correct
7 Correct 3171 ms 561676 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1740 KB Output is correct
2 Correct 265 ms 71288 KB Output is correct
3 Correct 203 ms 71180 KB Output is correct
4 Correct 196 ms 71108 KB Output is correct
5 Correct 205 ms 71108 KB Output is correct
6 Correct 220 ms 71252 KB Output is correct
7 Correct 199 ms 71124 KB Output is correct
8 Correct 368 ms 71120 KB Output is correct
9 Correct 203 ms 71184 KB Output is correct
10 Correct 679 ms 71244 KB Output is correct
11 Correct 239 ms 71108 KB Output is correct
12 Correct 656 ms 71124 KB Output is correct
13 Correct 645 ms 71108 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1740 KB Output is correct
2 Correct 265 ms 71288 KB Output is correct
3 Correct 203 ms 71180 KB Output is correct
4 Correct 196 ms 71108 KB Output is correct
5 Correct 205 ms 71108 KB Output is correct
6 Correct 220 ms 71252 KB Output is correct
7 Correct 199 ms 71124 KB Output is correct
8 Correct 368 ms 71120 KB Output is correct
9 Correct 203 ms 71184 KB Output is correct
10 Correct 679 ms 71244 KB Output is correct
11 Correct 239 ms 71108 KB Output is correct
12 Correct 656 ms 71124 KB Output is correct
13 Correct 645 ms 71108 KB Output is correct
14 Correct 3 ms 1740 KB Output is correct
15 Correct 191 ms 71088 KB Output is correct
16 Correct 214 ms 71108 KB Output is correct
17 Correct 212 ms 71124 KB Output is correct
18 Correct 212 ms 71112 KB Output is correct
19 Correct 249 ms 71184 KB Output is correct
20 Correct 465 ms 71188 KB Output is correct
21 Correct 704 ms 71292 KB Output is correct
22 Correct 1128 ms 71188 KB Output is correct
23 Correct 332 ms 71108 KB Output is correct
24 Correct 491 ms 71116 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1740 KB Output is correct
2 Correct 265 ms 71288 KB Output is correct
3 Correct 203 ms 71180 KB Output is correct
4 Correct 196 ms 71108 KB Output is correct
5 Correct 205 ms 71108 KB Output is correct
6 Correct 220 ms 71252 KB Output is correct
7 Correct 199 ms 71124 KB Output is correct
8 Correct 368 ms 71120 KB Output is correct
9 Correct 203 ms 71184 KB Output is correct
10 Correct 679 ms 71244 KB Output is correct
11 Correct 239 ms 71108 KB Output is correct
12 Correct 656 ms 71124 KB Output is correct
13 Correct 645 ms 71108 KB Output is correct
14 Correct 3 ms 1740 KB Output is correct
15 Correct 191 ms 71088 KB Output is correct
16 Correct 214 ms 71108 KB Output is correct
17 Correct 212 ms 71124 KB Output is correct
18 Correct 212 ms 71112 KB Output is correct
19 Correct 249 ms 71184 KB Output is correct
20 Correct 465 ms 71188 KB Output is correct
21 Correct 704 ms 71292 KB Output is correct
22 Correct 1128 ms 71188 KB Output is correct
23 Correct 332 ms 71108 KB Output is correct
24 Correct 491 ms 71116 KB Output is correct
25 Correct 196 ms 70412 KB Output is correct
26 Correct 206 ms 71120 KB Output is correct
27 Correct 226 ms 71188 KB Output is correct
28 Correct 194 ms 71180 KB Output is correct
29 Correct 225 ms 71184 KB Output is correct
30 Correct 338 ms 71256 KB Output is correct
31 Correct 464 ms 71104 KB Output is correct
32 Correct 460 ms 71108 KB Output is correct
33 Correct 727 ms 71108 KB Output is correct
34 Correct 1342 ms 71148 KB Output is correct
35 Correct 1290 ms 71108 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1740 KB Output is correct
2 Correct 1676 ms 561536 KB Output is correct
3 Correct 1523 ms 561584 KB Output is correct
4 Correct 1691 ms 561556 KB Output is correct
5 Correct 1681 ms 561604 KB Output is correct
6 Correct 2616 ms 561548 KB Output is correct
7 Correct 3171 ms 561676 KB Output is correct
8 Correct 3 ms 1740 KB Output is correct
9 Correct 265 ms 71288 KB Output is correct
10 Correct 203 ms 71180 KB Output is correct
11 Correct 196 ms 71108 KB Output is correct
12 Correct 205 ms 71108 KB Output is correct
13 Correct 220 ms 71252 KB Output is correct
14 Correct 199 ms 71124 KB Output is correct
15 Correct 368 ms 71120 KB Output is correct
16 Correct 203 ms 71184 KB Output is correct
17 Correct 679 ms 71244 KB Output is correct
18 Correct 239 ms 71108 KB Output is correct
19 Correct 656 ms 71124 KB Output is correct
20 Correct 645 ms 71108 KB Output is correct
21 Correct 3 ms 1740 KB Output is correct
22 Correct 191 ms 71088 KB Output is correct
23 Correct 214 ms 71108 KB Output is correct
24 Correct 212 ms 71124 KB Output is correct
25 Correct 212 ms 71112 KB Output is correct
26 Correct 249 ms 71184 KB Output is correct
27 Correct 465 ms 71188 KB Output is correct
28 Correct 704 ms 71292 KB Output is correct
29 Correct 1128 ms 71188 KB Output is correct
30 Correct 332 ms 71108 KB Output is correct
31 Correct 491 ms 71116 KB Output is correct
32 Correct 196 ms 70412 KB Output is correct
33 Correct 206 ms 71120 KB Output is correct
34 Correct 226 ms 71188 KB Output is correct
35 Correct 194 ms 71180 KB Output is correct
36 Correct 225 ms 71184 KB Output is correct
37 Correct 338 ms 71256 KB Output is correct
38 Correct 464 ms 71104 KB Output is correct
39 Correct 460 ms 71108 KB Output is correct
40 Correct 727 ms 71108 KB Output is correct
41 Correct 1342 ms 71148 KB Output is correct
42 Correct 1290 ms 71108 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 3 ms 1740 KB Output is correct
45 Correct 1851 ms 561616 KB Output is correct
46 Correct 1685 ms 561648 KB Output is correct
47 Correct 1696 ms 561548 KB Output is correct
48 Correct 1554 ms 561476 KB Output is correct
49 Correct 1762 ms 561644 KB Output is correct
50 Correct 1767 ms 561648 KB Output is correct
51 Correct 1515 ms 561552 KB Output is correct
52 Correct 1817 ms 561604 KB Output is correct
53 Correct 2872 ms 561604 KB Output is correct
54 Correct 2407 ms 561472 KB Output is correct
55 Correct 3002 ms 561604 KB Output is correct
56 Correct 4349 ms 561544 KB Output is correct
57 Correct 3447 ms 561604 KB Output is correct
58 Correct 3633 ms 561732 KB Output is correct
59 Correct 3204 ms 561548 KB Output is correct
60 Correct 5127 ms 561656 KB Output is correct
61 Correct 4877 ms 561644 KB Output is correct