#931345 (D) No.1959 Prefix MinMax

• 問題: No.1959 Prefix MinMax
• ユーザー: 👑 hos.lyric
• 提出日時: 2023-11-25 10:21:24
• 言語: D (dmd 2.106.1)
• 結果: AC
• 実行時間: 52 ms / 2,000 ms
• コード長: 1,733 bytes
• コンパイル時間: 2,447 ms
• コンパイル使用メモリ: 109,184 KB
• 実行使用メモリ: 24,012 KB
• 平均クエリ数: 26.72
• 最終ジャッジ日時: 2023-11-25 10:21:31
• 合計ジャッジ時間: 5,573 ms
• ジャッジサーバーID （参考情報）: judge15 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	23 ms; 24,000 KB
testcase_01	AC	21 ms; 24,000 KB
testcase_02	AC	21 ms; 24,000 KB
testcase_03	AC	30 ms; 24,000 KB
testcase_04	AC	21 ms; 24,000 KB
testcase_05	AC	21 ms; 24,000 KB
testcase_06	AC	23 ms; 24,000 KB
testcase_07	AC	45 ms; 24,000 KB
testcase_08	AC	41 ms; 24,000 KB
testcase_09	AC	41 ms; 24,000 KB
testcase_10	AC	40 ms; 24,000 KB
testcase_11	AC	44 ms; 24,000 KB
testcase_12	AC	40 ms; 24,000 KB
testcase_13	AC	40 ms; 24,000 KB
testcase_14	AC	40 ms; 24,000 KB
testcase_15	AC	40 ms; 24,000 KB
testcase_16	AC	40 ms; 24,000 KB
testcase_17	AC	44 ms; 24,000 KB
testcase_18	AC	40 ms; 24,000 KB
testcase_19	AC	42 ms; 24,000 KB
testcase_20	AC	41 ms; 24,000 KB
testcase_21	AC	40 ms; 24,000 KB
testcase_22	AC	41 ms; 24,000 KB
testcase_23	AC	40 ms; 24,000 KB
testcase_24	AC	41 ms; 24,000 KB
testcase_25	AC	41 ms; 24,000 KB
testcase_26	AC	41 ms; 24,000 KB
testcase_27	AC	40 ms; 24,000 KB
testcase_28	AC	40 ms; 24,000 KB
testcase_29	AC	52 ms; 24,000 KB
testcase_30	AC	40 ms; 24,000 KB
testcase_31	AC	41 ms; 24,012 KB

ソースコード

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  const T = readInt;
  foreach (t; 0 .. T) {
    const N = readInt;
    auto P = new int[N];
    foreach (s; 0 .. 2) {
      write("?");
      foreach (i; 1 .. N) {
        write(" ", (s + i) & 1);
      }
      writeln;
      stdout.flush;
      auto B = new int[N];
      foreach (i; 0 .. N) {
        B[i] = readInt;
      }
      foreach (i; 0 .. N) if (i == 0 || B[i - 1] != B[i]) {
        P[i] = B[i];
      }
    }
    write("!");
    foreach (i; 0 .. N) {
      write(" ", P[i]);
    }
    writeln;
    stdout.flush;
  }
}