結果

問題 No.1959 Prefix MinMax
ユーザー 👑 hitonanodehitonanode
提出日時 2022-08-04 01:26:18
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 7,661 bytes
コンパイル時間 1,879 ms
コンパイル使用メモリ 181,200 KB
実行使用メモリ 24,480 KB
平均クエリ数 40.59
最終ジャッジ日時 2023-10-11 21:07:29
合計ジャッジ時間 10,577 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 29 ms
23,424 KB
testcase_01 AC 28 ms
23,412 KB
testcase_02 AC 25 ms
23,628 KB
testcase_03 AC 26 ms
24,060 KB
testcase_04 AC 27 ms
24,300 KB
testcase_05 AC 29 ms
24,084 KB
testcase_06 AC 27 ms
23,688 KB
testcase_07 AC 91 ms
23,400 KB
testcase_08 RE -
testcase_09 RE -
testcase_10 AC 90 ms
23,544 KB
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 RE -
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
testcase_26 RE -
testcase_27 RE -
testcase_28 RE -
testcase_29 RE -
testcase_30 RE -
testcase_31 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl : cerr)
#else
#define dbg(x) 0
#define dbgif(cond, x) 0
#endif

struct rand_int_ {
    using lint = long long;
    std::mt19937 mt;
    rand_int_() : mt(std::chrono::steady_clock::now().time_since_epoch().count()) {}
    lint operator()(lint x) { return this->operator()(0, x); } // [0, x)
    lint operator()(lint l, lint r) {
        std::uniform_int_distribution<lint> d(l, r - 1);
        return d(mt);
    }
} rnd;

vector<int> ask(const vector<int> &A) {
    cout << '?';
    for (auto x : A) cout << ' ' << x;
    cout << endl;
    vector<int> ret(A.size() + 1);
    cin >> ret;
    return ret;
}

void answer(const vector<int> &P) {
    cout << '!';
    for (auto x : P) cout << ' ' << x;
    cout << endl;
}

void solve() {
    int N;
    cin >> N;

    vector<int> ret(N);

    vector<int> lo(N, 1), hi(N, N);
    set<int> fixed;
    REP(_, 10) {
        vector<int> q(N - 1);
        for (auto &x : q) x = rnd(2);
        FOR(i, 1, N) {
            if (i >= 2 and ret.at(i - 2) and ret.at(i - 1) and !ret.at(i)) {
                if (ret.at(i - 2) > ret.at(i - 1)) {
                    if (i >= 3) q.at(i - 3) = 1;
                    q.at(i - 2) = 0;
                } else {
                    if (i >= 3) q.at(i - 3) = 0;
                    q.at(i - 2) = 1;
                }
            }
            if (hi.at(i) == ret.at(i - 1)) q.at(i - 1) = 0;
            if (lo.at(i) == ret.at(i - 1)) q.at(i - 1) = 1;
        }
        vector<int> P0 = ask(q);
        REP(i, N) {
            if (i == 0 or P0.at(i) != P0.at(i - 1)) {
                if (ret.at(i)) assert(ret.at(i) == P0.at(i));
                ret.at(i) = lo.at(i) = hi.at(i) = P0.at(i);
                fixed.insert(ret.at(i));
                if (i) {
                    if (q.at(i - 1)) {
                        chmin(hi.at(i), P0.at(i));
                    } else {
                        chmax(lo.at(i), P0.at(i));
                    }
                }
            }
        }

        while (true) {
            bool updated = false;
            REP(i, N) {
                if (ret.at(i)) continue;
                while (fixed.count(lo.at(i))) ++lo.at(i);
                while (fixed.count(hi.at(i))) --hi.at(i);
                assert(lo.at(i) <= hi.at(i));
                if (lo.at(i) == hi.at(i)) {
                    updated = true;
                    ret.at(i) = lo.at(i);
                    fixed.insert(ret.at(i));
                }
            }

            if (!updated) break;
        }
    }
    REP(i, N) {
        if (!ret.at(i)) ret.at(i) = lo.at(i);
    }
    answer(ret);
}

int main() {
    int T;
    cin >> T;
    while (T--) solve();
}
0