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;
static int Place[1400];
int n;
void solve1() {
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
Place[i] = Place[j] = 1;
if (Ask(i, j, Place)) {
Answer(i, j);
}
Place[i] = Place[j] = 0;
}
}
}
void Detect(int T, int N) {
n = N;
if (T == 1) {
solve1();
} else if (T == 2) {
} else {
}
}
# | 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... |