# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
576122 |
2022-06-12T11:15:38 Z |
urd05 |
Park (JOI17_park) |
C++17 |
|
12 ms |
340 KB |
#include "park.h"
#include <bits/stdc++.h>
using namespace std;
int place[1400];
void Detect(int t,int n) {
if (t==1) {
for(int i=0;i<n;i++) {
for(int j=i+1;j<n;j++) {
for(int k=0;k<n;k++) {
if (k==i||k==j) {
place[k]=1;
}
else {
place[k]=0;
}
}
if (Ask(i,j,place)==1) {
Answer(i,j);
}
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
12 ms |
212 KB |
Output is correct |
3 |
Correct |
12 ms |
304 KB |
Output is correct |
4 |
Correct |
12 ms |
340 KB |
Output is correct |
5 |
Correct |
12 ms |
316 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Wrong Answer[6] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Wrong Answer[6] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Wrong Answer[6] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
340 KB |
Wrong Answer[6] |
2 |
Halted |
0 ms |
0 KB |
- |