| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1329937 | huoi | Island Hopping (JOI24_island) | C++17 | 1 ms | 436 KiB |
#include "island.h"
#include <bits/stdc++.h>
using namespace std;
void solve(int N, int L) {
vector<set<int>> adj(N + 1);
for (int u = 1; u < N; u++) {
int v = query(u, 1);
if (adj[v].find(u) != adj[v].end()) v = query(u, 2);
// cout << u << " " << v << "\n";
adj[u].insert(v);
adj[v].insert(u);
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... | ||||
