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