結果
問題 | No.3092 3-2-SAT |
ユーザー | KumaTachiRen |
提出日時 | 2022-04-01 22:48:49 |
言語 | C# (.NET 8.0.203) |
結果 |
RE
|
実行時間 | - |
コード長 | 4,871 bytes |
コンパイル時間 | 15,774 ms |
コンパイル使用メモリ | 170,416 KB |
実行使用メモリ | 194,340 KB |
最終ジャッジ日時 | 2024-11-20 11:08:06 |
合計ジャッジ時間 | 25,414 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 51 ms
27,904 KB |
testcase_01 | AC | 307 ms
96,996 KB |
testcase_02 | AC | 408 ms
92,616 KB |
testcase_03 | AC | 298 ms
86,088 KB |
testcase_04 | AC | 695 ms
116,412 KB |
testcase_05 | AC | 328 ms
86,976 KB |
testcase_06 | RE | - |
testcase_07 | RE | - |
testcase_08 | RE | - |
testcase_09 | RE | - |
testcase_10 | RE | - |
testcase_11 | AC | 50 ms
28,032 KB |
testcase_12 | AC | 50 ms
28,032 KB |
testcase_13 | AC | 51 ms
27,904 KB |
testcase_14 | AC | 51 ms
27,648 KB |
testcase_15 | AC | 51 ms
27,900 KB |
testcase_16 | RE | - |
testcase_17 | RE | - |
testcase_18 | RE | - |
testcase_19 | RE | - |
testcase_20 | RE | - |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (124 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/
ソースコード
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 { int n, m; List<int>[] e, re; int[] cmp; bool[] ans; List<int> ps; public void Solve() { n = ri; m = ri; e = new List<int>[6 * n]; re = new List<int>[6 * n]; for (int i = 0; i < 6 * n; i++) { e[i] = new List<int>(); re[i] = new List<int>(); } for (int i = 0; i < n; i++) { add_closure(i + 3 * n, i + 4 * n); add_closure(i + 3 * n, i + 5 * n); add_closure(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; add_closure(p + a * n, q + b * n); } cmp = new int[6 * n]; ps = new List<int>(); for (int i = 0; i < 6 * n; i++) cmp[i] = -1; ans = new bool[3 * n]; if (satisfy()) { var x = new int[n]; for (int i = 0; i < n; i++) { for (int j = 0; j < 3; j++) if (ans[i + j * n]) x[i] = j + 1; } WriteJoin(" ", x); } else Write(-1); } void add_closure(int x, int y) { add_edge((x + 3 * n) % (6 * n), y); add_edge((y + 3 * n) % (6 * n), x); } void add_edge(int x, int y) { e[x].Add(y); re[y].Add(x); } 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); } } int scc() { for (int i = 0; i < 6 * n; i++) if (cmp[i] == -1) dfs(i); for (int i = 0; i < 6 * n; i++) cmp[i] = -1; int k = 0; for (int i = 6 * n - 1; i >= 0; i--) if (cmp[ps[i]] == -1) rdfs(ps[i], k++); return k; } bool satisfy() { scc(); for (int i = 0; i < 3 * n; i++) { if (cmp[i] == cmp[i + 3 * n]) return false; ans[i] = cmp[i] > cmp[i + 3 * 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()); } }