제출 #603967

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
603967		keta_tsimakuridze	던전 (IOI21_dungeons)	C++17	26 / 100	680 ms	338292 KiB

dungeons

#include "dungeons.h"
#include<bits/stdc++.h>
#define pii pair<long long, long long>
#define f first
#define s second
using namespace std;
#include <vector>
vector<int> s, p, w, l;
int n;
const long long inf = 1e18;
const int N =4e5 + 5;
long long nxt[N][33], add[N][33], mx[N][33];
void init(int N, std::vector<int> S, std::vector<int> P, std::vector<int> W, std::vector<int> L) {
    s = S; p = P; w = W; l = L;
    n = N;
    for(int i = 0; i < n; i++) nxt[i][0]= w[i], add[i][0] = s[i], mx[i][0] = s[i];
    nxt[n][0] = n;
    mx[n][0] = -1e9;
    for(int i = 1; i <= 30; i++) {
        for(int j = 0; j <= n; j++) {
            nxt[j][i] = nxt[nxt[j][i - 1]][i - 1],
            add[j][i]= add[j][i -  1] + add[nxt[j][i - 1]][i - 1];
            mx[j][i] = max(mx[j][i - 1], -add[j][i - 1] + mx[nxt[j][i - 1]][i - 1]);
        }
    }
}
long long simulate(int x, int Z) {
	long long  ans2 = Z, cn = 0;
	while(x != n) {
        ++cn;
        assert(cn <= 30);
        for(int i = 30; i >= 0; i--) {
            if(mx[x][i] <= ans2) {
                ans2 += add[x][i];
                x = nxt[x][i];
            } //else cout << "+" << 30 << endl;
        }
        if(x == n) break;
        assert(ans2 < s[x]);
        ans2 += s[x];
        x = l[x];
	}
    return ans2;
}

• Subtask 1: 0 / 11
• Subtask 2: 26 / 26
• Subtask 3: 0 / 13
• Subtask 4: 0 / 12
• Subtask 5: 0 / 27
• Subtask 6: 0 / 11