제출 #1074734

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1074734		vnm06	던전 (IOI21_dungeons)	C++17	100 / 100	3139 ms	814420 KiB

dungeons

#include "dungeons.h"
#include<bits/stdc++.h>
 
using namespace std;
 
int N;
vector<int> S, P, W, L;
int vert[10][400005][10];
long long jmp[10][400005][10];
long long gran[10][400005][10];
 
void init(int n, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) 
{
	N=n;
	S=s;
	P=p;
	W=w;
	L=l;
	long long le=1, ri=5;
	for(int tree=0; tree<10; tree++)
	{
		for(int i=0; i<n; i++)
		{
			if(s[i]<le)
			{
				vert[tree][i][0]=w[i];
				jmp[tree][i][0]=s[i];
				gran[tree][i][0]=ri;
			}
			else if(s[i]>ri)
			{
				vert[tree][i][0]=l[i];
				jmp[tree][i][0]=p[i];
				gran[tree][i][0]=ri;
			}
			else
			{
				vert[tree][i][0]=l[i];
				jmp[tree][i][0]=p[i];
				gran[tree][i][0]=s[i]-1;
 
			}
		}
		for(int lvl=1; lvl<10; lvl++)
		{
			for(int i=0; i<n; i++)
			{
				vert[tree][i][lvl]=vert[tree][i][lvl-1];
				jmp[tree][i][lvl]=jmp[tree][i][lvl-1];
				gran[tree][i][lvl]=gran[tree][i][lvl-1];
				for(int j=1; j<=5; j++)
				{
					int nv=vert[tree][i][lvl];
					if(nv==n) break;
					vert[tree][i][lvl]=vert[tree][nv][lvl-1];
					gran[tree][i][lvl]=min(gran[tree][i][lvl], max((long long)0, gran[tree][nv][lvl-1]-jmp[tree][i][lvl]));
					jmp[tree][i][lvl]+=jmp[tree][nv][lvl-1];
					if(gran[tree][i][lvl]<=0) break;
				}
			}
		}
		le*=6;
		ri=le*6-1;
		if(tree==8) ri=1e18;
 
	}
	return;
}
 
long long simulate(int x, int z) {
	int v=x;
	long long st=z;
	long long tree=0, le=1, ri=5;
	int br=0;
	while(v!=N)
	{
		br++;
		if(br>50) assert(false);
		while(tree<9 && st>ri)
		{
			le*=6;
			ri=le*6-1;
			if(tree==8) ri=1e18;
			tree++;
		}
		for(int lvl=9; lvl>=0; lvl--)
		{
			for(int j=5;; j--)
			{
				if(st<=gran[tree][v][lvl])
				{
					st+=jmp[tree][v][lvl];
					v=vert[tree][v][lvl];
					if(v==N) break;
				}
				else break;
			}
			if(v==N) break;
		}
 
		for(int tt=0; tt<5; tt++)
		{
		if(v==N) break;
		if(st<S[v])
		{
			st+=P[v];
			v=L[v];
		}
		else
		{
			st+=S[v];
			v=W[v];
		}}
	}
	return st;
}

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