Submission #1245503

#TimeUsernameProblemLanguageResultExecution timeMemory
1245503HanksburgerIsland Hopping (JOI24_island)C++20
57 / 100
2 ms412 KiB
#include "island.h" #include <bits/stdc++.h> using namespace std; int par[305]; int findPar(int u) { return par[u]==u?u:(par[u]=findPar(par[u])); } void solve(int n, int l) { for (int i=1; i<=n; i++) par[i]=i; for (int i=2; i<=n; i++) { for (int j=1;; j++) { int x=query(i, j); if (x>i || findPar(i)==findPar(x)) break; answer(i, x); par[par[i]]=par[x]; } } }
#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...