oj.uz

Submission #950662

# Submission time Handle Problem Language Result Execution time Memory
950662 2024-03-20T14:39:10 Z Nhoksocqt1 Dungeons Game (IOI21_dungeons) C++17
50 / 100
 7000 ms 322364 KB 
#include<bits/stdc++.h>
using namespace std;

#define inf 0x3f3f3f3f
#define sz(x) int((x).size())
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> ii;

template<class X, class Y>
	inline bool maximize(X &x, const Y &y) {return (x < y ? x = y, 1 : 0);}
template<class X, class Y>
	inline bool minimize(X &x, const Y &y) {return (x > y ? x = y, 1 : 0);}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int Random(int l, int r) {
    return uniform_int_distribution<int>(l, r)(rng);
}

const int MAXN = 400005;

struct Dungeon {
    int s, p, w, l;
} dungeons[MAXN];

ll Psums[MAXN][24], Psump[MAXN][24];
int Pl[MAXN][24], Psi[MAXN][24];
int Pw[MAXN][24], Psa[MAXN][24], depth[MAXN], nArr;
bool check_sub2, check_sub3;

void init(int _N, vector<int> _S, vector<int> _P, vector<int> _W, vector<int> _L) {
    nArr = _N;
    check_sub2 = check_sub3 = 1;
    for (int i = 0; i < nArr; ++i) {
        dungeons[i] = {_S[i], _P[i], _W[i], _L[i]};
        check_sub2 &= (dungeons[i].s == dungeons[i].p);
        check_sub3 &= (dungeons[i].s == dungeons[0].s);
    }

    depth[nArr] = 0;
    Pw[nArr][0] = Pl[nArr][0] = -1;
    for (int i = nArr - 1; i >= 0; --i) {
        Pw[i][0] = dungeons[i].w;
        Pl[i][0] = dungeons[i].l;
        depth[i] = depth[Pw[i][0]] + 1;
        Psi[i][0] = Psa[i][0] = Psums[i][0] = dungeons[i].s;
        Psump[i][0] = dungeons[i].p;
    }

    for (int j = 1; j < 24; ++j) {
        for (int i = 0; i <= nArr; ++i) {
            if(Pl[i][j - 1] == -1) {
                Pl[i][j] = -1;
            } else {
                Pl[i][j] = Pl[Pl[i][j - 1]][j - 1];
                Psi[i][j] = min(Psi[i][j - 1], Psi[Pl[i][j - 1]][j - 1]);
                Psump[i][j] = Psump[i][j - 1] + Psump[Pl[i][j - 1]][j - 1];
            }

            if(Pw[i][j - 1] == -1) {
                Pw[i][j] = -1;
            } else {
                Pw[i][j] = Pw[Pw[i][j - 1]][j - 1];
                Psa[i][j] = max(Psa[i][j - 1], Psa[Pw[i][j - 1]][j - 1]);
                Psums[i][j] = Psums[i][j - 1] + Psums[Pw[i][j - 1]][j - 1];
            }
        }
    }
}

ll sub1(int x, ll z) {
    while(x < nArr) {
        if(z >= dungeons[x].s) {
            z += dungeons[x].s;
            x = dungeons[x].w;
        } else {
            z += dungeons[x].p;
            x = dungeons[x].l;
        }
    }

    return z;
}

// z < s[i] do not exceed log2(max(s[i])) time
ll sub2(int x, ll z) {
    while(x < nArr) {
        for (int i = 31 - __builtin_clz(depth[x]); i >= 0; --i) {
            if(Pw[x][i] != -1 && Psa[x][i] <= z) {
                z += Psums[x][i];
                x = Pw[x][i];
            }
        }

        if(x < nArr && z < dungeons[x].s) {
            z += dungeons[x].p;
            x = dungeons[x].l;
        }
    }

    return z;
}

// lose all until z >= s[.]
ll sub3(int x, ll z) {
    for (int i = 23; i >= 0; --i) {
        if(Pl[x][i] != -1 && z + Psump[x][i] < dungeons[0].s) {
            z += Psump[x][i];
            x = Pl[x][i];
        }
    }

    if(x < nArr && z < dungeons[0].s) {
        z += Psump[x][0];
        x = Pl[x][0];
    }

    if(x < nArr) {
        assert(z >= dungeons[0].s);
        for (int i = 31 - __builtin_clz(depth[x]); i >= 0; --i) {
            if(Pw[x][i] != -1) {
                z += Psums[x][i];
                x = Pw[x][i];
            }
        }
    }

    return z;
}

ll simulate(int x, int z) {
    if(check_sub2)
        return sub2(x, z);

    if(check_sub3)
        return sub3(x, z);

    return sub1(x, z);
}

#ifdef Nhoksocqt1

int main(void) {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    #define TASK "dungeons"
    if(fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }

    vector<int> _S, _P, _W, _L;
    int nArr, numQuery;
    cin >> nArr >> numQuery;

    _S.resize(nArr), _P.resize(nArr), _W.resize(nArr), _L.resize(nArr);
    for (int i = 0; i < nArr; ++i)
        cin >> _S[i] >> _P[i] >> _W[i] >> _L[i];

    init(nArr, _S, _P, _W, _L);
    for (int t = 0; t < numQuery; ++t) {
        int x, z;
        cin >> x >> z;
        cout << "ANSWER FOR SIMULATE(" << x << "," << z << ") = " << simulate(x, z) << '\n';
    }

    return 0;
}

