結果
問題 | No.359 門松行列 |
ユーザー | 紙ぺーぱー |
提出日時 | 2016-05-13 18:26:46 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 34 ms / 2,000 ms |
コード長 | 7,876 bytes |
コンパイル時間 | 1,086 ms |
コンパイル使用メモリ | 112,768 KB |
実行使用メモリ | 23,040 KB |
最終ジャッジ日時 | 2024-10-05 16:33:29 |
合計ジャッジ時間 | 1,922 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 26 ms
19,072 KB |
testcase_01 | AC | 26 ms
18,816 KB |
testcase_02 | AC | 25 ms
18,688 KB |
testcase_03 | AC | 31 ms
22,784 KB |
testcase_04 | AC | 28 ms
20,608 KB |
testcase_05 | AC | 29 ms
21,632 KB |
testcase_06 | AC | 26 ms
19,328 KB |
testcase_07 | AC | 29 ms
21,504 KB |
testcase_08 | AC | 34 ms
22,784 KB |
testcase_09 | AC | 33 ms
22,912 KB |
testcase_10 | AC | 34 ms
23,040 KB |
testcase_11 | AC | 32 ms
22,784 KB |
testcase_12 | AC | 31 ms
22,912 KB |
testcase_13 | AC | 33 ms
22,528 KB |
testcase_14 | AC | 31 ms
22,784 KB |
testcase_15 | AC | 27 ms
19,968 KB |
testcase_16 | AC | 31 ms
22,784 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Linq; using System.Diagnostics; using System.Collections.Generic; using Debug = System.Diagnostics.Debug; using StringBuilder = System.Text.StringBuilder; using System.Numerics; using Number = System.Int64; using Point = System.Numerics.Complex; namespace Program { //kore kirai public class Solver { public void Solve() { var T = sc.Integer(); for (int _ = 0; _ < T; _++) { var L = sc.Integer(); var a = Enumerate(3, x => sc.Integer(3)); var S = new List<int>(); for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) S.Add(a[i][j]); S.Add(L / 2); S = S.Distinct().ToList(); S.Sort(); var ans = 0L; for (int min = 1; min <= L / 2;) { var max = L - min; var cnt = 0; for (int i = 0; i < S.Count; i++) { if (S[i] == min) { cnt = 1; break; } if (min < S[i]) { cnt = S[i] - min; break; } if (S[i] == L / 2) break; } for (int i = S.Count - 1; i >= 0; i--) { if (S[i] == max) { cnt = 1; break; } if (max > S[i]) { cnt = Math.Min(cnt, max - S[i]); break; } } Debug.WriteLine("$$${0} {1} {2}$$$", min, max, cnt); for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) { if (a[i][j] != 0) continue; for (int k = 0; k < 3; k++) for (int l = 0; l < 3; l++) { if (i == k && j == l) continue; if (a[k][l] != 0) continue; a[i][j] = min; a[k][l] = max; if (chk(a)) { foreach (var x in a) Debug.WriteLine(x.AsJoinedString()); ans += cnt; } a[i][j] = 0; a[k][l] = 0; if (min == max) goto owari; } } owari: min += cnt; } IO.Printer.Out.WriteLine(ans); } } public bool chk(int[][] a) { var ok = true; for (int i = 0; i < 3; i++) ok &= check(a[i]); for (int i = 0; i < 3; i++) ok &= check(new int[] { a[0][i], a[1][i], a[2][i] }); ok &= check(new int[] { a[0][0], a[1][1], a[2][2] }); ok &= check(new int[] { a[0][2], a[1][1], a[2][0] }); return ok; } public bool check(int[] a) { return a.Distinct().Count() == 3 && ((a[0] > a[1] && a[1] < a[2]) || (a[0] < a[1] && a[1] > a[2])); } 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