#include <bits/stdc++.h>
using namespace std;
const int maxn = 4e5 + 5;
int n, s[maxn], p[maxn], w[maxn], l[maxn];
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];
}
}
long long simulate(int x, int z) {
while (x < n) {
if (z >= s[x]) {
z += s[x];
x = w[x];
} else {
z += p[x];
x = l[x];
}
}
return z;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
23 ms |
2628 KB |
Output is correct |
5 |
Correct |
2 ms |
332 KB |
Output is correct |
6 |
Correct |
22 ms |
2632 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
332 KB |
Output is correct |
2 |
Execution timed out |
7038 ms |
19768 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
50 ms |
3392 KB |
Output is correct |
3 |
Execution timed out |
7089 ms |
3396 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
50 ms |
3392 KB |
Output is correct |
3 |
Execution timed out |
7089 ms |
3396 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
50 ms |
3392 KB |
Output is correct |
3 |
Execution timed out |
7089 ms |
3396 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
332 KB |
Output is correct |
2 |
Execution timed out |
7038 ms |
19768 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |