Submission #5018428
Source Code Expand
#include <iostream> #include <cstdio> #include <cstdlib> #include <cmath> #include <algorithm> #include <string> #include <vector> #include <list> #include <set> #include <stack> #include <queue> #define llong long long #define INF (__INT32_MAX__ / 2) using namespace std; class DisjointSets { class Node { public: int parent = -1; int rank = 0; int degree = 1; }; private: Node *nodes; void make_set(int x) { nodes[x].parent = x; nodes[x].rank = 0; nodes[x].degree = 1; } int find_set(int x) { if(nodes[x].parent == x) return x; //経路圧縮 nodes[x].rank = 0; return nodes[x].parent = find_set(nodes[x].parent); } public: DisjointSets(){} DisjointSets(int length) { nodes = (Node *)malloc(sizeof(Node) * length); for(int i = 0; i < length; ++i) make_set(i); } ~DisjointSets() { free(nodes); } int degree(int x) { return nodes[find_set(x)].degree; } void unite(int x, int y) { if(nodes[x].rank < nodes[y].rank) { nodes[find_set(x)].parent = find_set(y); nodes[y].degree += nodes[x].degree; } else if(nodes[x].rank > nodes[y].rank) { nodes[find_set(y)].parent = find_set(x); nodes[x].degree += nodes[y].degree; } else { nodes[find_set(y)].parent = find_set(x); nodes[x].rank++; nodes[x].degree += nodes[y].degree; } } bool same(int x, int y) { int set_x = find_set(x); int set_y = find_set(y); return set_x == set_y; } }; int main(int argc, char **argv) { int n, k; cin >> n >> k; DisjointSets *p_sets = new DisjointSets(n); for(int i = 0; i < k; ++i) { int x, y; cin >> x >> y; p_sets->unite(x - 1, y - 1); } int res = 1; for(int i = 0; i < n; ++i) res = max(res, p_sets->degree(i)); cout << res << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - 派閥 |
User | iosink |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 2152 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | all | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 100 | ||||
Status |
|
Set Name | Test Cases |
---|---|
all | 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt, test_51.txt, test_52.txt, test_53.txt, test_54.txt, test_55.txt, test_56.txt, test_57.txt, test_58.txt, test_59.txt, test_60.txt, test_61.txt, test_62.txt, test_63.txt, test_64.txt, test_65.txt, test_66.txt, test_67.txt, test_68.txt, test_69.txt, test_70.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_01.txt | AC | 1 ms | 256 KB |
00_sample_02.txt | AC | 1 ms | 256 KB |
00_sample_03.txt | AC | 1 ms | 256 KB |
00_sample_04.txt | AC | 1 ms | 256 KB |
test_01.txt | AC | 1 ms | 256 KB |
test_02.txt | AC | 1 ms | 256 KB |
test_03.txt | AC | 1 ms | 256 KB |
test_04.txt | WA | 1 ms | 256 KB |
test_05.txt | AC | 1 ms | 256 KB |
test_06.txt | AC | 1 ms | 256 KB |
test_07.txt | WA | 1 ms | 256 KB |
test_08.txt | WA | 1 ms | 256 KB |
test_09.txt | WA | 1 ms | 256 KB |
test_10.txt | WA | 1 ms | 256 KB |
test_11.txt | WA | 1 ms | 256 KB |
test_12.txt | WA | 1 ms | 256 KB |
test_13.txt | AC | 1 ms | 256 KB |
test_14.txt | AC | 1 ms | 256 KB |
test_15.txt | WA | 1 ms | 256 KB |
test_16.txt | WA | 1 ms | 256 KB |
test_17.txt | AC | 1 ms | 256 KB |
test_18.txt | WA | 1 ms | 256 KB |
test_19.txt | WA | 1 ms | 256 KB |
test_20.txt | WA | 1 ms | 256 KB |
test_21.txt | WA | 1 ms | 256 KB |
test_22.txt | WA | 1 ms | 256 KB |
test_23.txt | WA | 1 ms | 256 KB |
test_24.txt | WA | 1 ms | 256 KB |
test_25.txt | AC | 1 ms | 256 KB |
test_26.txt | WA | 1 ms | 256 KB |
test_27.txt | AC | 1 ms | 256 KB |
test_28.txt | WA | 1 ms | 256 KB |
test_29.txt | WA | 1 ms | 256 KB |
test_30.txt | WA | 1 ms | 256 KB |
test_31.txt | WA | 1 ms | 256 KB |
test_32.txt | WA | 1 ms | 256 KB |
test_33.txt | WA | 1 ms | 256 KB |
test_34.txt | WA | 1 ms | 256 KB |
test_35.txt | WA | 1 ms | 256 KB |
test_36.txt | WA | 1 ms | 256 KB |
test_37.txt | WA | 1 ms | 256 KB |
test_38.txt | WA | 1 ms | 256 KB |
test_39.txt | WA | 1 ms | 256 KB |
test_40.txt | WA | 1 ms | 256 KB |
test_41.txt | AC | 1 ms | 256 KB |
test_42.txt | WA | 1 ms | 256 KB |
test_43.txt | WA | 1 ms | 256 KB |
test_44.txt | WA | 1 ms | 256 KB |
test_45.txt | WA | 1 ms | 256 KB |
test_46.txt | WA | 1 ms | 256 KB |
test_47.txt | WA | 1 ms | 256 KB |
test_48.txt | WA | 1 ms | 256 KB |
test_49.txt | WA | 1 ms | 256 KB |
test_50.txt | WA | 1 ms | 256 KB |
test_51.txt | WA | 1 ms | 256 KB |
test_52.txt | WA | 1 ms | 256 KB |
test_53.txt | WA | 1 ms | 256 KB |
test_54.txt | WA | 1 ms | 256 KB |
test_55.txt | WA | 1 ms | 256 KB |
test_56.txt | WA | 1 ms | 256 KB |
test_57.txt | WA | 1 ms | 256 KB |
test_58.txt | WA | 1 ms | 256 KB |
test_59.txt | WA | 1 ms | 256 KB |
test_60.txt | WA | 1 ms | 256 KB |
test_61.txt | WA | 1 ms | 256 KB |
test_62.txt | AC | 1 ms | 256 KB |
test_63.txt | WA | 1 ms | 256 KB |
test_64.txt | WA | 1 ms | 256 KB |
test_65.txt | WA | 1 ms | 256 KB |
test_66.txt | WA | 1 ms | 256 KB |
test_67.txt | WA | 1 ms | 256 KB |
test_68.txt | WA | 1 ms | 256 KB |
test_69.txt | WA | 1 ms | 256 KB |
test_70.txt | WA | 1 ms | 256 KB |