結果

問題 No.556 仁義なきサルたち
ユーザー claw88
提出日時 2017-08-12 00:17:15
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 81 ms / 2,000 ms
コード長 3,769 bytes
コンパイル時間 958 ms
コンパイル使用メモリ 113,072 KB
実行使用メモリ 35,236 KB
最終ジャッジ日時 2024-10-12 22:30:04
合計ジャッジ時間 2,715 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 22
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Globalization;
using System.Diagnostics;
using static System.Console;
using Pair = System.Collections.Generic.KeyValuePair<int, int>;
//using System.Numerics;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    Scanner cin = new Scanner();
    Random rnd = new Random();
    Stopwatch sw = new Stopwatch();
    readonly int[] dd = { 0, 1, 0, -1, 0 };
    readonly int mod = 1000000007;
    readonly string alfa = "abcdefghijklmnopqrstuvwxyz";
    readonly string ALFA = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";

    int N;
    void solve()
    {
        N = cin.nextint;
        int M = cin.nextint;
        var U = new UnionFind(N + 1);
        for (int i = 0; i < M; i++)
        {
            U.Unite(cin.nextint, cin.nextint);
        }
        for (int i = 1; i <= N; i++)
        {
            WriteLine(U.FindSet(i));
        }
    }

    class UnionFind
    {
        internal int[] rank;
        internal int[] p;
        internal int[] weight;
        public UnionFind(int size)
        {
            rank = new int[size];
            p = new int[size];
            weight = new int[size];
            for (int i = 0; i < size; i++)
            {
                rank[i] = 0;
                p[i] = i;
                weight[i] = 1;
            }
        }
        public void Unite(int x, int y)
        {
            x = FindSet(x);
            y = FindSet(y);
            if (x == y) return;
            if (weight[x] > weight[y])
            {
                p[y] = x;
                weight[x] += weight[y];
                //Write('a');
            }
            else if (weight[x] < weight[y])
            {
                p[x] = y;
                weight[y] += weight[x];
                //Write('b');
            }
            else if(y < x)
            {
                p[x] = y;
                rank[y]++;
                weight[y] += weight[x];
                //Write('c');
            }
            else
            {
                p[y] = x;
                rank[x]++;
                weight[x] += weight[y];
                //Write('d');
            }
        }
        public bool Same(int x, int y)
        {
            return FindSet(x) == FindSet(y);
        }
        public int FindSet(int x)
        {
            var H = new HashSet<int>();
            while (p[x] != x)
            {
                H.Add(x);
                x = p[x];
            }
            foreach (var h in H)
            {
                p[h] = x;
            }
            return x;
        }
        public int Weight(int x)
        {
            return weight[FindSet(x)];
        }
    }

}

class Scanner
{
    string[] s; int i;
    char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan { get { return ReadLine().Split(); } }
    public int[] scanint { get { return Array.ConvertAll(scan, int.Parse); } }
    public long[] scanlong { get { return Array.ConvertAll(scan, long.Parse); } }
    public double[] scandouble { get { return Array.ConvertAll(scan, double.Parse); } }
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint { get { return int.Parse(next); } }
    public long nextlong { get { return long.Parse(next); } }
    public double nextdouble { get { return double.Parse(next); } }
}
0