Submission #1053157

#	Time	Username	Problem	Language	Result	Execution time	Memory
1053157		MarwenElarbi	Dungeons Game (IOI21_dungeons)	C++17	0 / 100	8 ms	22620 KiB

dungeons

#include <bits/stdc++.h>
using namespace std;
#include "dungeons.h"
#define pb push_back
const int nax=4e5+5;
vector<int> adj[nax];
vector<int> ss,ll,ww,pp;
int depth[nax];
int N;
int dfs(int x){
	if(x==N) return 0;
	if(depth[x]!=0) return depth[x];
	depth[x]=1;
	depth[x]+=dfs(ss[x]);
	return depth[x];
}
void init(int n, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) {
	ss=s;
	pp=p;
	ww=w;
	ll=l;
	N=n;
	for (int i = 0; i < n; ++i)
	{
		adj[i].pb(ww[i]);
	}
	for (int i = 0; i < n; ++i)
	{
		if(depth[i]==0) dfs(i);
	}
	return;
}

long long simulate(int x, int z) {
	long long ans=z;
	if(ans>=ss[x]) return ans+1ll*(1+depth[ww[x]])*ss[x];
	else return ans+1ll*(1+depth[ll[x]])*ss[x];
}

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