| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1349054 | Zone_zonee | Island Hopping (JOI24_island) | C++20 | 2 ms | 396 KiB |
#include "island.h"
int par[310];
int fp(int u){
return par[u] = (u == par[u] ? u : fp(par[u]));
}
void solve(int N, int L) {
for(int i = 1; i <= N; ++i) par[i] = i;
for(int i = 1; i < N; ++ i){
int u = query(1, i);
if(fp(u) == fp(1)) continue;
for(int j = 1; j < N; ++j){
int v = query(u, j);
par[fp(u)] = fp(v);
answer(u, v);
if(fp(u) == fp(1)) 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... | ||||
