洛谷 P1111 修复公路 基础并查集，kruscal最小生成树的最长边

题目背景

AAA地区在地震过后，连接所有村庄的公路都造成了损坏而无法通车。政府派人修复这些公路。
题目描述

给出A地区的村庄数NNN，和公路数MMM，公路是双向的。并告诉你每条公路的连着哪两个村庄，并告诉你什么时候能修完这条公路。问最早什么时候任意两个村庄能够通车，即最早什么时候任意两条村庄都存在至少一条修复完成的道路（可以由多条公路连成一条道路）
输入格式

第111行两个正整数N,MN,MN,M

下面MMM行，每行333个正整数x,y,tx, y, tx,y,t，告诉你这条公路连着x,yx,yx,y两个村庄，在时间t时能修复完成这条公路。
输出格式

如果全部公路修复完毕仍然存在两个村庄无法通车，则输出−1-1−1，否则输出最早什么时候任意两个村庄能够通车。
输入输出样例
输入 #1

4 4
1 2 6
1 3 4
1 4 5
4 2 3

输出 #1

5

说明/提示

N≤1000,M≤100000N \le 1000,M \le 100000N≤1000,M≤100000

x≤N,y≤N,t≤100000x \le N,y \le N,t \le 100000x≤N,y≤N,t≤100000

---

直接返回最小生成树的最大边即可，板子题

#define debug
#ifdef debug
#include <time.h>
#endif

#include <iostream>
#include <algorithm>
#include <vector>
#include <string.h>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <math.h>

#define MAXN ((int)1e5+7)
#define ll long long int
#define INF (0x7f7f7f7f)
#define fori(lef, rig) for(int i=lef; i<=rig; i++)
#define forj(lef, rig) for(int j=lef; j<=rig; j++)
#define fork(lef, rig) for(int k=lef; k<=rig; k++)
#define QAQ (0)

using namespace std;

#define show(x...) \
    do { \
       cout << "\033[31;1m " << #x << " -> "; \
       err(x); \
    } while (0)

void err() { cout << "\033[39;0m" << endl; }
template<typename T, typename... A>
void err(T a, A... x) { cout << a << ' '; err(x...); }

namespace FastIO{

    char print_f[105];
    void read() {}
    void print() { putchar('\n'); }

    template <typename T, typename... T2>
       inline void read(T &x, T2 &... oth) {
           x = 0;
           char ch = getchar();
           ll f = 1;
           while (!isdigit(ch)) {
               if (ch == '-') f *= -1; 
               ch = getchar();
           }
           while (isdigit(ch)) {
               x = x * 10 + ch - 48;
               ch = getchar();
           }
           x *= f;
           read(oth...);
       }
    template <typename T, typename... T2>
       inline void print(T x, T2... oth) {
           ll p3=-1;
           if(x<0) putchar('-'), x=-x;
           do{
                print_f[++p3] = x%10 + 48;
           } while(x/=10);
           while(p3>=0) putchar(print_f[p3--]);
           putchar(' ');
           print(oth...);
       }
} // namespace FastIO
using FastIO::print;
using FastIO::read;

int n, m, Q, K, pre[MAXN];

struct Node {
    int u, v, w;
} a[MAXN];

bool cmp(Node& x, Node& y) { return x.w < y.w; }

int fa(int x) { return pre[x]==x ? x : (pre[x]=fa(pre[x])); }
void union_xy(int x, int y) {
    x = fa(x), y = fa(y);
    if(x ^ y) pre[y] = x;
}

signed main() {
#ifdef debug
    freopen("test.txt", "r", stdin);
    // freopen("P1111_1.in", "r", stdin);
    clock_t stime = clock();
#endif
    read(n, m);
    for(int i=1; i<=n; i++) pre[i] = i;
    for(int i=1; i<=m; i++) read(a[i].u, a[i].v, a[i].w);
    sort(a+1, a+1+m, cmp); //这里几乎每次都会写成 sort(a+1, a+1+n, cmp)
    int k = n - 1, ans = -1;
    for(int i=1; i<=m && k; i++) {
        int u = a[i].u, v = a[i].v, w = a[i].w;
        if(fa(u) == fa(v)) continue ;
        union_xy(u, v);
        k --;
        ans = w;
    }
    printf("%d\n", k ? -1 : ans);



#ifdef debug
   clock_t etime = clock();
   printf("rum time: %lf 秒\n",(double) (etime-stime)/CLOCKS_PER_SEC);
#endif 
   return 0;
}

java

import java.io.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.*;

public class Main {
    public static final boolean debug = true;
    public static String INPATH = "C:\\Users\\majiao\\Desktop\\P1111_1.in",
            OUTPATH = "C:\\Users\\majiao\\Desktop\\out.txt";
    public static StreamTokenizer tok;
    public static BufferedReader cin;
    public static PrintWriter cout;

    public static long start_time = 0, out_time = 0;
    public static int n, m, K, Q, MAXN = (int)1e5+7, INF = 0x3f3f3f3f,
                        pre[] = new int[MAXN], sum[] = new int[MAXN], POS = 50000;
    public static byte buf[] = new byte[MAXN];

    public static int fa(int x) { return pre[x]==x ? x : (pre[x]=fa(pre[x])); }

    public static void union_xy(int x, int y) {
        x = fa(x); y = fa(y);
        if(x != y) {
            sum[x] += sum[y];
            pre[y] = x;
        }
    }

    static class Edge implements Comparable<Edge> {
        int u, v, w;

        @Override
        public int compareTo(Edge o) {
//            return w < o.w ? -1 : (w == o.w ? 0 : 1);
            return w - o.w;
        }
    }
    static Edge a[] = new Edge[MAXN];

    public static void main(String[] args) throws IOException {
        main_init();
        if(debug) { start_time = System.currentTimeMillis(); }
        if(false) { System.setOut(new PrintStream(OUTPATH)); }

        n = read_int(); m = read_int();
        for(int i=1; i<=n; i++) pre[i] = i;
        int u = 0, v = 0, w = 0;
        for(int i=1; i<=m; i++) {
            a[i] = new Edge();
            a[i].u = read_int(); a[i].v = read_int(); a[i].w = read_int();
        }
        Arrays.sort(a, 1, m+1);
        int k = n - 1, ans = -1;
        for(int i=1; i<=m && k>0; i++) {
            u = a[i].u; v = a[i].v; w = a[i].w;
            if(fa(u) == fa(v)) continue ;
            k --;
            ans = w;
            union_xy(u, v);
        }
        cout.printf("%d\n", k>0 ? -1 : ans);

        if(debug) {
            out_time = System.currentTimeMillis();
            cout.printf("run time : %d ms\n", out_time-start_time);
        }
        cout.flush();
    }

    public static void show(List<Object> list, Object... obj) {
        cout.printf("%s : ", obj.length>0 ? obj[0] : "");
        for(Object x : list) {
            cout.printf("[%s] ", x);
        }
        cout.printf("\n");
    }

    public static void show(Map<Object, Object> mp, Object... obj) {
        cout.printf("%s : ", obj.length>0 ? obj[0] : "");
        Set<Map.Entry<Object, Object>> entries = mp.entrySet();
        for (Map.Entry<Object, Object> en : entries) {
            cout.printf("[%s,%s] ", en.getKey(), en.getValue());
        }
        cout.printf("\n");
    }

    public static<T> void forarr(T arr[], int ...args) {
        int lef = 0, rig = arr.length - 1;
        if(args.length > 0) { lef = args[0]; rig = args[1]; }
        cout.printf(" : ");
        for( ; lef<=rig; lef++) {
            cout.printf("[%s] ", args[lef]);
        }
        cout.printf("\n");
    }

    public static void main_init() {
        try {
            if (debug) {
                cin = new BufferedReader(new InputStreamReader(
                        new FileInputStream(INPATH)));
            } else {
                cin = new BufferedReader(new InputStreamReader(System.in));
            }
            cout = new PrintWriter(new OutputStreamWriter(System.out));
//            cout = new PrintWriter(OUTPATH);
            tok = new StreamTokenizer(cin);
        } catch (Exception e) {
            e.printStackTrace();
        }
    }

    public static String next_str() {
        try {
            tok.nextToken();
            if (tok.ttype == StreamTokenizer.TT_EOF)
                return null;
            else if (tok.ttype == StreamTokenizer.TT_NUMBER) {
                return String.valueOf((int)tok.nval);
            } else if (tok.ttype == StreamTokenizer.TT_WORD) {
                return tok.sval;
            } else return null;
        } catch (Exception e) {
            e.printStackTrace();
            return null;
        }
    }

    public static int read_int() {
        String tmp_next_str = next_str();
        return null==tmp_next_str ? -1 : Integer.parseInt(tmp_next_str);
    }
    public static long read_long() { return Long.parseLong(next_str()); }
    public static double read_double() { return Double.parseDouble(next_str()); }
    public static BigInteger read_big() { return new BigInteger(next_str()); }
    public static BigDecimal read_dec() { return new BigDecimal(next_str()); }

}