結果

問題 No.483 マッチ並べ
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2017-02-10 22:31:40
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 38 ms / 2,000 ms
コード長 10,356 bytes
コンパイル時間 1,320 ms
コンパイル使用メモリ 115,116 KB
実行使用メモリ 37,884 KB
最終ジャッジ日時 2024-06-09 06:02:40
合計ジャッジ時間 4,046 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 36 ms
36,096 KB
testcase_01 AC 36 ms
36,088 KB
testcase_02 AC 36 ms
35,952 KB
testcase_03 AC 35 ms
34,052 KB
testcase_04 AC 35 ms
34,072 KB
testcase_05 AC 35 ms
36,088 KB
testcase_06 AC 35 ms
33,784 KB
testcase_07 AC 36 ms
36,092 KB
testcase_08 AC 38 ms
34,060 KB
testcase_09 AC 37 ms
35,840 KB
testcase_10 AC 37 ms
33,792 KB
testcase_11 AC 36 ms
33,916 KB
testcase_12 AC 36 ms
35,964 KB
testcase_13 AC 36 ms
31,744 KB
testcase_14 AC 36 ms
36,100 KB
testcase_15 AC 37 ms
35,964 KB
testcase_16 AC 35 ms
33,656 KB
testcase_17 AC 36 ms
35,972 KB
testcase_18 AC 36 ms
35,832 KB
testcase_19 AC 38 ms
35,840 KB
testcase_20 AC 35 ms
33,792 KB
testcase_21 AC 36 ms
33,792 KB
testcase_22 AC 36 ms
35,852 KB
testcase_23 AC 35 ms
33,920 KB
testcase_24 AC 36 ms
33,792 KB
testcase_25 AC 37 ms
33,796 KB
testcase_26 AC 36 ms
33,920 KB
testcase_27 AC 36 ms
33,920 KB
testcase_28 AC 37 ms
36,088 KB
testcase_29 AC 36 ms
35,828 KB
testcase_30 AC 38 ms
36,096 KB
testcase_31 AC 36 ms
33,920 KB
testcase_32 AC 36 ms
33,940 KB
testcase_33 AC 35 ms
35,964 KB
testcase_34 AC 35 ms
35,844 KB
testcase_35 AC 36 ms
35,968 KB
testcase_36 AC 36 ms
35,844 KB
testcase_37 AC 36 ms
35,856 KB
testcase_38 AC 36 ms
33,924 KB
testcase_39 AC 37 ms
35,964 KB
testcase_40 AC 35 ms
34,052 KB
testcase_41 AC 36 ms
35,840 KB
testcase_42 AC 36 ms
33,920 KB
testcase_43 AC 36 ms
35,968 KB
testcase_44 AC 36 ms
35,968 KB
testcase_45 AC 36 ms
36,092 KB
testcase_46 AC 36 ms
35,960 KB
testcase_47 AC 37 ms
35,968 KB
testcase_48 AC 36 ms
33,780 KB
testcase_49 AC 36 ms
32,016 KB
testcase_50 AC 36 ms
35,964 KB
testcase_51 AC 35 ms
33,920 KB
testcase_52 AC 36 ms
31,880 KB
testcase_53 AC 35 ms
35,828 KB
testcase_54 AC 36 ms
37,884 KB
testcase_55 AC 36 ms
36,100 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.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using Point = System.Numerics.Complex;
using Number = System.Int64;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var sat = new TwoSAT(120 * 120);
            var A = new int[n];
            var B = new int[n];
            for (int i = 0; i < n; i++)
            {
                var r = sc.Integer() - 1; var c = sc.Integer() - 1;
                var r2 = sc.Integer() - 1; var c2 = sc.Integer() - 1;
                A[i] = r * 120 + c;
                B[i] = r2 * 120 + c2;
            }
            for (int i = 0; i < n; i++)
                for (int j = i + 1; j < n; j++)
                {
                    if (A[i] == A[j]) sat.NAND(i, j);
                    if (A[i] == B[j]) sat.NAND(i, sat.NOT(j));
                    if (B[i] == A[j]) sat.NAND(sat.NOT(i), j);
                    if (B[i] == B[j]) sat.NAND(sat.NOT(i), sat.NOT(j));
                }
            if (sat.Satisfy()) IO.Printer.Out.WriteLine("YES");
            else IO.Printer.Out.WriteLine("NO");
        }
        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}

