제출 #1196539

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1196539		Ludissey	던전 (IOI21_dungeons)	C++20	63 / 100	3003 ms	2162688 KiB

dungeons

#include "dungeons.h"
#include <bits/stdc++.h>
#define int long long
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()

using namespace std;

int N; 
vector<int> s,p,w,l;
vector<int> ss;
vector<vector<vector<int>>> nxt;
vector<vector<vector<int>>> mn;
vector<vector<vector<int>>> nxp;
vector<int> tw;

const int LOG=26;
const int MAXS=1e7+1;


int pth(int x){
	if(x==N) return 0;
	if(tw[x]>=0) return tw[x];
	tw[x]=pth(w[x])+s[x];
	return tw[x];
}

void init(signed n, std::vector<signed> S, std::vector<signed> P, std::vector<signed> W, std::vector<signed> L) {
	N=n;
	s.resize(N);
	tw.resize(N,-1);
	p.resize(N);
	w.resize(N+1);
	l.resize(N+1);
	l[N]=N;
	w[N]=N;
	set<int> st;
	for (int i = 0; i < n; i++)
	{
		s[i]=S[i];
		p[i]=P[i];
		w[i]=W[i];
		l[i]=L[i];
	}
	ss.push_back(0);
	int u=1; 
	ss.push_back(u);
	while(u<MAXS){
		u*=2;
		ss.push_back(u);
	}
	nxt.resize(N+1,vector<vector<int>>(LOG,vector<int>(sz(ss),0)));
	mn.resize(N+1,vector<vector<int>>(LOG,vector<int>(sz(ss),1e16)));
	nxp.resize(N+1,vector<vector<int>>(LOG,vector<int>(sz(ss),N)));
	for (int i = 0; i < n; i++){
		for (int j = 0; j < sz(ss); j++)
		{
			if(s[i]<=ss[j]){
				nxt[i][0][j]=s[i];
				nxp[i][0][j]=w[i];
			}else{
				nxt[i][0][j]=p[i];
				nxp[i][0][j]=l[i];
				mn[i][0][j]=s[i];
			}
		}
		
	}

	for (int j = 1; j < LOG; j++)
	{
		for (int i = 0; i < N; i++)
		{
			for (int k = 0; k < sz(ss); k++){
				nxp[i][j][k]=nxp[nxp[i][j-1][k]][j-1][k];
				nxt[i][j][k]=nxt[i][j-1][k]+nxt[nxp[i][j-1][k]][j-1][k];
				mn[i][j][k]=min(mn[i][j-1][k],mn[nxp[i][j-1][k]][j-1][k]-nxt[i][j-1][k]);
			}
		}
	}
	for (int i = 0; i < N; i++) pth(i);
	return;
}

long long simulate(signed x, signed z) {
	int cs=z;
	int u=x;
	for (int i = 0; i < sz(ss); i++)
	{
		if(ss[i+1]<=cs) continue;
		for (int j = LOG-1; j >= 0; j--)
		{
			if(nxp[u][j][i]==N||mn[u][j][i]<=cs) continue;
			cs+=nxt[u][j][i];
			u=nxp[u][j][i];
		}
		if(nxp[u][0][i]==N){
			if(s[u]>cs) cs+=p[u];
			else cs+=s[u];
			return cs;
		}else{
			if(s[u]>cs) {
				cs+=p[u];
				u=l[u];
			}
			else {
				cs+=s[u];
				u=w[u];
			}
		}
		if(u==N) return cs;
	}
	return cs+pth(u);
}

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