Submission #454695

#	Time	Username	Problem	Language	Result	Execution time	Memory
454695		ogibogi2004	Dungeons Game (IOI21_dungeons)	C++17	11 / 100	7071 ms	26696 KiB

dungeons

#include "dungeons.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
const int MAXN=4e5+6;
int g1[MAXN];
int g2[MAXN],n1;
int strength[MAXN];
int points[MAXN];
void init(int n, vector<int> s, vector<int> p, vector<int> w, vector<int> l) {
	n1=n;
	for(int i=0;i<n;i++)
	{
		points[i]=p[i];
		strength[i]=s[i];
		g1[i]=l[i];
		g2[i]=w[i];
	}
}

long long simulate(int x, int z) {
	for(;;)
	{
		if(x==n1)return z;
		if(z>=strength[x])
		{
			z+=strength[x];
			x=g2[x];
		}
		else
		{
			z+=points[x];
			x=g1[x];
		}
	}
	return z;
}

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