| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1203994 | Ghulam_Junaid | Park (JOI17_park) | C++20 | 30 ms | 512 KiB |
#include <bits/stdc++.h>
#include "park.h"
using namespace std;
const int MXN = 1405;
int n;
static int Place[1400];
void Detect(int T, int nn) {
n = nn;
memset(Place, 0, sizeof Place);
for (int u = 0; u < n; u ++){
for (int v = u + 1; v < n; v ++){
Place[u] = Place[v] = 1;
if (Ask(u, v, Place))
Answer(u, v);
Place[u] = Place[v] = 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... | ||||
