Submission #604976

#TimeUsernameProblemLanguageResultExecution timeMemory
604976HazemICC (CEOI16_icc)C++14
7 / 100
351 ms484 KiB
#include <bits/stdc++.h> #include "icc.h" using namespace std; const int N = 2e5+10; int a[N],par[N]; int find_par(int x){ if(x==par[x]) return x; return par[x] = find_par(par[x]); } void run(int n){ for(int i=1;i<=n;i++) par[i] = i; int T = n-1; while(T--){ bool q = 0; for(int i=1;i<=n;i++){ if(q) break; for(int j=i+1;j<=n;j++) if(find_par(i)!=find_par(j)){ int arr[] = {i}; int arr1[] = {j}; int v = query(1,1,arr,arr1); if(v){ q = 1; setRoad(i,j); par[j] = i; 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...