Submission #1348878
Source Code Expand
using System; using System.Linq; using System.Collections.Generic; using Debug = System.Diagnostics.Debug; using SB = System.Text.StringBuilder; //using System.Numerics; using Number = System.Int64; using static System.Math; //using static MathEx; //using P = System.Collections.Generic.KeyValuePair<int, int>; namespace Program { public class Solver { public void Solve() { var n = ri; var A = Enumerate(3, x => sc.Integer(n)); for (int i = 0; i < 3; i++) for (int j = 0; j < n; j++) A[i][j]--; var ok = true; var P = Enumerate(2, x => new List<int>()); var par = new int[2]; for (int i = 0; i < n; i++) { var a = new int[] { A[0][i], A[1][i], A[2][i] }; Array.Sort(a); if (A[1][i] != a[1]) ok = false; if (a[1] - a[0] != 1) ok = false; if (a[2] - a[1] != 1) ok = false; var x = a[0] / 3; if (Math.Abs(i - x) % 2 == 1) ok = false; if (a[0] == A[0][i]) { if (Math.Abs(i - x) == 2) { Debug.WriteLine(i); par[i % 2] ^= 1; } } else { if (Math.Abs(i - x) == 0) { Debug.WriteLine(i); par[i % 2] ^= 1; } } P[i % 2].Add(a[0] / 6); } var inv = new int[2]; for (int k = 0; k < 2; k++) f(P[k], 0, P[k].Count, ref inv[k]); Debug.WriteLine(P[0].AsJoinedString()); Debug.WriteLine(P[1].AsJoinedString()); Debug.WriteLine(par.AsJoinedString()); Debug.WriteLine(inv.AsJoinedString()); Debug.WriteLine(""); for (int k = 0; k < 2; k++) if (par[k] != inv[k ^ 1]) ok = false; if (ok) IO.Printer.Out.WriteLine("Yes"); else IO.Printer.Out.WriteLine("No"); } List<int> f(List<int> a, int l, int r, ref int inv) { if (r - l == 1) return new List<int>() { l }; var m = (l + r) / 2; var L = f(a, l, m, ref inv); var R = f(a, m, r, ref inv); var ret = new List<int>(); l = 0; r = 0; while (l < L.Count || r < R.Count) { if (l == L.Count || L[l] > R[r]) ret.Add(R[r++]); else { inv ^= (~R.BinarySearch(L[l])) % 2; ret.Add(L[l++]); } } //Debug.WriteLine(ret.AsJoinedString()); return ret; } //* int ri => sc.Integer(); long rl => sc.Long(); double rd => sc.Double(); string rs => sc.Scan(); char rc => sc.Char(); [System.Diagnostics.Conditional("DEBUG")] void put(params object[] a) => Debug.WriteLine(string.Join(" ", a)); //*/ 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 void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; } } } #region main static class Ex { public static string AsString(this IEnumerable<char> ie) { return new string(ie.ToArray()); } public static string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); } public static 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(Stream stream) : base(stream, new UTF8Encoding(false, true)) { } public Printer(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; public bool IsEndOfStream { get { return isEof; } } private byte read() { if (isEof) return 0; if (ptr < len) return buf[ptr++]; ptr = 0; if ((len = str.Read(buf, 0, 1024)) > 0) return buf[ptr++]; isEof = true; return 0; } public char Char() { byte b; 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; 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 (; ; b = read()) { if (b < '0' || '9' < b) return ng ? -ret : ret; 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; } static 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
Submission Info
Submission Time | |
---|---|
Task | E - Rotate 3x3 |
User | camypaper |
Language | C# (Mono 4.6.2.0) |
Score | 0 |
Code Size | 8220 Byte |
Status | WA |
Exec Time | 164 ms |
Memory | 25668 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 1500 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt, 1_55.txt, 1_56.txt, 1_57.txt, 1_58.txt, 1_59.txt, 1_60.txt, 1_61.txt, 1_62.txt, 1_63.txt, 1_64.txt, 1_65.txt, 1_66.txt, 1_67.txt, 1_68.txt, 1_69.txt, 1_70.txt, 1_71.txt, 1_72.txt, 1_73.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 23 ms | 11220 KB |
0_01.txt | AC | 24 ms | 13268 KB |
0_02.txt | AC | 22 ms | 9172 KB |
0_03.txt | AC | 22 ms | 9172 KB |
0_04.txt | AC | 24 ms | 13268 KB |
1_00.txt | AC | 148 ms | 23620 KB |
1_01.txt | AC | 147 ms | 23620 KB |
1_02.txt | AC | 146 ms | 21700 KB |
1_03.txt | AC | 146 ms | 23620 KB |
1_04.txt | AC | 148 ms | 23620 KB |
1_05.txt | AC | 147 ms | 23620 KB |
1_06.txt | AC | 155 ms | 21700 KB |
1_07.txt | AC | 146 ms | 23620 KB |
1_08.txt | AC | 147 ms | 25668 KB |
1_09.txt | AC | 146 ms | 23620 KB |
1_10.txt | WA | 23 ms | 11220 KB |
1_11.txt | AC | 23 ms | 13268 KB |
1_12.txt | WA | 22 ms | 9172 KB |
1_13.txt | AC | 23 ms | 11220 KB |
1_14.txt | WA | 23 ms | 11220 KB |
1_15.txt | AC | 23 ms | 11220 KB |
1_16.txt | AC | 22 ms | 9172 KB |
1_17.txt | AC | 23 ms | 11220 KB |
1_18.txt | WA | 23 ms | 11220 KB |
1_19.txt | AC | 23 ms | 11220 KB |
1_20.txt | AC | 23 ms | 11220 KB |
1_21.txt | AC | 22 ms | 9172 KB |
1_22.txt | AC | 23 ms | 11220 KB |
1_23.txt | AC | 22 ms | 9172 KB |
1_24.txt | AC | 23 ms | 11220 KB |
1_25.txt | AC | 23 ms | 9172 KB |
1_26.txt | AC | 150 ms | 23620 KB |
1_27.txt | WA | 150 ms | 23620 KB |
1_28.txt | WA | 152 ms | 25668 KB |
1_29.txt | AC | 149 ms | 21572 KB |
1_30.txt | WA | 149 ms | 21700 KB |
1_31.txt | AC | 149 ms | 23748 KB |
1_32.txt | WA | 160 ms | 21700 KB |
1_33.txt | AC | 150 ms | 23620 KB |
1_34.txt | WA | 149 ms | 23620 KB |
1_35.txt | AC | 159 ms | 25668 KB |
1_36.txt | WA | 152 ms | 25668 KB |
1_37.txt | AC | 160 ms | 23620 KB |
1_38.txt | WA | 148 ms | 21572 KB |
1_39.txt | WA | 149 ms | 23620 KB |
1_40.txt | AC | 149 ms | 25668 KB |
1_41.txt | AC | 149 ms | 25668 KB |
1_42.txt | WA | 147 ms | 23620 KB |
1_43.txt | AC | 149 ms | 23620 KB |
1_44.txt | AC | 153 ms | 23620 KB |
1_45.txt | AC | 148 ms | 21572 KB |
1_46.txt | WA | 149 ms | 25668 KB |
1_47.txt | AC | 147 ms | 23620 KB |
1_48.txt | AC | 148 ms | 23620 KB |
1_49.txt | AC | 148 ms | 23620 KB |
1_50.txt | AC | 159 ms | 23620 KB |
1_51.txt | AC | 144 ms | 23620 KB |
1_52.txt | AC | 148 ms | 21572 KB |
1_53.txt | AC | 150 ms | 23620 KB |
1_54.txt | WA | 148 ms | 23620 KB |
1_55.txt | AC | 146 ms | 21572 KB |
1_56.txt | AC | 150 ms | 23748 KB |
1_57.txt | AC | 150 ms | 21572 KB |
1_58.txt | AC | 148 ms | 23620 KB |
1_59.txt | AC | 149 ms | 21572 KB |
1_60.txt | AC | 148 ms | 23620 KB |
1_61.txt | AC | 149 ms | 23620 KB |
1_62.txt | AC | 149 ms | 23620 KB |
1_63.txt | WA | 144 ms | 25668 KB |
1_64.txt | AC | 148 ms | 23620 KB |
1_65.txt | WA | 149 ms | 23620 KB |
1_66.txt | AC | 149 ms | 23620 KB |
1_67.txt | AC | 147 ms | 23620 KB |
1_68.txt | AC | 149 ms | 23620 KB |
1_69.txt | AC | 149 ms | 21572 KB |
1_70.txt | AC | 149 ms | 23620 KB |
1_71.txt | AC | 151 ms | 23620 KB |
1_72.txt | WA | 148 ms | 23620 KB |
1_73.txt | WA | 164 ms | 21572 KB |