結果

問題 No.3092 3-2-SAT
ユーザー KumaTachiRenKumaTachiRen
提出日時 2022-04-01 22:58:12
言語 C#
(.NET 8.0.203)
結果
RE  
実行時間 -
コード長 5,294 bytes
コンパイル時間 10,219 ms
コンパイル使用メモリ 166,528 KB
実行使用メモリ 194,804 KB
最終ジャッジ日時 2024-04-30 15:28:20
合計ジャッジ時間 18,918 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 50 ms
29,792 KB
testcase_01 AC 342 ms
96,932 KB
testcase_02 AC 455 ms
93,304 KB
testcase_03 AC 330 ms
86,644 KB
testcase_04 AC 743 ms
116,400 KB
testcase_05 AC 355 ms
87,792 KB
testcase_06 RE -
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 RE -
testcase_11 AC 51 ms
27,776 KB
testcase_12 AC 48 ms
27,776 KB
testcase_13 AC 50 ms
28,032 KB
testcase_14 AC 52 ms
27,776 KB
testcase_15 AC 51 ms
27,648 KB
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 RE -
testcase_20 RE -
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (103 ms)。
MSBuild のバージョン 17.9.6+a4ecab324 (.NET)
  main -> /home/judge/data/code/bin/Release/net8.0/main.dll
  main -> /home/judge/data/code/bin/Release/net8.0/publish/

ソースコード

diff #

using System;
using System.Linq;
using System.Numerics;
using System.Collections;
using System.Collections.Generic;
using System.IO;
using System.Text;
using N = System.Int64;

static class Program
{
    static public void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        var solver = new Solver();
        solver.Solve();
        Console.Out.Flush();
    }
}

public class Solver
{
    public void Solve()
    {
        int n = ri, m = ri;
        var s = new TwoSAT(3 * n);
        for (int i = 0; i < n; i++)
        {
            s.AddClosure(i + 3 * n, i + 4 * n);
            s.AddClosure(i + 3 * n, i + 5 * n);
            s.AddClosure(i + 4 * n, i + 5 * n);
        }
        for (int i = 0; i < m; i++)
        {
            int p = ri - 1, q = ri - 1, a = ri - 1, b = ri - 1;
            s.AddClosure(p + a * n, q + b * n);
        }
        if (s.Satisfy())
        {
            var x = new int[n];
            for (int i = 0; i < n; i++)
            {
                for (int j = 0; j < 3; j++) if (s.ans[i + j * n]) x[i] = j + 1;
            }
            WriteJoin(" ", x);
        }
        else Write(-1);
    }

    public class TwoSAT
    {
        int n;
        List<int>[] e, re;
        int[] cmp;
        List<int> ps;
        public bool[] ans;
        public TwoSAT(int _n)
        {
            n = _n;
            e = new List<int>[n * 2];
            re = new List<int>[n * 2];
            for (int i = 0; i < n * 2; i++)
            {
                e[i] = new List<int>();
                re[i] = new List<int>();
            }
            ans = new bool[n * 2];
        }
        public void AddClosure(int x, int y)
        {
            AddEdge((x + n) % (2 * n), y);
            AddEdge((y + n) % (2 * n), x);
        }
        private void AddEdge(int x, int y)
        {
            e[x].Add(y);
            re[y].Add(x);
        }
        private void Dfs(int u)
        {
            cmp[u] = 0;
            for (int i = 0; i < e[u].Count; i++)
            {
                int v = e[u][i];
                if (cmp[v] == -1) Dfs(v);
            }
            ps.Add(u);
        }
        void rDfs(int u, int k)
        {
            cmp[u] = k;
            for (int i = 0; i < re[u].Count; i++)
            {
                int v = re[u][i];
                if (cmp[v] == -1) rDfs(v, k);
            }
        }
        private int Scc()
        {
            cmp = new int[n * 2];
            for (int i = 0; i < 2 * n; i++) cmp[i] = -1;
            ps = new List<int>();
            for (int i = 0; i < 2 * n; i++) if (cmp[i] == -1) Dfs(i);
            for (int i = 0; i < 2 * n; i++) cmp[i] = -1;
            int k = 0;
            for (int i = 2 * n - 1; i >= 0; i--) if (cmp[ps[i]] == -1) rDfs(ps[i], k++);
            return k;
        }
        public bool Satisfy()
        {
            Scc();
            for (int i = 0; i < n; i++)
            {
                if (cmp[i] == cmp[i + n]) return false;
                ans[i] = cmp[i] > cmp[i + n];
            }
            return true;
        }
    }

    const long inf = (long)1 << 60;
    int ri { get { return (int)sc.Integer(); } }
    long rl { get { return sc.Integer(); } }
    double rd { get { return sc.Double(); } }
    string rs { get { return sc.Scan(); } }
    public StreamScanner sc = new StreamScanner(Console.OpenStandardInput());

    void WriteJoin<T>(string s, T[] t) { Console.WriteLine(string.Join(s, t)); }
    void WriteJoin<T>(string s, List<T> t) { Console.WriteLine(string.Join(s, t)); }
    void Write<T>(T t) { Console.WriteLine(t.ToString()); }
    void YN(bool t) { Console.WriteLine(t ? "YES" : "NO"); }
    void Yn(bool t) { Console.WriteLine(t ? "Yes" : "No"); }
    void yn(bool t) { Console.WriteLine(t ? "yes" : "no"); }
    void Swap(ref int x, ref int y) { x ^= y; y ^= x; x ^= y; }
}


public class StreamScanner
{
    public StreamScanner(Stream stream) { str = stream; }
    private 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) throw new EndOfStreamException();
        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);
        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 long Integer()
    {
        long ret = 0; byte b = 0; var ng = false;
        do b = read();
        while (b != '-' && (b < '0' || '9' < b));
        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 double Double() { return double.Parse(Scan()); }
}
0