제출 #439685

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
439685		tutis	던전 (IOI21_dungeons)	C++17	13 / 100	6716 ms	791108 KiB

dungeons

#include "dungeons.h"
#include <bits/stdc++.h>
using namespace std;
long long N;
long long mn[400002][19];
long long W[400002][19];
long long S[400002][19];

long long P[400002][19];
long long mx[400002][19];
long long L[400002][19];

long long mn1[25][50001][19];
long long mx1[25][50001][19];
long long tp[25][50001][19];
long long del[25][50001][19];
void init(int n, vector<int> s, vector<int> p, vector<int> w, vector<int> l) {
	N = n;
	for (int i = 0; i < s.size(); i++)
	{
		S[i][0] = s[i];
		mx[i][0] = s[i] - 1;
		mn[i][0] = s[i];
	}
	for (int i = 0; i < p.size(); i++)
		P[i][0] = p[i];
	for (int i = 0; i < w.size(); i++)
		W[i][0] = w[i];
	for (int i = 0; i < l.size(); i++)
		L[i][0] = l[i];
	mx[n][0] = 1e17;
	L[n][0] = n;
	P[n][0] = 0;
	mn[n][0] = -1e17;
	S[n][0] = 0;
	W[n][0] = n;
	for (int t = 1; t < 19; t++)
	{
		for (int i = 0; i <= n; i++)
		{
			mx[i][t] = min(mx[i][t - 1], mx[L[i][t - 1]][t - 1] - P[i][t - 1]);
			L[i][t] = L[L[i][t - 1]][t - 1];
			P[i][t] = P[i][t - 1] + P[L[i][t - 1]][t - 1];
		}
	}
	for (int t = 1; t < 19; t++)
	{
		for (int i = 0; i <= n; i++)
		{
			mn[i][t] = max(mn[i][t - 1], mn[W[i][t - 1]][t - 1] - S[i][t - 1]);
			W[i][t] = W[W[i][t - 1]][t - 1];
			S[i][t] = S[i][t - 1] + S[W[i][t - 1]][t - 1];
		}
	}
	for (int x = 0; x < 25; x++)
	{
		long long v = 1 << x;
		mn1[x][n][0] = -1e17;
		mx1[x][n][0] = 1e17;
		tp[x][n][0] = n;
		del[x][n][0] = 0;
		for (int i = 0; i < n; i++)
		{
			if (s[i] > v)
			{
				mn1[x][i][0] = -1e17;
				mx1[x][i][i] = s[i] - 1;
				tp[x][i][0] = l[i];
				del[x][i][0] = p[i];
			}
			else
			{
				mn1[x][i][0] = s[i];
				mx1[x][i][0] = 1e17;
				tp[x][i][0] = w[i];
				del[x][i][0] = s[i];
			}
		}
		for (int t = 1; t < 19; t++)
		{
			for (int i = 0; i <= n; i++)
			{
				mn1[x][i][t] = max(mn1[x][i][t - 1], mn1[x][tp[x][i][t - 1]][t - 1] - del[x][i][t - 1]);
				mx1[x][i][t] = min(mx1[x][i][t - 1], mx1[x][tp[x][i][t - 1]][t - 1] - del[x][i][t - 1]);
				tp[x][i][t] = tp[x][tp[x][i][t - 1]][t - 1];
				del[x][i][t] = del[x][i][t - 1] + del[x][tp[x][i][t - 1]][t - 1];
			}
		}
	}
}

long long simulate(int x, int z) {
	long long s = z;
	while (x != N)
	{
		if (s >= mn[x][0])
		{
			for (int t = 18; t >= 0; t--)
			{
				if (s >= mn[x][t])
				{
					s += S[x][t];
					x = W[x][t];
				}
				if (s < mn[x][0])
					break;
			}
		}
		else
		{
			for (int t = 18; t >= 0; t--)
			{
				if (s <= mx[x][t])
				{
					s += P[x][t];
					x = L[x][t];
				}
				if (s >= mn[x][0])
					break;
			}
		}
		for (int v = 0; v < 25; v++)
		{
			if (s >= mn1[v][x][0] && s <= mx1[v][x][0])
				for (int t = 18; t >= 0; t--)
				{
					if (s >= mn1[v][x][t] && s <= mx1[v][x][t])
					{
						s += del[v][x][t];
						x = tp[v][x][t];
					}
				}
		}
	}
	return s;
}

컴파일 시 표준 에러 (stderr) 메시지

dungeons.cpp: In function 'void init(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
dungeons.cpp:19:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |  for (int i = 0; i < s.size(); i++)
      |                  ~~^~~~~~~~~~
dungeons.cpp:25:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |  for (int i = 0; i < p.size(); i++)
      |                  ~~^~~~~~~~~~
dungeons.cpp:27:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |  for (int i = 0; i < w.size(); i++)
      |                  ~~^~~~~~~~~~
dungeons.cpp:29:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |  for (int i = 0; i < l.size(); i++)
      |                  ~~^~~~~~~~~~

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