제출 #621051

#제출 시각아이디문제언어결과실행 시간메모리
621051amunduzbaev던전 (IOI21_dungeons)C++17
11 / 100
7100 ms19768 KiB
#include "dungeons.h"
#ifndef EVAL
#include "grader.cpp"
#endif

#include "bits/stdc++.h"
using namespace std;

const int N = 4e5 + 5;
int s[N], p[N], w[N], l[N], n;

void init(int N, vector<int> S, vector<int> P, vector<int> W, vector<int> L) {
	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];
	}
	return;
}

long long simulate(int x, int z) {
	long long res = z;
	while(x < n){
		if(res >= s[x]) res += s[x], x = w[x];
		else res += p[x], x = l[x];
	}
	
	return res;
	return 0;
}

#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...