Submission #1258632

#TimeUsernameProblemLanguageResultExecution timeMemory
1258632noyancanturkIsland Hopping (JOI24_island)C++20
0 / 100
2 ms412 KiB
#include "island.h" #include<bits/stdc++.h> using namespace std; #define pb push_back namespace { int isroot[501]; vector<pair<int,int>>ans; int parent[501]; int find(int i){ if(i==parent[i])return i; return parent[i]=find(parent[i]); } void unite(int i,int j){ parent[find(i)]=find(j); } } void solve(int n, int L) { for(int i=1;i<=n;i++)parent[i]=i; for(int i=2;i<=n;i++){ for(int k=1;k<=n-1;k++){ int res=query(i,k); if(res<i&&find(i)!=find(res)){ unite(i,res); for(auto[x,y]:ans) answer(i,res); }else 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...