| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1270395 | MateiKing80 | Island Hopping (JOI24_island) | C++20 | 3 ms | 408 KiB |
#include <bits/stdc++.h>
#include "island.h"
using namespace std;
void solve(int n, int useless) {
vector<bool> viz(n + 1, 0);
viz[1] = true;
for (int i = 1; i < n; i ++) {
int x = query(1, i);
if (viz[x])
continue;
viz[x] = true;
for (int j = 1; j < n; j ++) {
int y = query(x, j);
answer(x, y);
if (viz[y])
break;
viz[y] = true;
}
}
}
//sunt penal| # | 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... | ||||
