| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1221191 | thangdz2k7 | Island Hopping (JOI24_island) | C++20 | 0 ms | 408 KiB |
#include "island.h"
#include <bits/stdc++.h>
using namespace std;
void solve(int N, int L){
vector <int> vis(N + 1, 0);
for (int i = 1; i < N; ++ i){
int u = query(1, i);
if (vis[u]) continue;
vis[u] = 1;
for (int j = 1; j < N; ++ j){
int v = query(u, i);
answer(u, v);
if (vis[v]) break;
vis[v] = 1;
}
}
}| # | 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... | ||||
