結果

問題 No.483 マッチ並べ
ユーザー claw88claw88
提出日時 2017-02-11 02:39:07
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 39 ms / 2,000 ms
コード長 3,826 bytes
コンパイル時間 825 ms
コンパイル使用メモリ 112,784 KB
実行使用メモリ 32,852 KB
最終ジャッジ日時 2024-06-09 08:05:55
合計ジャッジ時間 3,645 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 27 ms
26,248 KB
testcase_01 AC 30 ms
28,368 KB
testcase_02 AC 28 ms
26,208 KB
testcase_03 AC 28 ms
28,380 KB
testcase_04 AC 29 ms
28,112 KB
testcase_05 AC 29 ms
28,120 KB
testcase_06 AC 29 ms
30,300 KB
testcase_07 AC 29 ms
28,116 KB
testcase_08 AC 28 ms
26,076 KB
testcase_09 AC 29 ms
26,328 KB
testcase_10 AC 29 ms
28,248 KB
testcase_11 AC 28 ms
28,624 KB
testcase_12 AC 29 ms
28,364 KB
testcase_13 AC 29 ms
30,164 KB
testcase_14 AC 29 ms
28,248 KB
testcase_15 AC 30 ms
28,364 KB
testcase_16 AC 29 ms
25,992 KB
testcase_17 AC 30 ms
28,360 KB
testcase_18 AC 28 ms
28,256 KB
testcase_19 AC 29 ms
28,120 KB
testcase_20 AC 31 ms
30,284 KB
testcase_21 AC 29 ms
28,372 KB
testcase_22 AC 28 ms
28,620 KB
testcase_23 AC 29 ms
28,620 KB
testcase_24 AC 29 ms
30,304 KB
testcase_25 AC 29 ms
28,504 KB
testcase_26 AC 34 ms
32,468 KB
testcase_27 AC 31 ms
32,468 KB
testcase_28 AC 30 ms
30,296 KB
testcase_29 AC 29 ms
28,376 KB
testcase_30 AC 39 ms
32,852 KB
testcase_31 AC 29 ms
28,640 KB
testcase_32 AC 32 ms
30,420 KB
testcase_33 AC 29 ms
28,624 KB
testcase_34 AC 28 ms
28,376 KB
testcase_35 AC 31 ms
28,628 KB
testcase_36 AC 28 ms
28,116 KB
testcase_37 AC 34 ms
32,332 KB
testcase_38 AC 34 ms
30,548 KB
testcase_39 AC 37 ms
30,288 KB
testcase_40 AC 30 ms
28,372 KB
testcase_41 AC 31 ms
30,176 KB
testcase_42 AC 31 ms
32,468 KB
testcase_43 AC 34 ms
30,416 KB
testcase_44 AC 30 ms
28,496 KB
testcase_45 AC 27 ms
26,460 KB
testcase_46 AC 30 ms
28,500 KB
testcase_47 AC 31 ms
30,440 KB
testcase_48 AC 27 ms
26,200 KB
testcase_49 AC 28 ms
28,248 KB
testcase_50 AC 33 ms
30,676 KB
testcase_51 AC 35 ms
32,080 KB
testcase_52 AC 31 ms
32,332 KB
testcase_53 AC 28 ms
28,364 KB
testcase_54 AC 28 ms
28,628 KB
testcase_55 AC 28 ms
28,376 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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>;

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

    const int MAX = 10000;
    void Solve()
    {
        int N = cin.Nextint;
        var U = new UnionFind(MAX);
        var A = new int[MAX];
        var B = new bool[MAX];
        for (int i = 0; i < N; i++)
        {
            var C = cin.Scanint.Select(k => k - 1).ToArray();
            var a = C[0] * 100 + C[1];
            var b = C[2] * 100 + C[3];
            U.Unite(a, b);
            A[a]++;
        }

        //各連結フレンズの辺の数と頂点の数を調べる
        for (int i = 0; i < MAX; i++)
        {
            if (B[i]) continue;
            var node = U.Weight(i);
            if (node < 5) continue;
            var edge = A[i];
            for (int j = i + 1; j < MAX; j++)
            {
                if (U.Same(i, j))
                {
                    edge += A[j];
                    B[j] = true;
                }
            }
            if (edge - node >= 1)
            {
                WriteLine("NO");
                return;
            }
        }

        WriteLine("YES");

    }

}

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 (rank[x] > rank[y])
        {
            p[y] = x;
            weight[x] += weight[y];
        }

        if (rank[x] < rank[y])
        {
            p[x] = y;
            weight[y] += weight[x];
        }
        if (rank[x] == rank[y])
        {
            p[x] = y;
            rank[y]++;
            weight[y] += weight[x];
        }
    }
    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