# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
54709 |
2018-07-04T17:27:36 Z |
ksun48 |
Park (JOI17_park) |
C++14 |
|
50 ms |
744 KB |
#include <bits/stdc++.h>
#include "park.h"
using namespace std;
int P[1400];
int ask(int a, int b){
if(a == b) return 1;
return Ask(min(a,b), max(a,b), P);
}
void Detect(int T, int N) {
for(int i = 0; i < N; i++){
P[i] = 0;
}
for(int i = 0; i < N; i++){
for(int j = i+1; j < N; j++){
P[i] = P[j] = 1;
if(ask(i,j)){
Answer(i, j);
}
P[i] = P[j] = 0;
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
248 KB |
Output is correct |
2 |
Correct |
8 ms |
488 KB |
Output is correct |
3 |
Correct |
9 ms |
544 KB |
Output is correct |
4 |
Correct |
9 ms |
544 KB |
Output is correct |
5 |
Correct |
8 ms |
544 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
50 ms |
676 KB |
Wrong Answer[5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
44 ms |
744 KB |
Wrong Answer[5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
34 ms |
744 KB |
Wrong Answer[5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
44 ms |
744 KB |
Wrong Answer[5] |
2 |
Halted |
0 ms |
0 KB |
- |