제출 #621080

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

dungeons

#include "dungeons.h"
#ifndef EVAL
#include "grader.cpp"
#endif

#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
const int N = 4e5 + 5;
vector<int> edges[N];
ll s[N], p[N], w[N], l[N], n;
ll pref[N], par[N][20], mx[N][20];

void dfs(int u){
	for(int j=1;j<20;j++){
		par[u][j] = par[par[u][j-1]][j-1];
		mx[u][j] = max(mx[u][j-1], mx[par[u][j-1]][j-1]);
	}
	
	for(auto x : edges[u]){
		pref[x] = pref[u] + s[x];
		par[x][0] = u, mx[x][0] = s[u] + pref[u];
		dfs(x);
	}
}

void init(int N, vector<int> S, vector<int> P, vector<int> W, vector<int> L) {
	n = N;
	for(int i=0;i<n;i++){
		s[i] = S[i], p[i] = P[i], w[i] = W[i], l[i] = L[i];
		edges[w[i]].push_back(i);
	}
	
	par[n][0] = n;
	dfs(n);
}

ll go(int x, ll z){
	//~ cout<<x<<" "<<z<<"\n";
	if(s[x] > z){
		return go(l[x], z + s[x]);
	}
	
	z += pref[x];
	for(int j=19;~j;j--){
		if(mx[x][j] <= z){
			x = par[x][j];
		}
	}
	
	x = par[x][0];
	if(x == n) return z;
	z -= pref[x];
	return go(l[x], z + s[x]);
}

ll simulate(int x, int z) {
	return go(x, z);
}

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