Submission #1225568
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define all(v) begin(v), end(v) #define FOR(i,a,b) for(int i=(a);i<(int)(b);i++) #define rep(i,b) FOR(i,0,b) const int mod = 1e9+7; struct UnionFind{ int uni[1000010]; UnionFind(int n){ init(n); } void init(int N){ for(int i=0;i<N;i++){ uni[i]=-1; } } int root(int a){ if(uni[a]<0)return a; else return uni[a]=root(uni[a]); } bool unite(int a,int b){ a=root(a); b=root(b); if(a==b){ return false; } uni[a]+=uni[b]; uni[b]=a; } bool same(int a,int b){ a=root(a); b=root(b); if(a==b)return true; else return false; } bool same(vector<int>& idx){ if(idx.size()==0)return true; for(int i:idx){ if(!same(idx[0],i)) return false; } return true; } }; int main(){ int N,M; int ans=0; cin>>N>>M; UnionFind uf(N); rep(i,M){ int a,b; cin>>a>>b; a--;b--; uf.unite(a,b); } for(int i=0;i<N;i++){ if(uf.uni[i]<0)ans++; } cout<<ans-1<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 道路工事 |
User | albicilla |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1132 Byte |
Status | AC |
Exec Time | 73 ms |
Memory | 2304 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt |
All | 0.txt, 1.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 2.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, sample1.txt, sample2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0.txt | AC | 1 ms | 256 KB |
1.txt | AC | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 1 ms | 256 KB |
13.txt | AC | 1 ms | 256 KB |
14.txt | AC | 1 ms | 256 KB |
15.txt | AC | 53 ms | 256 KB |
16.txt | AC | 2 ms | 2304 KB |
17.txt | AC | 2 ms | 2304 KB |
18.txt | AC | 2 ms | 640 KB |
19.txt | AC | 73 ms | 640 KB |
2.txt | AC | 1 ms | 256 KB |
3.txt | AC | 1 ms | 256 KB |
4.txt | AC | 1 ms | 256 KB |
5.txt | AC | 1 ms | 256 KB |
6.txt | AC | 1 ms | 256 KB |
7.txt | AC | 1 ms | 256 KB |
8.txt | AC | 1 ms | 256 KB |
9.txt | AC | 1 ms | 256 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |