結果

問題 No.282 おもりと天秤(2)
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-08-23 16:35:11
言語 C#(csc)
(csc 3.9.0)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 6,956 bytes
コンパイル時間 2,589 ms
コンパイル使用メモリ 112,592 KB
実行使用メモリ 44,304 KB
平均クエリ数 432.96
最終ジャッジ日時 2023-09-23 21:23:31
合計ジャッジ時間 37,745 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 86 ms
39,184 KB
testcase_01 AC 94 ms
37,792 KB
testcase_02 AC 87 ms
35,692 KB
testcase_03 AC 85 ms
37,860 KB
testcase_04 AC 84 ms
37,636 KB
testcase_05 AC 88 ms
37,688 KB
testcase_06 AC 99 ms
37,316 KB
testcase_07 AC 88 ms
37,748 KB
testcase_08 AC 106 ms
35,576 KB
testcase_09 AC 83 ms
37,192 KB
testcase_10 AC 855 ms
41,884 KB
testcase_11 AC 2,711 ms
40,184 KB
testcase_12 AC 961 ms
42,104 KB
testcase_13 AC 1,442 ms
43,680 KB
testcase_14 AC 2,381 ms
44,304 KB
testcase_15 AC 2,891 ms
43,612 KB
testcase_16 AC 247 ms
42,028 KB
testcase_17 AC 1,325 ms
44,148 KB
testcase_18 AC 2,273 ms
42,124 KB
testcase_19 AC 2,269 ms
44,028 KB
testcase_20 AC 3,198 ms
43,808 KB
testcase_21 AC 3,149 ms
40,088 KB
testcase_22 AC 2,795 ms
44,140 KB
testcase_23 TLE -
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

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
    {
        public void Solve()
        {
            var n = int.Parse(Console.ReadLine());
            var m = 1;
            while (m < n) m <<= 1;
            var a = new int?[m << 1];
            var cnt = new int[m << 1];
            for (int i = 0; i < n; i++)
            {
                a[i + m] = i + 1;
                cnt[i + m] = 1;
            }
            for (int i = m - 1; i >= 1; i--)
                cnt[i] = cnt[i * 2] + cnt[i * 2 + 1];
            var ans = new List<int>();
            while (ans.Count < n)
            {
                var q = new int[2 * n];
                var pass = new int[a.Length];
                var p = 0;

                for (int i = m - 1; i >= 1; i--)
                {
                    int l = i * 2, r = i * 2 + 1;
                    if (a[i] != null)
                    {
                        if (i == 1 && ((a[l].HasValue && a[r].HasValue) || cnt[l] == 0 || cnt[r] == 0)) ;
                        else { pass[i] = -1; continue; }

                    }
                    if (a[l] == null && a[r] == null) { pass[i] = 3; continue; }
                    else if (a[l] == null) { pass[i] = 2; continue; }
                    else if (a[r] == null) { pass[i] = 1; continue; }
                    q[p++] = a[l].Value;
                    q[p++] = a[r].Value;
                    pass[i] = 4;
                }
                string[] res = null;
                if (p != 0)
                {
                    Console.WriteLine("? {0}", q.AsJoinedString());
                    res = Console.ReadLine().Split();
                    p = 0;
                }
                for (int i = m - 1; i >= 1; i--)
                {
                    int l = i * 2, r = i * 2 + 1;
                    if (pass[i] == -1) ;
                    else if (pass[i] == 3) ;
                    else if (pass[i] == 2) { a[i] = a[r]; a[r] = null; cnt[r]--; }
                    else if (pass[i] == 1) { a[i] = a[l]; a[l] = null; cnt[l]--; }
                    else if (pass[i] == 4)
                    {
                        if (res[p] == "<") { a[i] = a[l]; a[l] = null; cnt[l]--; }
                        else if (res[p] == ">") { a[i] = a[r]; a[r] = null; cnt[r]--; }
                        else throw new Exception();
                        p++;
                    }
                    else throw new Exception();

                    if (i == 1 && a[i].HasValue)
                    {
                        if (ans.Count == 0 || ans.Last() != a[i].Value)
                            ans.Add(a[i].Value);
                    }

                }
                Debug.WriteLine(a.Select(x => x ?? -1).AsJoinedString());

            }
            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
0