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 <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 |
---|
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... |