#include "dungeons.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
long long N;
vector<int> wp;
vector<int> lp;
vector<int> W;
vector<int> L;
void init(int n, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) {
N = n;
wp = s;
lp = p;
W = w;
L = l;
return;
}
long long res;
void solve(long long num1, long long num2){
if(num1 == N){
res = num2;
return;
}
if(num2 >= wp[num1]){
num2+=wp[num1];
solve(W[num1], num2);
}else{
num2+=lp[num1];
solve(L[num1], num2);
}
}
long long simulate(int x, int z) {
solve(x,z);
return res;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
2 ms |
332 KB |
Output is correct |
4 |
Correct |
42 ms |
2760 KB |
Output is correct |
5 |
Correct |
2 ms |
356 KB |
Output is correct |
6 |
Correct |
22 ms |
2864 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
332 KB |
Output is correct |
2 |
Execution timed out |
7065 ms |
20592 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
332 KB |
Output is correct |
2 |
Correct |
51 ms |
3480 KB |
Output is correct |
3 |
Correct |
2632 ms |
3504 KB |
Output is correct |
4 |
Correct |
3098 ms |
3396 KB |
Output is correct |
5 |
Correct |
2040 ms |
3396 KB |
Output is correct |
6 |
Execution timed out |
7025 ms |
3448 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
332 KB |
Output is correct |
2 |
Correct |
51 ms |
3480 KB |
Output is correct |
3 |
Correct |
2632 ms |
3504 KB |
Output is correct |
4 |
Correct |
3098 ms |
3396 KB |
Output is correct |
5 |
Correct |
2040 ms |
3396 KB |
Output is correct |
6 |
Execution timed out |
7025 ms |
3448 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
332 KB |
Output is correct |
2 |
Correct |
51 ms |
3480 KB |
Output is correct |
3 |
Correct |
2632 ms |
3504 KB |
Output is correct |
4 |
Correct |
3098 ms |
3396 KB |
Output is correct |
5 |
Correct |
2040 ms |
3396 KB |
Output is correct |
6 |
Execution timed out |
7025 ms |
3448 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
332 KB |
Output is correct |
2 |
Execution timed out |
7065 ms |
20592 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |