#688216 (C++23) No.1639 最小通信路

• 問題: No.1639 最小通信路
• ユーザー: k1suxu
• 提出日時: 2021-08-12 15:24:16
• 言語: C++23 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 4 ms / 2,000 ms
• コード長: 1,812 bytes
• コンパイル時間: 2,779 ms
• コンパイル使用メモリ: 251,304 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-10-01 20:09:13
• 合計ジャッジ時間: 4,017 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

ファイルパターン	結果
sample	AC * 2
other	AC * 43

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define pb push_back
#define m0(x) memset(x,0,sizeof(x))
#define fill(x,y) memset(x,y,sizeof(x))
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define vs vector<string>
#define vvs vector<vs>
#define vc vector<char>
#define vvc vector<vc>
#define pii pair<int,int>
#define pllll pair<ll,ll>
#define vpii vector<pair<int,int>>
#define vpllll vector<pair<ll,ll>>
#define vpis vector<pair<int,string>>
#define vplls vector<pair<ll, string>>
#define vpsi vector<pair<string, int>>
#define vpsll vector<pair<string, ll>>
#define int ll
using ll = long long;
using ld = long double;
using ull = unsigned long long;
const ll INF = 1e15;
struct UnionFind {
    vi r;
    UnionFind(int n) {
        r = vi(n, -1);
    }
    int root(int x) {
        if(r[x] < 0) return x;
        return r[x] = root(r[x]);
    }
    void unite(int x, int y) {
        x = root(x);
        y = root(y);
        if(x == y) return;
        if(r[x] > r[y]) swap(x, y);
        r[x] += r[y];
        r[y] = x;
    }
    bool issame(int x, int y) {
        return root(x) == root(y);
    }
};
void solve() {
    int n;
    cin >> n;
    int m = n * (n - 1) / 2;
    UnionFind UF(n);
    string ans = "0";
    FOR(m) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        string s;
        cin >> s;
        if(UF.issame(a, b)) continue;
        UF.unite(a, b);
        ans = s;
    }
    cout << ans << endl;
}
signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX