| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1329946 | huoi | Island Hopping (JOI24_island) | C++17 | 5 ms | 420 KiB |
#include "island.h"
#include <bits/stdc++.h>
using namespace std;
vector<bool> vis;
void dfs(int u) {
vis[u] = true;
for (int k = 1; k <= 2; k++) {
int v = query(u, k);
if (vis[v]) continue;
answer(u, v);
dfs(v);
}
}
void solve(int N, int L) {
vis.resize(N + 1);
vis[1] = true;
vector<int> roots(3);
for (int i = 0; i < 3; i++) {
roots[i] = query(1, i + 1);
answer(1, roots[i]);
}
for (int root : roots) {
dfs(root);
}
}| # | 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... | ||||
