제출 #1349052

#제출 시각아이디문제언어결과실행 시간메모리
1349052Zone_zoneeIsland Hopping (JOI24_island)C++20
2 / 100
0 ms396 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);
        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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...