結果
| 問題 | No.282 おもりと天秤(2) |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2015-08-24 15:38:56 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 2,171 ms / 5,000 ms |
| コード長 | 5,870 bytes |
| コンパイル時間 | 1,188 ms |
| コンパイル使用メモリ | 111,616 KB |
| 実行使用メモリ | 39,648 KB |
| 平均クエリ数 | 267.12 |
| 最終ジャッジ日時 | 2024-07-16 21:12:51 |
| 合計ジャッジ時間 | 24,312 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 52 ms
34,656 KB |
| testcase_01 | AC | 60 ms
34,784 KB |
| testcase_02 | AC | 51 ms
35,040 KB |
| testcase_03 | AC | 51 ms
34,784 KB |
| testcase_04 | AC | 51 ms
34,784 KB |
| testcase_05 | AC | 57 ms
34,656 KB |
| testcase_06 | AC | 64 ms
35,040 KB |
| testcase_07 | AC | 52 ms
34,528 KB |
| testcase_08 | AC | 63 ms
34,912 KB |
| testcase_09 | AC | 51 ms
34,528 KB |
| testcase_10 | AC | 549 ms
39,648 KB |
| testcase_11 | AC | 2,035 ms
39,264 KB |
| testcase_12 | AC | 1,167 ms
39,648 KB |
| testcase_13 | AC | 1,410 ms
39,648 KB |
| testcase_14 | AC | 1,883 ms
39,392 KB |
| testcase_15 | AC | 2,092 ms
39,496 KB |
| testcase_16 | AC | 159 ms
37,472 KB |
| testcase_17 | AC | 1,320 ms
39,520 KB |
| testcase_18 | AC | 1,763 ms
39,648 KB |
| testcase_19 | AC | 1,741 ms
39,136 KB |
| testcase_20 | AC | 2,029 ms
39,512 KB |
| testcase_21 | AC | 2,171 ms
39,492 KB |
| testcase_22 | AC | 2,121 ms
39,092 KB |
| testcase_23 | AC | 47 ms
34,776 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;
namespace Program
{
public class Solver
{
/// <summary>
/// 分割統治
/// </summary>
public void Solve()
{
var n = int.Parse(Console.ReadLine());
var m = 1;
while (m < n) m <<= 1;
var a = new int[m];
for (int i = 0; i < n; i++)
a[i] = i + 1;
var cnt = new int[n];
for (int size = 1; size < m; size <<= 1)
{
for (int shift = 0; shift < size; shift++)
{
var q = new int[2 * n];
var p = 0;
for (int k = 0; k < n; k += size * 2)
{
for (int i = 0; i < size; i++)
{
var from = k + i;
var to = k + size + ((i + shift) % size);
q[p++] = a[from];
q[p++] = a[to];
}
}
Console.WriteLine("? {0}", q.AsJoinedString());
var res = Console.ReadLine().Split();
for (int i = 0; i < n; i++)
{
var l = i * 2;
var r = i * 2 + 1;
if (q[l] == 0 || q[r] == 0) continue;
if (res[i] == ">") cnt[q[l] - 1]++;
else if (res[i] == "<") cnt[q[r] - 1]++;
}
}
}
var ans = new int[n];
for (int i = 0; i < n; i++)
ans[cnt[i]] = i + 1;
Console.WriteLine("! {0}", ans.AsJoinedString());
}
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 != '-' && (b < '0' || '9' < b));
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() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
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