#endif // Nhoksocqt1

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 3 ms 18948 KB Output is correct
4 Correct 45 ms 55388 KB Output is correct
5 Correct 3 ms 18776 KB Output is correct
6 Correct 42 ms 55520 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 18780 KB Output is correct
2 Correct 597 ms 322364 KB Output is correct
3 Correct 486 ms 322168 KB Output is correct
4 Correct 472 ms 322116 KB Output is correct
5 Correct 422 ms 322168 KB Output is correct
6 Correct 505 ms 322116 KB Output is correct
7 Correct 509 ms 322120 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 18780 KB Output is correct
2 Correct 71 ms 56320 KB Output is correct
3 Correct 84 ms 56156 KB Output is correct
4 Correct 83 ms 56152 KB Output is correct
5 Correct 92 ms 56316 KB Output is correct
6 Correct 68 ms 56328 KB Output is correct
7 Correct 71 ms 56400 KB Output is correct
8 Correct 81 ms 56312 KB Output is correct
9 Correct 69 ms 56152 KB Output is correct
10 Correct 80 ms 56156 KB Output is correct
11 Correct 70 ms 56080 KB Output is correct
12 Correct 114 ms 57576 KB Output is correct
13 Correct 86 ms 57576 KB Output is correct

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 18780 KB Output is correct
2 Correct 71 ms 56320 KB Output is correct
3 Correct 84 ms 56156 KB Output is correct
4 Correct 83 ms 56152 KB Output is correct
5 Correct 92 ms 56316 KB Output is correct
6 Correct 68 ms 56328 KB Output is correct
7 Correct 71 ms 56400 KB Output is correct
8 Correct 81 ms 56312 KB Output is correct
9 Correct 69 ms 56152 KB Output is correct
10 Correct 80 ms 56156 KB Output is correct
11 Correct 70 ms 56080 KB Output is correct
12 Correct 114 ms 57576 KB Output is correct
13 Correct 86 ms 57576 KB Output is correct
14 Correct 4 ms 18780 KB Output is correct
15 Correct 131 ms 57688 KB Output is correct
16 Correct 61 ms 57928 KB Output is correct
17 Correct 1569 ms 57292 KB Output is correct
18 Correct 1704 ms 57324 KB Output is correct
19 Correct 4568 ms 57564 KB Output is correct
20 Correct 3018 ms 57432 KB Output is correct
21 Correct 2843 ms 57456 KB Output is correct
22 Correct 2145 ms 57424 KB Output is correct
23 Execution timed out 7080 ms 57432 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #5
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 18780 KB Output is correct
2 Correct 71 ms 56320 KB Output is correct
3 Correct 84 ms 56156 KB Output is correct
4 Correct 83 ms 56152 KB Output is correct
5 Correct 92 ms 56316 KB Output is correct
6 Correct 68 ms 56328 KB Output is correct
7 Correct 71 ms 56400 KB Output is correct
8 Correct 81 ms 56312 KB Output is correct
9 Correct 69 ms 56152 KB Output is correct
10 Correct 80 ms 56156 KB Output is correct
11 Correct 70 ms 56080 KB Output is correct
12 Correct 114 ms 57576 KB Output is correct
13 Correct 86 ms 57576 KB Output is correct
14 Correct 4 ms 18780 KB Output is correct
15 Correct 131 ms 57688 KB Output is correct
16 Correct 61 ms 57928 KB Output is correct
17 Correct 1569 ms 57292 KB Output is correct
18 Correct 1704 ms 57324 KB Output is correct
19 Correct 4568 ms 57564 KB Output is correct
20 Correct 3018 ms 57432 KB Output is correct
21 Correct 2843 ms 57456 KB Output is correct
22 Correct 2145 ms 57424 KB Output is correct
23 Execution timed out 7080 ms 57432 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 18780 KB Output is correct
2 Correct 597 ms 322364 KB Output is correct
3 Correct 486 ms 322168 KB Output is correct
4 Correct 472 ms 322116 KB Output is correct
5 Correct 422 ms 322168 KB Output is correct
6 Correct 505 ms 322116 KB Output is correct
7 Correct 509 ms 322120 KB Output is correct
8 Correct 3 ms 18780 KB Output is correct
9 Correct 71 ms 56320 KB Output is correct
10 Correct 84 ms 56156 KB Output is correct
11 Correct 83 ms 56152 KB Output is correct
12 Correct 92 ms 56316 KB Output is correct
13 Correct 68 ms 56328 KB Output is correct
14 Correct 71 ms 56400 KB Output is correct
15 Correct 81 ms 56312 KB Output is correct
16 Correct 69 ms 56152 KB Output is correct
17 Correct 80 ms 56156 KB Output is correct
18 Correct 70 ms 56080 KB Output is correct
19 Correct 114 ms 57576 KB Output is correct
20 Correct 86 ms 57576 KB Output is correct
21 Correct 4 ms 18780 KB Output is correct
22 Correct 131 ms 57688 KB Output is correct
23 Correct 61 ms 57928 KB Output is correct
24 Correct 1569 ms 57292 KB Output is correct
25 Correct 1704 ms 57324 KB Output is correct
26 Correct 4568 ms 57564 KB Output is correct
27 Correct 3018 ms 57432 KB Output is correct
28 Correct 2843 ms 57456 KB Output is correct
29 Correct 2145 ms 57424 KB Output is correct
30 Execution timed out 7080 ms 57432 KB Time limit exceeded
31 Halted 0 ms 0 KB -