제출 #1011099

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1011099		1ne	던전 (IOI21_dungeons)	C++17	0 / 100	1 ms	1372 KiB

dungeons

#include "dungeons.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
const int k = 20;
vector<vector<int>>table;
vector<vector<int>>nx;
vector<vector<int>>sum;
vector<int>S,P,W,L;
int N;	
void init(int n, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) {
	table.resize(n,vector<int>(k));
	nx.resize(n,vector<int>(k,-1));
	sum.resize(n,vector<int>(k,0));
	N = n;
	S = s;
	P = p;
	W = w;
	L = l;
	for (int i = 0;i<n;++i){
		table[i][0] = s[i];
		nx[i][0] = w[i];
		sum[i][0] = s[i];
	}
	for (int i = 1;i<k;++i){
	
			for (int j = 0;j<n;++j){
			if (nx[j][i - 1] == -1)continue;
			nx[j][i] = nx[nx[j][i - 1]][i - 1];
			table[j][i] = max(table[j][i - 1],table[nx[j][i - 1]][i - 1] - sum[j][i - 1]);
			sum[j][i] = sum[j][i - 1] + sum[nx[j][i - 1]][i - 1];
		}
	}
	return;
}

long long simulate(int x, int z) {
	long long Z = z;
	while(x != N){
		int c = 0;
		while(nx[x][c] != -1 && table[x][c] <= z){
			++c;
		}
		if (c != 0){
			Z+=sum[x][c - 1];
			x = nx[x][c - 1];
		}
		if (x != N){
			Z+=P[x];
			x = L[x];
		}	
	}
	return Z;
}

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