Submission #818452

#TimeUsernameProblemLanguageResultExecution timeMemory
818452alvingogoDungeons Game (IOI21_dungeons)C++17
11 / 100
7075 ms19760 KiB
#include "dungeons.h"
#include <bits/stdc++.h>
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;

typedef long long ll;
struct xe{
	int to;
	ll cost=0;
	ll mx=0;
};
struct no{
	vector<xe> as;
	no(){
		as.resize(20);
	}
};
vector<no> v;
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;
	return;
}

ll simulate(int x, int z) {
	for(int i=x;i!=n;){
		if(z>=s[i]){
			z+=s[i];
			i=w[i];
		}
		else{
			z+=p[i];
			i=l[i];
		}
	}
	return z;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...