結果

問題 No.483 マッチ並べ
ユーザー claw88claw88
提出日時 2017-02-11 02:33:02
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 3,793 bytes
コンパイル時間 1,030 ms
コンパイル使用メモリ 109,824 KB
実行使用メモリ 24,576 KB
最終ジャッジ日時 2024-06-09 08:05:32
合計ジャッジ時間 3,679 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 28 ms
21,068 KB
testcase_01 AC 30 ms
24,448 KB
testcase_02 AC 27 ms
20,992 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 AC 30 ms
24,028 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 32 ms
24,316 KB
testcase_12 AC 31 ms
24,064 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 32 ms
24,316 KB
testcase_17 AC 27 ms
22,364 KB
testcase_18 AC 27 ms
20,992 KB
testcase_19 WA -
testcase_20 AC 29 ms
23,900 KB
testcase_21 AC 32 ms
24,448 KB
testcase_22 AC 30 ms
24,156 KB
testcase_23 AC 31 ms
24,448 KB
testcase_24 AC 33 ms
24,448 KB
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 32 ms
24,320 KB
testcase_28 AC 37 ms
24,448 KB
testcase_29 AC 50 ms
24,064 KB
testcase_30 WA -
testcase_31 AC 39 ms
24,312 KB
testcase_32 AC 45 ms
24,576 KB
testcase_33 AC 34 ms
24,164 KB
testcase_34 AC 30 ms
24,036 KB
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 AC 31 ms
24,316 KB
testcase_41 AC 31 ms
24,316 KB
testcase_42 AC 29 ms
22,508 KB
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 AC 28 ms
20,944 KB
testcase_54 AC 29 ms
23,168 KB
testcase_55 AC 30 ms
23,168 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];
                }
            }
            if (node - edge >= 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