#region main
static class Ex
{
    static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer: StreamWriter
    {
        static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read()
        {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }

        public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n'; b = (char)read())
                if (b == 0) break;
                else if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != 0 && b != '-' && (b < '0' || '9' < b));
            if (b == 0) return long.MinValue;
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = ret * 10 + b - '0';
            }
        }
        public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n) { return enumerate(n, Char); }
        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
    }
}
#endregion
#region 2SAT
/// <summary>
/// 2-SAT
/// </summary>
public class TwoSAT
{
    int n;
    bool finished;
    SCCGraph scc;
    public TwoSAT(int n)
    {
        this.n = n;
        scc = new SCCGraph(2 * n);
    }
    /// <summary>
    /// !v
    /// </summary>
    public int NOT(int v)
    {
        if (v < n) return v + n;
        else return v - n;
    }
    /// <summary>
    /// (a v b) を追加 
    /// </summary>
    public void OR(int a, int b)
    {
        scc.AddEdge(NOT(a), b);
        scc.AddEdge(NOT(b), a);
    }
    /// <summary>
    /// !(a^b)を追加
    /// </summary>
    public void NAND(int a, int b)
    {
        OR(NOT(a), NOT(b));
    }
    /// <summary>
    /// a->bを追加
    /// </summary>
    public void IMP(int a, int b)
    {
        scc.AddEdge(a, b);
    }
    /// <summary>
    /// 満たす割当があるかどうかを判定O(E)
    /// /// </summary>
    public bool Satisfy()
    {
        scc.Build();
        for (int i = 0; i < n; i++)
            if (scc.IsSameGroup(i, NOT(i))) return false;
        finished = true;
        return true;
    }
    /// <summary>
    /// 真偽値を返す
    /// </summary>
    public bool this[int v]
    {
        get
        {
            Debug.Assert(0 <= v && v < n && finished);
            return scc.group[v] > scc.group[NOT(v)];
        }
    }

}
#endregion
#region SCCGraph
public class SCCGraph
{
    int n;

    List<int>[] g;

    /// <summary>
    /// 強連結成分内の集合
    /// </summary>
    public List<List<int>> scc;
    /// <summary>
    /// 元のグラフのインデックスから強連結成分分解後のインデックスへの写像
    /// </summary>
    public int[] group;

    /// <summary>
    /// 強連結成分のサイズ
    /// </summary>
    public int size;
    /// <summary>
    /// 強連結成分分解後のグラフ
    /// </summary>
    public List<int>[] G;
    /// <summary>
    /// 強連結成分分解後の自己ループの数
    /// </summary>
    public int[] L;

    public SCCGraph(int N)
    {
        n = N;
        g = new List<int>[n];
        scc = new List<List<int>>();
        for (int i = 0; i < n; i++)
        {
            g[i] = new List<int>();
        }
    }
    public void AddEdge(int f, int t)
    {
        g[f].Add(t);
    }

    /// <summary>
    /// 強連結成分をして，グラフを再構築する
    /// </summary>
    public void Build()
    {
        Decomposite();
        scc.Reverse();
        group = new int[n];
        L = new int[size];
        G = new List<int>[size];
        for (int i = 0; i < size; i++)
        {
            G[i] = new List<int>();
            foreach (var x in scc[i]) group[x] = i;
        }
        for (int i = 0; i < n; i++)
        {
            var u = group[i];
            foreach (var to in g[i])
            {
                var v = group[to];
                if (u == v) L[u]++;
                else G[u].Add(v);

            }

        }

    }
    /// <summary>
    /// 強連結成分分解をする
    /// </summary>
    public int Decomposite()
    {
        var S = new FastStack<int>(n + 2);
        var B = new FastStack<int>(n + 2);
        var I = new int[n];
        var iter = new int[n];
        var s = new FastStack<int>(n + 2);
        for (int i = 0; i < n; i++)
        {
            if (I[i] != 0) continue;
            Debug.WriteLine(i);
            s.Push(i);
            while (s.Any())
            {
                DFS:
                var u = s.Peek();
                if (I[u] == 0)
                {
                    B.Push(I[u] = S.Count);
                    S.Push(u);
                    iter[u] = 0;
                }
                while (iter[u] < g[u].Count)
                {
                    var v = g[u][iter[u]++];
                    if (I[v] == 0)
                    {
                        Debug.WriteLine(v);
                        s.Push(v);
                        goto DFS;
                    }
                    else while (I[v] < B.Peek()) B.Pop();
                }
                if (I[u] == B.Peek())
                {
                    var ns = new List<int>();
                    scc.Add(ns);
                    B.Pop();
                    while (I[u] < S.Count)
                    {
                        var p = S.Pop();
                        ns.Add(p);
                        I[p] = n + scc.Count;
                    }
                }
                s.Pop();

            }
        }
        return size = scc.Count;

    }
    public bool IsSameGroup(int u, int v) { return group[u] == group[v]; }
}
#endregion

#region Stack<T>
public class FastStack<T>
{
    T[] data;
    int ptr;
    public FastStack(int size) { data = new T[size]; }
    public void Push(T item) { data[ptr++] = item; }
    public T Pop() { return data[--ptr]; }
    public T Peek() { return data[ptr - 1]; }
    public bool Any() { return ptr != 0; }
    public T Last { get { return data[ptr - 1]; } set { data[ptr - 1] = value; } }
    public int Count { get { return ptr; } }
}
#endregion
0