제출 #441081

#제출 시각아이디문제언어결과실행 시간메모리
441081MetalPower던전 (IOI21_dungeons)C++17
11 / 100
7102 ms19764 KiB
#include <bits/stdc++.h>
using namespace std;

#include "dungeons.h"

const int sub1MX = 10000;

int N;
vector<int> S, P, W, L;

int move(int x, int z){
	if(x == N) return z;
	if(z >= S[x]) return move(W[x], z + S[x]);
	else return move(L[x], z + P[x]);
}

void init(int n, vector<int> s, vector<int> p, vector<int> w, vector<int> l){
	S = s; P = p; W = w; L = l; N = n;
}

long long simulate(int x, int z){
	return (long long) move(x, 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...