제출 #793485

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
793485		mathematik	던전 (IOI21_dungeons)	C++17	63 / 100	5178 ms	2015316 KiB

dungeons

#include "dungeons.h"
#include <bits/stdc++.h>
#define ll long long

using namespace std;

ll binary[25][100000][25][3];//index, +, max excluded

void init(int n, vector<int> s, vector<int> p, vector<int> w, vector<int> l) {
	s.push_back(0);
	p.push_back(0);
	w.push_back(n);
	l.push_back(n);
	n++;

	for (int range = 0; range < 25; range++)
	{
		ll r = 1 << range;

		for (int i = 0; i < n; i++)
		{
			if (s[i] <= r) {
				binary[range][i][0][0] = w[i];
				binary[range][i][0][1] = s[i];
				binary[range][i][0][2] = LLONG_MAX;
			} else {
				binary[range][i][0][0] = l[i];
				binary[range][i][0][1] = p[i];
				binary[range][i][0][2] = s[i];
			}
		}
		
		for (int i = 1; i < 25; i++)
		{
			for (int ind = 0; ind < n; ind++)
			{
				int pointer = binary[range][ind][i - 1][0];
				binary[range][ind][i][0] = binary[range][pointer][i - 1][0];
				binary[range][ind][i][1] = binary[range][ind][i - 1][1] + binary[range][pointer][i - 1][1];
				binary[range][ind][i][2] = min(binary[range][ind][i - 1][2], binary[range][pointer][i - 1][2] - binary[range][ind][i - 1][1]);
			}
		}
	}
}

long long simulate(int x, int z) {
	ll t = z;

	for (int r = 0; r < 24; r++)
	{
		for (int s = 24; s >= 0; s--)
		{
			if (binary[r][x][s][2] > t) {
				t += binary[r][x][s][1];
				x = binary[r][x][s][0];
			}
		}
	}
	t += binary[24][x][24][1];
	return t;
}

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