結果
| 問題 | No.624 Santa Claus and The Last Dungeon |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2017-12-15 00:08:23 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,187 bytes |
| コンパイル時間 | 2,681 ms |
| コンパイル使用メモリ | 115,024 KB |
| 実行使用メモリ | 46,712 KB |
| 平均クエリ数 | 1.00 |
| 最終ジャッジ日時 | 2023-09-23 15:13:44 |
| 合計ジャッジ時間 | 13,508 ms |
|
ジャッジサーバーID （参考情報） |
judge14 / judge13 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
| testcase_23 | WA | - |
| testcase_24 | WA | - |
| testcase_25 | WA | - |
| testcase_26 | WA | - |
| testcase_27 | WA | - |
| testcase_28 | WA | - |
| testcase_29 | WA | - |
| testcase_30 | WA | - |
| testcase_31 | WA | - |
| testcase_32 | WA | - |
| testcase_33 | WA | - |
| testcase_34 | WA | - |
| testcase_35 | WA | - |
コンパイルメッセージ
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 Debug = System.Diagnostics.Debug;
//using System.Numerics;
//using static System.Math;
using Number = System.Int64;
namespace Program {
public class Solver {
const bool DEBUG = true;
int[] p;
char[][] P;
Random rnd = new Random();
int cnt;
int n = DEBUG ? 100 : 100;
public void Solve() {
if (DEBUG) {
p = Enumerate(n, x => x).OrderBy(x => rnd.Next()).ToArray();
P = Enumerate(n, x => new char[2]);
for (int i = 0; i < n; i++) {
P[i][0] = (char)(p[i] / 10 + '0');
P[i][1] = (char)(p[i] % 10 + '0');
}
}
var q = DEBUG ? 550 : int.Parse(Console.ReadLine());
solve(0, n, new Stack<int>(Enumerate(n, x => x)));
query(ans);
Debug.WriteLine(cnt);
Debug.WriteLine(ans.AsJoinedString());
}
int[] ans = new int[100];
void solve(int l, int r, Stack<int> a) {
if (r - l == 1) { ans[l] = a.Pop(); return; }
a = new Stack<int>(a.OrderBy(x => rnd.Next()));
var L = new Stack<int>();
var R = new Stack<int>();
var m = (l + r) / 2;
while (l + L.Count != m && m + R.Count != r) {
var p = a.Pop();
var q = a.Pop();
var b = Enumerate(n, x => -1);
for (int i = l; i < r; i++)
b[i] = i < m ? p : q;
var res = query(b);
if (res[2] == 0 || res[2] == 2) {
if (res[2] == 0) Swap(ref p, ref q);
L.Push(p);
R.Push(q);
}
else {
b = Enumerate(n, x => -1);
for (int i = l; i < m; i++)
b[i] = p;
res = query(b);
if (res[2] == 1) { L.Push(p); L.Push(q); }
else { R.Push(p); R.Push(q); }
}
}
while (l + L.Count != m) L.Push(a.Pop());
while (m + R.Count != r) R.Push(a.Pop());
solve(l, m, L);
solve(m, r, R);
}
int[] query(int[] a) {
cnt++;
if (!DEBUG)
for (int i = 0; i < a.Length; i++) {
if (a[i] != -1)
Console.Write($"{a[i] / 10}{a[i] % 10}");
else Console.Write($"??");
if (i + 1 != a.Length) Console.Write(" ");
else Console.WriteLine();
}
Console.Out.Flush();
int[] res;
if (DEBUG) return check(a.Select(x => x == -1 ? "??" : $"{x / 10}{x % 10}").ToArray());
res = Console.ReadLine().Split().Select(int.Parse).ToArray();
return res;
}
int[] check(string[] a) {
var ret = new int[3];
for (int i = 0; i < a.Length; i++) {
ret[Enumerable.Range(0, 2).Count(x => P[i][x] == a[i][x])]++;
}
return ret;
}
const long INF = 1L << 60;
int[] dx = { 1, 0, -1, 0 };
int[] dy = { 0, 1, 0, -1 };
//*
int ri { get { return sc.Integer(); } }
long rl { get { return sc.Long(); } }
double rd { get { return sc.Double(); } }
string rs { get { return sc.Scan(); } }
//*/
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(ie.ToArray()); }
static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") {
return string.Join(st, ie.Select(x => x.ToString()).ToArray());
//return string.Join(st, ie);
}
static public void Main() {
Console.SetOut(new System.IO.StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
var solver = new Program.Solver();
solver.Solve();
Console.Out.Flush();
}
}
#endregion
#region Ex
namespace Program.IO {
using System.Globalization;
using System.IO;
using System.Text;
public class Printer: StreamWriter {
public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
}
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 != 0; b = (char)read())
if (b != '\r') sb.Append(b);
return sb.ToString();
}
public long Long() { return isEof ? long.MinValue : long.Parse(Scan()); }
public int Integer() { return isEof ? int.MinValue : int.Parse(Scan()); }
public double Double() { return isEof ? double.NaN : double.Parse(Scan(), CultureInfo.InvariantCulture); }
}
}
#endregion