제출 #166900

#제출 시각아이디문제언어결과실행 시간메모리
166900thiago4532ICC (CEOI16_icc)C++17
7 / 100
66 ms632 KiB
#include "icc.h" #include <bits/stdc++.h> using namespace std; const int maxn = 16; int pai[maxn], h[maxn]; int n; int find(int u) { if(pai[u] == u) return u; return pai[u] = find(pai[u]); } void join(int a, int b) { a = find(a); b = find(b); if(h[a] < h[b]) swap(h[a], h[b]); pai[b] = a; if(h[a]==h[b]) h[a]++; } void run(int n_) { n = n_; for(int i=1;i<=n;i++) pai[i] = i; for(int k=1;k<n;k++) { bool certo = false; for(int i=1;i<=n;i++) { for(int j=i+1;j<=n;j++) { if(find(i) == find(j)) continue; int a[] = {i}; int b[] = {j}; bool x = query(1,1, a, b); if(x) { certo = true; setRoad(i, j); break; } } if(certo) 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...