# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
670690 |
2022-12-09T20:59:40 Z |
pzorro |
Cave (IOI13_cave) |
C++14 |
|
11 ms |
380 KB |
#include <iostream>
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
const int MAXN = 5 * 1e3;
int s[MAXN];
int d[MAXN];
void exploreCave(int n){
for(int i = 0; i < n; i++){
s[i] = 0;
//d[i] = i;
}
for(int i = 0; i < n; i++){
s[i]++;
int res = tryCombination(s);
d[i] = res;
s[i]--;
}
answer(s, d);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
11 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
8 ms |
340 KB |
Output is correct |
7 |
Correct |
8 ms |
340 KB |
Output is correct |
8 |
Correct |
9 ms |
340 KB |
Output is correct |
9 |
Correct |
10 ms |
340 KB |
Output is correct |
10 |
Correct |
9 ms |
340 KB |
Output is correct |
11 |
Correct |
8 ms |
380 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
0 ms |
212 KB |
Answer is wrong |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
0 ms |
212 KB |
Answer is wrong |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |