結果
| 問題 |
No.1017 Reiwa Sequence
|
| ユーザー |
 EmKjp
|
| 提出日時 | 2020-05-19 09:28:54 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,805 bytes |
| コンパイル時間 | 3,283 ms |
| コンパイル使用メモリ | 110,976 KB |
| 実行使用メモリ | 44,888 KB |
| 最終ジャッジ日時 | 2024-07-03 10:00:35 |
| 合計ジャッジ時間 | 34,542 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 WA * 1 |
| other | AC * 22 WA * 28 |
コンパイルメッセージ
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;
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[], long?[], int, int, long> dfs = null;
dfs = (v, array, pos, sum, used) => {
if (pos == v.Length) {
if (sum >= 0) {
array[sum] = used;
}
} else {
dfs(v, array, pos + 1, sum, used);
dfs(v, array, pos + 1, sum + v[pos], used | ((1L << (pos * 2))));
dfs(v, array, pos + 1, sum - v[pos], used | ((2L << (pos * 2))));
}
};
var a1 = a.Take(a.Length / 2).ToArray();
var a2 = a.Skip(a.Length / 2).ToArray();
var h1 = new long?[a1.Length * 150000 + 1];
var h2 = new long?[a2.Length * 150000 + 1];
dfs(a1, h1, 0, 0, 0);
dfs(a2, h2, 0, 0, 0);
for (int i = 0; i < h1.Length && i < h2.Length; i++) {
if (h1[i].HasValue && h2[i].HasValue) {
if (i == 0 && h1[i] == 0 && h2[i] == 0) continue;
var ans = new List<int>();
for (int j = 0; j < a1.Length; j++) {
if (((h1[i].Value & (1L << (j * 2))) != 0)) {
ans.Add(a1[j]);
} else if (((h1[i].Value & (2L << (j * 2))) != 0)) {
ans.Add(-a1[j]);
}
}
for (int j = 0; j < a2.Length; j++) {
if (((h2[i].Value & (1L << (j * 2))) != 0)) {
ans.Add(-a2[j]);
} else if (((h2[i].Value & (2L << (j * 2))) != 0)) {
ans.Add(a2[j]);
}
}
cout.WriteLine("Yes");
cout.WriteLine(string.Join(" ", ans.Concat(new int[n - ans.Count])));
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;
}
}
}