This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "park.h"
static int place[1400];
void Detect(int T, int N) {
for(int i = 0; i<N; i++){
place[i] = 0;
}
for(int i = 0; i<N; i++){
for(int j = i+1; j<N; j++){
place[i] = 1;
place[j] = 1;
if(Ask(i,j,place)==1){
Answer(i,j);
}
place[i] = 0;
place[j] = 0;
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |