# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
428392 |
2021-06-15T11:18:54 Z |
jamezzz |
Park (JOI17_park) |
C++17 |
|
79 ms |
384 KB |
#include "park.h"
#include <bits/stdc++.h>
using namespace std;
static int place[1400];
int rem[1405];
void Detect(int T,int N){
for(int i=0;i<N;++i)rem[i]=7;
for(int i=0;i<N;++i){
if(rem[i]==0)continue;
for(int j=i+1;j<N;++j){
if(rem[j]==0)continue;
memset(place,0,sizeof place);
place[i]=place[j]=1;
if(Ask(i,j,place)){
Answer(i,j);
--rem[i];--rem[j];
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
15 ms |
344 KB |
Output is correct |
3 |
Correct |
16 ms |
344 KB |
Output is correct |
4 |
Correct |
15 ms |
332 KB |
Output is correct |
5 |
Correct |
15 ms |
352 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
76 ms |
384 KB |
Wrong Answer[5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
79 ms |
332 KB |
Wrong Answer[5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
57 ms |
368 KB |
Wrong Answer[5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
79 ms |
332 KB |
Wrong Answer[5] |
2 |
Halted |
0 ms |
0 KB |
- |