| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1330196 | huoi | Island Hopping (JOI24_island) | C++17 | 314 ms | 784 KiB |
#include "island.h"
#include <bits/stdc++.h>
using namespace std;
void solve(int N, int L) {
vector<vector<int>> a(N + 1, vector<int>(N + 1));
for (int u = 1; u <= N; u++) {
for (int k = 1; k < N; k++) {
int v = query(u, k);
a[u][v] = k;
}
}
vector<vector<bool>> connected(N + 1, vector<bool>(N + 1, true));
for (int u = 1; u <= N; u++) {
for (int v = 1; v <= N; v++) {
for (int w = 1; w <= N; w++) {
if (u == v || v == w || u == w) continue;
if (a[u][w] < a[u][v] && a[v][w] < a[v][u]) {
connected[u][v] = false;
}
}
}
}
for (int u = 1; u <= N; u++) {
for (int v = u + 1; v <= N; v++) {
if (connected[u][v]) answer(u, v);
}
}
}| # | 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
