結果

問題 No.2577 Simple Permutation Guess
ユーザー hitonanodehitonanode
提出日時 2023-12-05 00:07:41
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
QLE  
実行時間 -
コード長 7,489 bytes
コンパイル時間 2,236 ms
コンパイル使用メモリ 186,900 KB
実行使用メモリ 25,580 KB
平均クエリ数 251.96
最終ジャッジ日時 2024-09-26 23:25:08
合計ジャッジ時間 16,075 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 27 ms
24,812 KB
testcase_01 AC 124 ms
24,428 KB
testcase_02 AC 47 ms
24,556 KB
testcase_03 AC 25 ms
24,812 KB
testcase_04 AC 63 ms
24,812 KB
testcase_05 AC 71 ms
25,196 KB
testcase_06 AC 151 ms
25,196 KB
testcase_07 AC 151 ms
24,812 KB
testcase_08 AC 158 ms
24,812 KB
testcase_09 AC 152 ms
24,812 KB
testcase_10 AC 151 ms
25,196 KB
testcase_11 AC 26 ms
24,812 KB
testcase_12 AC 25 ms
24,812 KB
testcase_13 AC 27 ms
24,812 KB
testcase_14 AC 26 ms
24,812 KB
testcase_15 AC 25 ms
24,812 KB
testcase_16 AC 25 ms
25,196 KB
testcase_17 AC 25 ms
24,812 KB
testcase_18 AC 25 ms
25,136 KB
testcase_19 AC 25 ms
25,196 KB
testcase_20 AC 25 ms
24,812 KB
testcase_21 AC 25 ms
24,812 KB
testcase_22 AC 25 ms
24,580 KB
testcase_23 AC 25 ms
25,220 KB
testcase_24 QLE -
testcase_25 AC 25 ms
24,580 KB
testcase_26 AC 25 ms
24,836 KB
testcase_27 AC 25 ms
25,220 KB
testcase_28 AC 25 ms
25,220 KB
testcase_29 AC 25 ms
24,836 KB
testcase_30 AC 27 ms
24,836 KB
testcase_31 AC 25 ms
24,812 KB
testcase_32 AC 24 ms
24,812 KB
testcase_33 AC 25 ms
25,196 KB
testcase_34 AC 25 ms
25,196 KB
testcase_35 AC 25 ms
25,580 KB
testcase_36 AC 25 ms
25,196 KB
testcase_37 AC 25 ms
25,220 KB
testcase_38 AC 25 ms
24,836 KB
testcase_39 AC 24 ms
24,836 KB
testcase_40 AC 24 ms
24,836 KB
testcase_41 AC 25 ms
25,220 KB
testcase_42 AC 24 ms
24,836 KB
testcase_43 AC 25 ms
24,836 KB
testcase_44 AC 26 ms
25,220 KB
testcase_45 AC 24 ms
24,836 KB
testcase_46 AC 25 ms
24,836 KB
testcase_47 AC 24 ms
24,452 KB
testcase_48 AC 24 ms
24,836 KB
testcase_49 AC 24 ms
25,220 KB
testcase_50 AC 24 ms
24,452 KB
testcase_51 AC 24 ms
24,836 KB
testcase_52 AC 25 ms
25,220 KB
testcase_53 AC 24 ms
25,220 KB
testcase_54 AC 25 ms
24,836 KB
testcase_55 AC 25 ms
24,580 KB
testcase_56 AC 25 ms
25,220 KB
testcase_57 AC 26 ms
24,452 KB
testcase_58 AC 25 ms
24,836 KB
testcase_59 AC 26 ms
24,836 KB
testcase_60 AC 24 ms
24,836 KB
testcase_61 AC 24 ms
25,220 KB
testcase_62 AC 24 ms
24,836 KB
testcase_63 AC 25 ms
24,580 KB
testcase_64 AC 24 ms
24,836 KB
testcase_65 AC 25 ms
24,836 KB
testcase_66 AC 25 ms
24,452 KB
testcase_67 AC 25 ms
24,836 KB
testcase_68 AC 25 ms
25,460 KB
testcase_69 AC 24 ms
24,836 KB
testcase_70 AC 24 ms
25,220 KB
testcase_71 AC 26 ms
24,836 KB
testcase_72 AC 25 ms
24,836 KB
testcase_73 AC 25 ms
24,812 KB
testcase_74 AC 26 ms
25,196 KB
testcase_75 AC 26 ms
24,812 KB
testcase_76 AC 27 ms
25,196 KB
testcase_77 AC 25 ms
24,812 KB
testcase_78 AC 25 ms
25,040 KB
testcase_79 AC 26 ms
24,812 KB
testcase_80 AC 27 ms
25,196 KB
testcase_81 AC 28 ms
24,812 KB
testcase_82 AC 26 ms
24,812 KB
testcase_83 AC 27 ms
25,196 KB
testcase_84 AC 28 ms
24,556 KB
testcase_85 AC 28 ms
24,812 KB
testcase_86 AC 27 ms
24,812 KB
testcase_87 AC 26 ms
24,812 KB
testcase_88 AC 27 ms
24,812 KB
testcase_89 AC 27 ms
24,812 KB
testcase_90 AC 28 ms
24,812 KB
testcase_91 AC 28 ms
25,196 KB
testcase_92 AC 128 ms
25,196 KB
testcase_93 AC 118 ms
24,544 KB
testcase_94 AC 113 ms
24,812 KB
testcase_95 AC 147 ms
24,812 KB
testcase_96 AC 146 ms
24,556 KB
testcase_97 AC 137 ms
25,452 KB
testcase_98 AC 137 ms
25,196 KB
testcase_99 AC 142 ms
25,196 KB
testcase_100 AC 117 ms
25,040 KB
testcase_101 AC 138 ms
24,812 KB
evil_1_rnd_1.txt AC 262 ms
25,424 KB
evil_1_rnd_2.txt AC 265 ms
24,800 KB
evil_2_big_1.txt AC 328 ms
24,812 KB
evil_2_big_2.txt AC 323 ms
24,812 KB
evil_2_big_3.txt AC 327 ms
24,812 KB
evil_3_sorted_1.txt AC 184 ms
24,824 KB
evil_4_sorted_rev_1.txt AC 165 ms
24,580 KB
evil_4_sorted_rev_2.txt AC 225 ms
25,220 KB
evil_400_sorted.txt AC 303 ms
24,824 KB
evil_400_sorted_rev.txt AC 340 ms
25,208 KB
権限があれば一括ダウンロードができます

ソースコード

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 <memory>
#include <numeric>
#include <optional>
#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>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#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> 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; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class 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 <class 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 <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::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) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif


int main() {
    int N;
    cin >> N;

    vector<int> rem;
    REP(i, N) rem.push_back(i + 1);

    vector<int> ret;

    REP(pos, N) {
        int lo = 0, hi = rem.size();  // lo: ok, hi: ng
        while (hi - lo > 1) {
            const int mid = (lo + hi) / 2;
            auto q = ret;
            q.push_back(rem.at(mid));
            REP(i, rem.size()) {
                if (i != mid) q.push_back(rem.at(i));
            }

            cout << "?";
            for (int x : q) cout << " " << x;
            cout << endl;
            int resp;
            cin >> resp;
            assert(resp >= 0);
            if (resp == 1) {
                lo = mid;
            } else {
                hi = mid;
            }
        }
        ret.push_back(rem.at(lo));
        rem.erase(rem.begin() + lo);
    }
    cout << "!";
    for (int x : ret) cout << ' ' << x;
    cout << endl;
}
0