Submission #1196557

#	Time	Username	Problem	Language	Result	Execution time	Memory
1196557		Ludissey	Dungeons Game (IOI21_dungeons)	C++20	11 / 100	5305 ms	2162688 KiB

dungeons

#include "dungeons.h"
#include <bits/stdc++.h>
#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>>> nxt;
vector<vector<vector<int>>> nxp;*/
vector<long long> tw;

const int LOG=22;
const int MAXS=1e7+1;
int sn;

long long pth(int x){
	if(x==N) return 0;
	if(tw[x]>=0) return tw[x];
	tw[x]=pth(w[x])+(long long)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;
	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);
	}
    sn=sz(ss);
	nxt.resize(N+1,vector<vector<int>>(sn*3,vector<int>(1,0)));
	for (int i = 0; i < n; i++){
		for (int j = 0; j < sz(ss); j++)
		{
			if(s[i]<=ss[j]){
				nxt[i][j][0]=s[i];
				nxt[i][j+sn][0]=w[i];
				nxt[i][j+sn*2][0]=1e8;
			}else{
				nxt[i][j][0]=p[i];
				nxt[i][j+sn][0]=l[i];
				nxt[i][j+sn*2][0]=s[i];
			}
		}
		
	}
	for (int j = 1; j < LOG; j++)
	{
		for (int i = 0; i < N; i++)
		{
			for (int k = 0; k < sz(ss); k++){
                if(nxt[i][k+sn][j-1]==N||j>sz(nxt[i][k+sn])) continue;
				nxt[i][k+sn].push_back(nxt[nxt[i][k+sn][j-1]][k+sn][j-1]);
				nxt[i][k].push_back(nxt[i][k][j-1]+nxt[nxt[i][k+sn][j-1]][k][j-1]);
				nxt[i][k+2*sn].push_back(min(nxt[i][k+2*sn][j-1],nxt[nxt[i][k+sn][j-1]][k+2*sn][j-1]-nxt[i][k][j-1]));
			}
		}
	}
	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(j>=sz(nxt[u][i])||nxt[u][i+sn][j]==N||nxt[u][i+2*sn][j]<=cs) continue;
			cs+=nxt[u][i][j];
			u=nxt[u][i+sn][j];
		}
		if(nxt[u][i+sn][0]==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 (long long)cs+pth(u);
}

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