| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1332396 | 2sqrt3 | Island Hopping (JOI24_island) | C++20 | 3 ms | 436 KiB |
#include "island.h"
#include <vector>
#include <set>
using namespace std;
void solve(int N, int L) {
vector<int> A(N);
A[0] = 1;
for (int i = 1; i < N; ++i) {
A[i] = query(1, i);
}
vector<set<int>> known(N + 1);
for (int i = N - 1; i >= 1; --i) {
int v = A[i];
int idx = 1;
while (true) {
int u = query(v, idx++);
if (known[v].find(u) == known[v].end()) {
answer(v, u);
known[u].insert(v);
break;
}
}
}
}| # | 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... | ||||
