oj.uz

Submission #442814

# Submission time Handle Problem Language Result Execution time Memory
442814 2021-07-09T07:48:24 Z SorahISA Dungeons Game (IOI21_dungeons) C++17
37 / 100
 472 ms 204836 KB 
#include "dungeons.h"
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#define int long long
// #define double long double
using pii = pair<int, int>;
template<typename T>
using Prior = std::priority_queue<T>;
template<typename T>
using prior = std::priority_queue<T, vector<T>, greater<T>>;

#define X first
#define Y second
#define eb emplace_back
#define pb pop_back
#define pf pop_front
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)

namespace {

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 4E5 + 5;
const int lgmx = 19;

int N;
vector<int> S, P, W, L;

int anc[lgmx][maxn], mxm[lgmx][maxn], sum[lgmx][maxn];

} /// end of namespace

void init(int32_t _N, vector<int32_t> _S, vector<int32_t> _P, vector<int32_t> _W, vector<int32_t> _L) {
    N = _N;
    for (auto &x : _S) S.eb(x);
    for (auto &x : _P) P.eb(x);
    for (auto &x : _W) W.eb(x);
    for (auto &x : _L) L.eb(x);
    S.eb(0), P.eb(0), W.eb(N), L.eb(N);
    
    memset(anc, 0x00, sizeof(anc));
    memset(mxm, 0x00, sizeof(mxm));
    memset(sum, 0x00, sizeof(sum));
    
    for (int i = 0; i <= N; ++i) {
        anc[0][i] = W[i];
        mxm[0][i] = S[i];
        sum[0][i] = S[i];
    }
    
    for (int lay = 1; lay < lgmx; ++lay) {
        for (int i = 0; i <= N; ++i) {
            int par = anc[lay-1][i];
            anc[lay][i] = anc[lay-1][par];
            mxm[lay][i] = max(mxm[lay-1][i], mxm[lay-1][par]);
            sum[lay][i] = sum[lay-1][i] + sum[lay-1][par];
        }
    }
}

int simulate(int32_t now, int32_t Z) {
    /// s[i] = p[i] ///
    while (now != N) {
        // cerr << "now: " << now << " " << Z << "\n";
        for (int lay = lgmx-1; lay >= 0; --lay) {
            // cerr << lay << " " << now << " " << mxm[lay][now] << "\n";
            if (Z >= mxm[lay][now]) {
                Z += sum[lay][now];
                now = anc[lay][now];
            }
        }
        if (Z >= S[now]) Z += S[now], now = W[now];
        else             Z += P[now], now = L[now];
    }
    return Z;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 178764 KB Output is correct
2 Correct 82 ms 178640 KB Output is correct
3 Correct 84 ms 178808 KB Output is correct
4 Correct 113 ms 181984 KB Output is correct
5 Correct 83 ms 178920 KB Output is correct
6 Correct 114 ms 181956 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 178756 KB Output is correct
2 Correct 399 ms 204836 KB Output is correct
3 Correct 361 ms 204704 KB Output is correct
4 Correct 350 ms 204680 KB Output is correct
5 Correct 401 ms 204664 KB Output is correct
6 Correct 426 ms 204836 KB Output is correct
7 Correct 472 ms 204760 KB Output is correct

Subtask #3
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 178756 KB Output is correct
2 Correct 146 ms 182716 KB Output is correct
3 Incorrect 151 ms 182728 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 178756 KB Output is correct
2 Correct 146 ms 182716 KB Output is correct
3 Incorrect 151 ms 182728 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 178756 KB Output is correct
2 Correct 146 ms 182716 KB Output is correct
3 Incorrect 151 ms 182728 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 178756 KB Output is correct
2 Correct 399 ms 204836 KB Output is correct
3 Correct 361 ms 204704 KB Output is correct
4 Correct 350 ms 204680 KB Output is correct
5 Correct 401 ms 204664 KB Output is correct
6 Correct 426 ms 204836 KB Output is correct
7 Correct 472 ms 204760 KB Output is correct
8 Correct 83 ms 178756 KB Output is correct
9 Correct 146 ms 182716 KB Output is correct
10 Incorrect 151 ms 182728 KB Output isn't correct
11 Halted 0 ms 0 KB -