oj.uz

Submission #442850

# Submission time Handle Problem Language Result Execution time Memory
442850 2021-07-09T09:11:56 Z baluteshih Dungeons Game (IOI21_dungeons) C++17
0 / 100
 2 ms 1100 KB 
#include "dungeons.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define SZ(a) ((int)a.size())

struct node {
    int to, lower;
    ll sum;
    node operator+(const node &a) const {
        node rt;
        rt.to = a.to;
        rt.sum = sum + a.sum;
        if (lower + sum < a.lower)
            rt.lower = a.lower - sum;
        else
            rt.lower = lower;
        return rt;
    }
};

struct node2 {
    int to, upper;
    ll sum;
    node2 operator+(const node2 &a) const {
        node2 rt;
        rt.to = a.to;
        rt.sum = sum + a.sum;
        if (upper + sum > a.upper)
            rt.upper = a.upper - sum;
        else
            rt.upper = upper;
        return rt;
    }
};

int N, lg = __lg(10000000);
vector<int> S, P, W, L;
vector<node> dp[30];
vector<node2> dp2[30];

void init(int n, vector<int> s, vector<int> p, vector<int> w, vector<int> l) {
    N = n, S = s, P = p, W = w, L = l;
    dp[0].resize(N + 1);
    dp[0][N] = node{N, 0, 0};
    for (int i = 0; i < N; ++i)
       dp[0][i] = node{W[i], S[i], S[i]};
    for (int i = 1; i <= lg; ++i) {
        dp[i].resize(N + 1);
        for (int j = 0; j <= N; ++j)
            dp[i][j] = dp[i - 1][j] + dp[i - 1][dp[i - 1][j].to];
    }
    dp2[0].resize(N + 1);
    dp2[0][N] = node2{N, 0, 0};
    for (int i = 0; i < N; ++i)
       dp2[0][i] = node2{L[i], S[i] - 1, P[i]};
    for (int i = 1; i <= lg; ++i) {
        dp2[i].resize(N + 1);
        for (int j = 0; j <= N; ++j)
            dp2[i][j] = dp2[i - 1][j] + dp2[i - 1][dp2[i - 1][j].to];
    }
}

long long simulate(int x, int z) {
    ll nw = z;
    while (dp[lg][x].lower > nw) {
        for (int i = lg; i >= 0; --i)
            if (dp[i][x].lower <= nw) {
                nw += dp[i][x].sum;
                x = dp[i][x].to;
            }
        for (int i = lg; i >= 0; --i)
            if (dp2[i][x].upper >= nw) {
                nw += dp2[i][x].sum;
                x = dp2[i][x].to;
            }
    }
    return nw + dp[lg][x].sum;
}

Subtask #1
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1100 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1100 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1100 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1100 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1100 KB Output isn't correct
2 Halted 0 ms 0 KB -