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