Submission #819786

#	Time	Username	Problem	Language	Result	Execution time	Memory
819786		alvingogo	Dungeons Game (IOI21_dungeons)	C++17	63 / 100	2453 ms	2097152 KiB

dungeons

#include "dungeons.h"
#include <bits/stdc++.h>
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;

const int A=25;
typedef long long ll;
struct xe{
	int to;
	ll cost=0;
	ll mx=0;
};
struct no{
	xe as[25];
};
vector<vector<no> > f;
vector<int> s,p,w,l;
int n;
void init(int N, vector<int> S, vector<int> P, vector<int> W, vector<int> L) {
	n=N;
	s=S;
	p=P;
	w=W;
	l=L;
	f.resize(A);
	for(int z=0;z<A;z++){
		f[z].resize(n+1);
		for(int i=0;i<n;i++){
			if((1<<z)>=s[i]){
				f[z][i].as[0].to=w[i];
				f[z][i].as[0].cost=s[i];
				f[z][i].as[0].mx=1e18;
			}
			else{
				f[z][i].as[0].to=l[i];
				f[z][i].as[0].cost=p[i];
				f[z][i].as[0].mx=s[i];
			}
		}
		for(int i=1;i<A;i++){
			for(int j=0;j<n;j++){
				auto a=f[z][j].as[i-1],b=f[z][f[z][j].as[i-1].to].as[i-1];
				if(a.to==n){
					f[z][j].as[i]=a;
				}
				else{
					f[z][j].as[i].to=b.to;
					f[z][j].as[i].cost=a.cost+b.cost;
					f[z][j].as[i].mx=min(a.mx,b.mx-a.cost);
				}
			}
		}
	}
	return;
}

ll simulate(int x, int Z) {
	long long z=Z;
	for(int j=0;j<A;j++){
		for(int i=A-1;i>=0;i--){
			if(z<f[j][x].as[i].mx){
				//cout << f[j][x].as[i].mx << " " << f[j][x].as[i].cost << endl;
				z+=f[j][x].as[i].cost;
				x=f[j][x].as[i].to;
				if(x==n){
					return z;
				}
			}
		}
		if(z>=s[x]){
			z+=s[x];
			x=w[x];
		}
		else{
			z+=p[x];
			x=l[x];
		}
		if(x==n){
			return z;
		}
	}	
	return z;
}

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