제출 #525435

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
525435		LucaDantas	던전 (IOI21_dungeons)	C++17	11 / 100	3751 ms	257032 KiB

dungeons

#include "dungeons.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;

constexpr int maxn = 4e5+10, logn = 24, log_lift = 9, base_lift = 9;
constexpr long long inf = 1e15L;

struct FunctionalGraph {
	int f[maxn][log_lift], mn[maxn][log_lift]; // p[i] == peso da aresta saindo de i, f[i] == aresta saindo de i
	long long tab[maxn][log_lift], cost[maxn][log_lift]; // s[i] == força necessaria para matar i

	void add_i(int i, int x, int v, long long st) { f[i][0] = x, cost[i][0] = v, mn[i][0] = i, tab[i][0] = st; }

	void build(int n) {
		f[n][0] = n;
		cost[n][0] = 0;
		mn[n][0] = n;

		for(int l = 1; l < log_lift; l++) {
			for(int i = 0; i <= n; i++) {
				f[i][l] = i;
				tab[i][l] = tab[i][l-1];
				mn[i][l] = mn[i][l-1];

				for(int k = 0; k < base_lift; k++) {
					if(tab[i][l] > tab[ f[i][l] ][l-1] - cost[i][l]) {
						mn[i][l] = mn[ f[i][l] ][l-1];
						tab[i][l] = tab[ f[i][l] ][l-1] - cost[i][l];
					}

					cost[i][l] += cost[f[i][l]][l-1];
					f[i][l] = f[f[i][l]][l-1];
				}
			}
		}
	}

	void go(int& x, long long& val) {
		if(val >= tab[x][0]) return;
		for(int l = log_lift-1; l >= 0; l--)
			for(int k = 0; k < base_lift-1; k++)
				if(tab[x][l] > val) val += cost[x][l], x = f[x][l];
	}
} graph[logn];

void init(int n, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) {
	for(int lg = 0; lg < logn; lg++) {
		for(int i = 0; i < n; i++) {
			if(s[i] <= (1<<lg)) graph[lg].add_i(i, w[i], s[i], inf);
			else graph[lg].add_i(i, l[i], p[i], s[i]);
		}
		graph[lg].build(n);
	}
	return;
}

long long simulate(int x, int z) {
	long long val = z;
	for(int lg = 0; lg < logn; lg++)
		graph[lg].go(x, val);
	return val;
}

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