結果
問題 | No.1017 Reiwa Sequence |
ユーザー | EmKjp |
提出日時 | 2020-05-19 08:55:51 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 1,185 ms / 2,000 ms |
コード長 | 6,423 bytes |
コンパイル時間 | 2,030 ms |
コンパイル使用メモリ | 64,608 KB |
実行使用メモリ | 226,300 KB |
最終ジャッジ日時 | 2023-09-16 08:40:15 |
合計ジャッジ時間 | 54,939 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 185 ms
62,232 KB |
testcase_01 | AC | 143 ms
54,164 KB |
testcase_02 | AC | 98 ms
30,652 KB |
testcase_03 | AC | 302 ms
81,248 KB |
testcase_04 | AC | 98 ms
37,368 KB |
testcase_05 | AC | 161 ms
46,160 KB |
testcase_06 | AC | 157 ms
46,068 KB |
testcase_07 | AC | 98 ms
30,672 KB |
testcase_08 | AC | 98 ms
30,592 KB |
testcase_09 | AC | 424 ms
106,144 KB |
testcase_10 | AC | 831 ms
204,732 KB |
testcase_11 | AC | 414 ms
107,088 KB |
testcase_12 | AC | 938 ms
226,300 KB |
testcase_13 | AC | 933 ms
226,196 KB |
testcase_14 | AC | 420 ms
105,116 KB |
testcase_15 | AC | 449 ms
112,032 KB |
testcase_16 | AC | 418 ms
107,168 KB |
testcase_17 | AC | 579 ms
140,296 KB |
testcase_18 | AC | 416 ms
107,008 KB |
testcase_19 | AC | 1,185 ms
206,340 KB |
testcase_20 | AC | 1,150 ms
206,340 KB |
testcase_21 | AC | 1,169 ms
206,368 KB |
testcase_22 | AC | 1,157 ms
206,792 KB |
testcase_23 | AC | 1,146 ms
206,512 KB |
testcase_24 | AC | 1,144 ms
206,428 KB |
testcase_25 | AC | 1,129 ms
206,560 KB |
testcase_26 | AC | 1,060 ms
206,612 KB |
testcase_27 | AC | 900 ms
206,512 KB |
testcase_28 | AC | 912 ms
206,508 KB |
testcase_29 | AC | 894 ms
204,844 KB |
testcase_30 | AC | 863 ms
206,508 KB |
testcase_31 | AC | 883 ms
204,296 KB |
testcase_32 | AC | 874 ms
204,316 KB |
testcase_33 | AC | 832 ms
206,860 KB |
testcase_34 | AC | 833 ms
204,340 KB |
testcase_35 | AC | 998 ms
206,340 KB |
testcase_36 | AC | 847 ms
206,428 KB |
testcase_37 | AC | 839 ms
206,516 KB |
testcase_38 | AC | 1,011 ms
206,500 KB |
testcase_39 | AC | 864 ms
204,352 KB |
testcase_40 | AC | 924 ms
201,144 KB |
testcase_41 | AC | 927 ms
199,332 KB |
testcase_42 | AC | 911 ms
199,760 KB |
testcase_43 | AC | 918 ms
201,380 KB |
testcase_44 | AC | 930 ms
201,216 KB |
testcase_45 | AC | 925 ms
201,584 KB |
testcase_46 | AC | 911 ms
199,452 KB |
testcase_47 | AC | 905 ms
201,724 KB |
testcase_48 | AC | 944 ms
202,944 KB |
testcase_49 | AC | 928 ms
204,844 KB |
testcase_50 | AC | 948 ms
203,480 KB |
testcase_51 | AC | 78 ms
33,784 KB |
testcase_52 | AC | 865 ms
206,408 KB |
testcase_53 | AC | 1,087 ms
204,336 KB |
ソースコード
using System; using System.Collections; using System.Collections.Generic; using System.Diagnostics; using System.Globalization; using System.IO; using System.Text; using System.Linq; using E = System.Linq.Enumerable; using System.Text.RegularExpressions; internal partial class Solver { public void Run() { var n = ni(); var a = ni(n).Take(22).ToArray(); Action<int, int, int> dfs = null; var list = Enumerable.Range(0, a.Length * 150000 + 1).Select(_ => new List<int>()).ToArray(); var ok = false; dfs = (pos, sum, used) => { if (ok) return; if (pos == a.Length) { if (used > 0) { list[sum].Add(used); if (list[sum].Count >= 2) ok = true; } } else { dfs(pos + 1, sum + a[pos], used | 1 << pos); dfs(pos + 1, sum, used); } }; dfs(0, 0, 0); for (int i = 0; i < list.Length; i++) { if (list[i].Count >= 2) { var b1 = list[i][0]; var b2 = list[i][1]; var common = b1 & b2; b1 ^= common; b2 ^= common; var ans = new List<int>(); for (int j = 0; j < a.Length; j++) { if ((b1 & (1 << j)) != 0) { ans.Add(a[j]); } else if ((b2 & (1 << j)) != 0) { ans.Add(-a[j]); } else { ans.Add(0); } } cout.WriteLine("Yes"); cout.WriteLine(string.Join(" ", ans.Concat(new int[n - a.Length]))); return; } } cout.WriteLine("No"); } } // PREWRITEN CODE BEGINS FROM HERE internal partial class Solver : Scanner { public static void Main() { #if LOCAL byte[] inputBuffer = new byte[1000000]; var inputStream = Console.OpenStandardInput(inputBuffer.Length); using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) { Console.SetIn(reader); new Solver(Console.In, Console.Out).Run(); } #else Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }); new Solver(Console.In, Console.Out).Run(); Console.Out.Flush(); #endif } #pragma warning disable IDE0052 private readonly TextReader cin; private readonly TextWriter cout; #pragma warning restore IDE0052 public Solver(TextReader reader, TextWriter writer) : base(reader) { cin = reader; cout = writer; } public Solver(string input, TextWriter writer) : this(new StringReader(input), writer) { } #pragma warning disable IDE1006 #pragma warning disable IDE0051 private int ni() { return NextInt(); } private int[] ni(int n) { return NextIntArray(n); } private long nl() { return NextLong(); } private long[] nl(int n) { return NextLongArray(n); } private double nd() { return NextDouble(); } private double[] nd(int n) { return NextDoubleArray(n); } private string ns() { return Next(); } private string[] ns(int n) { return NextArray(n); } #pragma warning restore IDE1006 #pragma warning restore IDE0051 } internal static class LinqPadExtension { [Conditional("DEBUG")] public static void Dump<T>(this T obj) { #if DEBUG LINQPad.Extensions.Dump(obj); #endif } } public class Scanner { private readonly TextReader Reader; private readonly CultureInfo ci = CultureInfo.InvariantCulture; private readonly char[] buffer = new char[2 * 1024]; private int cursor = 0, length = 0; private string Token; private readonly StringBuilder sb = new StringBuilder(1024); public Scanner() : this(Console.In) { } public Scanner(TextReader reader) { Reader = reader; } public int NextInt() { return checked((int)NextLong()); } public long NextLong() { var s = Next(); long r = 0; int i = 0; bool negative = false; if (s[i] == '-') { negative = true; i++; } for (; i < s.Length; i++) { r = r * 10 + (s[i] - '0'); #if DEBUG if (!char.IsDigit(s[i])) throw new FormatException(); #endif } return negative ? -r : r; } public double NextDouble() { return double.Parse(Next(), ci); } public string[] NextArray(int size) { string[] array = new string[size]; for (int i = 0; i < size; i++) { array[i] = Next(); } return array; } public int[] NextIntArray(int size) { int[] array = new int[size]; for (int i = 0; i < size; i++) { array[i] = NextInt(); } return array; } public long[] NextLongArray(int size) { long[] array = new long[size]; for (int i = 0; i < size; i++) { array[i] = NextLong(); } return array; } public double[] NextDoubleArray(int size) { double[] array = new double[size]; for (int i = 0; i < size; i++) { array[i] = NextDouble(); } return array; } public string Next() { if (Token == null) { if (!StockToken()) { throw new Exception(); } } var token = Token; Token = null; return token; } public bool HasNext() { if (Token != null) { return true; } return StockToken(); } private bool StockToken() { while (true) { sb.Clear(); while (true) { if (cursor >= length) { cursor = 0; if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) { break; } } var c = buffer[cursor++]; if (33 <= c && c <= 126) { sb.Append(c); } else { if (sb.Length > 0) break; } } if (sb.Length > 0) { Token = sb.ToString(); return true; } return false; } } }