Submission #5476491


Source Code Expand

Copy
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
struct UnionFind {
    vector<int> par; // uf(x,y)->y
    UnionFind() {}
    UnionFind(int NV) { init(NV); }
    void init(int NV) { par.clear(); rep(i, 0, NV) par.push_back(i); }
    void reset() { rep(i, 0, par.size()) par[i] = i; }
    int operator[](int x) { return par[x] == x ? x : par[x] = operator[](par[x]); }
    void operator()(int x, int y) { x = operator[](x); y = operator[](y); if (x != y) par[x] = y; }
};
/*---------------------------------------------------------------------------------------------------
            ∧_∧  
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     
    /   \     | |     
    /   / ̄ ̄ ̄ ̄/  |  
  __(__ニつ/     _/ .| .|____  
     \/____/ (u ⊃  
---------------------------------------------------------------------------------------------------*/






int N, M;
//---------------------------------------------------------------------------------------------------
void _main() {
	cin >> N >> M;
	UnionFind uf(N);
	rep(i, 0, M) {
		int x, y, z; cin >> x >> y >> z;
		x--; y--;
		uf(x, y);
	}

	int ans = 0;
	rep(i, 0, N) if (uf[i] == i) ans++;
	cout << ans << endl;
}

Submission Info

Submission Time
Task E - 1 or 2
User hamayanhamayan
Language C++14 (GCC 5.4.1)
Score 500
Code Size 2013 Byte
Status AC
Exec Time 27 ms
Memory 1016 KB

Judge Result

Set Name All Sample
Score / Max Score 500 / 500 0 / 0
Status
AC × 20
AC × 3
Set Name Test Cases
All sample_01, sample_02, sample_03, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12, testcase_13, testcase_14, testcase_15, testcase_16, testcase_17
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
sample_01 AC 1 ms 256 KB
sample_02 AC 1 ms 256 KB
sample_03 AC 2 ms 892 KB
testcase_01 AC 5 ms 640 KB
testcase_02 AC 12 ms 892 KB
testcase_03 AC 27 ms 892 KB
testcase_04 AC 27 ms 892 KB
testcase_05 AC 17 ms 256 KB
testcase_06 AC 25 ms 1016 KB
testcase_07 AC 26 ms 892 KB
testcase_08 AC 26 ms 892 KB
testcase_09 AC 24 ms 892 KB
testcase_10 AC 3 ms 384 KB
testcase_11 AC 23 ms 640 KB
testcase_12 AC 23 ms 892 KB
testcase_13 AC 24 ms 892 KB
testcase_14 AC 24 ms 892 KB
testcase_15 AC 24 ms 512 KB
testcase_16 AC 1 ms 256 KB
testcase_17 AC 2 ms 892 KB