結果
| 問題 | No.1078 I love Matrix Construction |
| ユーザー |
 eSeF
|
| 提出日時 | 2020-06-12 23:18:54 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 9,935 bytes |
| コンパイル時間 | 4,575 ms |
| コンパイル使用メモリ | 121,312 KB |
| 実行使用メモリ | 64,360 KB |
| 最終ジャッジ日時 | 2024-06-24 05:59:31 |
| 合計ジャッジ時間 | 8,304 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 8 TLE * 1 -- * 13 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;using System.Collections.Generic;using System.Linq;using System.IO;using System.Text;using System.Numerics;using System.Threading;using static System.Math;using static System.Array;using static AtCoder.IO_ShortCut;using static AtCoder.Tool;using static AtCoder.ModInt;namespace AtCoder{class AC{const int MOD = 1000000007;//const int MOD = 998244353;const int INF = int.MaxValue / 2;const long SINF = long.MaxValue / 2;const double EPS = 1e-8;static readonly int[] dI = { 0, 1, 0, -1, 1, -1, -1, 1 };static readonly int[] dJ = { 1, 0, -1, 0, 1, 1, -1, -1 };//static List<List<int>> G = new List<List<int>>();static List<List<Edge>> G = new List<List<Edge>>();//static List<Edge> E = new List<Edge>();static void Main(string[] args){var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; Console.SetOut(sw);/*var th = new Thread(Run, 1 << 26);th.Start();th.Join();*/Run();Console.Out.Flush();}static void Run(){int Testcase = 1;for (var _ = 0; _ < Testcase; _++) Solve();}static void Solve(){int N = Int;var S = _ReadSplitInt;var T = _ReadSplitInt;var U = _ReadSplitInt;var C = new List<(int, int)>[N * N][];for(var i = 0; i < N; i++){S[i]--;T[i]--;for(var j = 0; j < N; j++){C[i * N + j] = new List<(int, int)>[2];C[i * N + j][0] = new List<(int, int)>();C[i * N + j][1] = new List<(int, int)>();}}for(var i = 0; i < N; i++){for(var j = 0; j < N; j++){int idx = S[i] * N + j;int idy = j * N + T[i];C[idx][U[i] % 2].Add((idy, U[i] / 2));C[idy][U[i] / 2].Add((idx, U[i] % 2));}}var ans = new int[N * N];var NG = new bool[N * N][];for(var i = 0; i < N * N; i++){NG[i] = new bool[2];}Initialize(ref ans, -1);bool dfs(int now, int r){ans[now] = r;var ret = true;//OutL($"now={now},r={r}");//Out_Sep(C[now][r]);foreach(var tp in C[now][r]){int nx = tp.Item1;int nr = tp.Item2;if (ans[nx] == -1){ret &= dfs(nx, (nr + 1) % 2);if (!ret) { ans[nx] = -1; NG[nx][(nr + 1) % 2] = true; }}else{if (ans[nx] != (nr + 1) % 2) ret = false;}}if (ret == false) NG[now][r] = true;return ret;}for(var i = 0; i < N; i++){for(var j = 0; j < N; j++){if (ans[i * N + j] != -1) continue;var ok = false;if (!NG[i * N + j][0]) ok |= dfs(i * N + j, 0);if (!ok && !NG[i * N + j][1]) ok |= dfs(i * N + j, 1);if (!ok){OutL(-1);return;}//OutL("==========");/*for (var k = 0; k < N; k++){for (var l = 0; l < N; l++){Out_One(ans[k * N + l]);}Endl();}*/}}for (var k = 0; k < N; k++){for (var l = 0; l < N; l++){Out_One(ans[k * N + l]);}Endl();}}public struct Edge{public int from;public int to;public long dist;public Edge(int t, long c){from = -1;to = t;dist = c;}public Edge(int f, int t, long c){from = f;to = t;dist = c;}}}struct ModInt{public long value;private const int MOD = 1000000007;//private const int MOD = 998244353;public ModInt(long value) { this.value = value; }public static implicit operator ModInt(long a){var ret = a % MOD;return new ModInt(ret < 0 ? (ret + MOD) : ret);}public static ModInt operator +(ModInt a, ModInt b) => (a.value + b.value);public static ModInt operator -(ModInt a, ModInt b) => (a.value - b.value);public static ModInt operator *(ModInt a, ModInt b) => (a.value * b.value);public static ModInt operator /(ModInt a, ModInt b) => a * Modpow(b, MOD - 2);public static ModInt operator <<(ModInt a, int n) => (a.value << n);public static ModInt operator >>(ModInt a, int n) => (a.value >> n);public static ModInt operator ++(ModInt a) => a.value + 1;public static ModInt operator --(ModInt a) => a.value - 1;public static ModInt Modpow(ModInt a, long n){var k = a;ModInt ret = 1;while (n > 0){if ((n & 1) != 0) ret *= k;k *= k;n >>= 1;}return ret;}private static readonly List<long> Factorials = new List<long>() { 1 };public static ModInt Fac(long n){for (var i = Factorials.Count(); i <= n; i++){Factorials.Add((Factorials[i - 1] * i) % MOD);}return Factorials[(int)n];}public static ModInt nCr(long n, long r){return n < r ? 0 : Fac(n) / (Fac(r) * Fac(n - r));}public static explicit operator int(ModInt a) => (int)a.value;}static class IO_ShortCut{public static string[] _ReadSplit => Console.ReadLine().Split();public static int[] _ReadSplitInt => ConvertAll(Console.ReadLine().Split(), int.Parse);public static long[] _ReadSplitLong => ConvertAll(Console.ReadLine().Split(), long.Parse);public static double[] _ReadSplit_Double => ConvertAll(Console.ReadLine().Split(), double.Parse);public static string Str => Console.ReadLine();public static int Int => int.Parse(Console.ReadLine());public static long Long => long.Parse(Console.ReadLine());public static double Double => double.Parse(Console.ReadLine());public static T Conv<T>(string input){if (typeof(T).Equals(typeof(ModInt))){return (T)(dynamic)(long.Parse(input));}return (T)Convert.ChangeType(input, typeof(T));}public static void Input<T>(out T a) => a = Conv<T>(Console.ReadLine());public static void Input<T, U>(out T a, out U b){ var q = _ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); }public static void Input<T, U, V>(out T a, out U b, out V c){ var q = _ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]); }public static void Input<T, U, V, W>(out T a, out U b, out V c, out W d){ var q = _ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]); d = Conv<W>(q[3]); }public static void Input<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e){ var q = _ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]); d = Conv<W>(q[3]); e = Conv<X>(q[4]); }public static void OutL(object s) => Console.WriteLine(s);public static void Out_Sep<T>(IEnumerable<T> s) => Console.WriteLine(string.Join(" ", s));public static void Out_Sep<T>(IEnumerable<T> s, string sep) => Console.WriteLine(string.Join($"{sep}", s));public static void Out_Sep(params object[] s) => Console.WriteLine(string.Join(" ", s));public static void Out_One(object s) => Console.Write($"{s} ");public static void Out_One(object s, string sep) => Console.Write($"{s}{sep}");public static void Endl() => Console.WriteLine();}public static class Tool{static public void Initialize<T>(ref T[] array, T initialvalue){array = ConvertAll(array, x => initialvalue);}static public void Swap<T>(ref T a, ref T b){T keep = a;a = b;b = keep;}static public void Display<T>(T[,] array2d, int n, int m){for (var i = 0; i < n; i++){for (var j = 0; j < m; j++){Console.Write($"{array2d[i, j]} ");}Console.WriteLine();}}static public long Gcd(long a, long b){if (a == 0 || b == 0) return Max(a, b);return a % b == 0 ? b : Gcd(b, a % b);}static public long LPow(int a, int b) => (long)Pow(a, b);static public bool Bit(long x, int dig) => ((1L << dig) & x) != 0;static public int Sig(long a) => a == 0 ? 0 : (int)(a / Abs(a));}}