#937755 (C++17) No.2577 Simple Permutation Guess

提出ソース

結果

問題	No.2577 Simple Permutation Guess
ユーザー	siganai
提出日時	2023-12-10 12:51:18
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	QLE
実行時間	-
コード長	5,119 bytes
コンパイル時間	2,521 ms
コンパイル使用メモリ	208,080 KB
実行使用メモリ	24,012 KB
平均クエリ数	251.96
最終ジャッジ日時	2023-12-10 12:51:37
合計ジャッジ時間	16,268 ms
ジャッジサーバーID （参考情報）	judge11 / judge12

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	28 ms 24,000 KB
testcase_01	AC	121 ms 24,000 KB
testcase_02	AC	46 ms 24,000 KB
testcase_03	AC	23 ms 24,000 KB
testcase_04	AC	61 ms 24,000 KB
testcase_05	AC	68 ms 24,000 KB
testcase_06	AC	172 ms 24,000 KB
testcase_07	AC	144 ms 24,000 KB
testcase_08	AC	145 ms 24,000 KB
testcase_09	AC	145 ms 24,000 KB
testcase_10	AC	146 ms 24,000 KB
testcase_11	AC	25 ms 24,000 KB
testcase_12	AC	24 ms 24,000 KB
testcase_13	AC	27 ms 24,000 KB
testcase_14	AC	24 ms 24,000 KB
testcase_15	AC	25 ms 24,000 KB
testcase_16	AC	26 ms 24,000 KB
testcase_17	AC	24 ms 24,000 KB
testcase_18	AC	38 ms 24,000 KB
testcase_19	AC	26 ms 24,000 KB
testcase_20	AC	27 ms 24,000 KB
testcase_21	AC	30 ms 24,000 KB
testcase_22	AC	23 ms 24,012 KB
testcase_23	AC	23 ms 24,012 KB
testcase_24	QLE	-
testcase_25	AC	24 ms 24,012 KB
testcase_26	AC	24 ms 24,012 KB
testcase_27	AC	23 ms 24,012 KB
testcase_28	AC	23 ms 24,012 KB
testcase_29	AC	24 ms 24,012 KB
testcase_30	AC	31 ms 24,012 KB
testcase_31	AC	23 ms 24,000 KB
testcase_32	AC	23 ms 24,000 KB
testcase_33	AC	22 ms 24,000 KB
testcase_34	AC	22 ms 24,000 KB
testcase_35	AC	23 ms 24,000 KB
testcase_36	AC	23 ms 24,000 KB
testcase_37	AC	23 ms 24,000 KB
testcase_38	AC	22 ms 24,000 KB
testcase_39	AC	23 ms 24,000 KB
testcase_40	AC	23 ms 24,000 KB
testcase_41	AC	22 ms 24,000 KB
testcase_42	AC	23 ms 24,000 KB
testcase_43	AC	23 ms 24,000 KB
testcase_44	AC	27 ms 24,000 KB
testcase_45	AC	24 ms 24,000 KB
testcase_46	AC	23 ms 24,000 KB
testcase_47	AC	23 ms 24,000 KB
testcase_48	AC	24 ms 24,000 KB
testcase_49	AC	24 ms 24,000 KB
testcase_50	AC	23 ms 24,000 KB
testcase_51	AC	23 ms 24,000 KB
testcase_52	AC	22 ms 24,000 KB
testcase_53	AC	23 ms 24,000 KB
testcase_54	AC	24 ms 24,000 KB
testcase_55	AC	25 ms 24,000 KB
testcase_56	AC	26 ms 24,000 KB
testcase_57	AC	25 ms 24,000 KB
testcase_58	AC	25 ms 24,000 KB
testcase_59	AC	26 ms 24,000 KB
testcase_60	AC	26 ms 24,000 KB
testcase_61	AC	22 ms 24,000 KB
testcase_62	AC	23 ms 24,000 KB
testcase_63	AC	32 ms 24,000 KB
testcase_64	AC	24 ms 24,012 KB
testcase_65	AC	23 ms 24,012 KB
testcase_66	AC	23 ms 24,012 KB
testcase_67	AC	23 ms 24,012 KB
testcase_68	AC	24 ms 24,012 KB
testcase_69	AC	23 ms 24,012 KB
testcase_70	AC	22 ms 24,012 KB
testcase_71	AC	23 ms 24,012 KB
testcase_72	AC	27 ms 24,012 KB
testcase_73	AC	26 ms 24,000 KB
testcase_74	AC	28 ms 24,000 KB
testcase_75	AC	25 ms 24,000 KB
testcase_76	AC	25 ms 24,000 KB
testcase_77	AC	25 ms 24,000 KB
testcase_78	AC	25 ms 24,000 KB
testcase_79	AC	25 ms 24,000 KB
testcase_80	AC	25 ms 24,000 KB
testcase_81	AC	28 ms 24,000 KB
testcase_82	AC	29 ms 24,000 KB
testcase_83	AC	26 ms 24,000 KB
testcase_84	AC	28 ms 24,000 KB
testcase_85	AC	25 ms 24,000 KB
testcase_86	AC	25 ms 24,000 KB
testcase_87	AC	25 ms 24,012 KB
testcase_88	AC	41 ms 24,012 KB
testcase_89	AC	26 ms 24,012 KB
testcase_90	AC	26 ms 24,012 KB
testcase_91	AC	26 ms 24,012 KB
testcase_92	AC	122 ms 24,012 KB
testcase_93	AC	111 ms 24,012 KB
testcase_94	AC	110 ms 24,012 KB
testcase_95	AC	139 ms 24,012 KB
testcase_96	AC	140 ms 24,012 KB
testcase_97	AC	133 ms 24,012 KB
testcase_98	AC	131 ms 24,012 KB
testcase_99	AC	137 ms 24,012 KB
testcase_100	AC	133 ms 24,012 KB
testcase_101	AC	132 ms 24,012 KB
evil_1_rnd_1.txt	AC	255 ms 24,012 KB
evil_1_rnd_2.txt	AC	268 ms 24,012 KB
evil_2_big_1.txt	AC	330 ms 24,012 KB
evil_2_big_2.txt	AC	334 ms 24,012 KB
evil_2_big_3.txt	AC	313 ms 24,012 KB
evil_3_sorted_1.txt	AC	175 ms 24,012 KB
evil_4_sorted_rev_1.txt	AC	159 ms 24,012 KB
evil_4_sorted_rev_2.txt	AC	243 ms 24,012 KB
evil_400_sorted.txt	AC	291 ms 24,012 KB
evil_400_sorted_rev.txt	AC	330 ms 24,012 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

//#pragma GCC target("avx,avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){return *min_element(all(a));}
template<class T> auto max(const T& a){return *max_element(all(a));}
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll GCD(ll a,ll b) { if(a == 0 || b == 0) return 0; if(a % b == 0) return b; else return GCD(b,a%b);}
ll LCM(ll a,ll b) { if(a == 0) return b; if(b == 0) return a;return a / GCD(a,b) * b;}
void Yes() {cout << "Yes\n";return;}
void No() {cout << "No\n";return;}
void YES() {cout << "YES\n";return;}
void NO() {cout << "NO\n";return;}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});} 
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }

#undef unpack
static const double PI = 3.1415926535897932;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};

constexpr int mod = 998244353;
//constexpr int mod = 1000000007;

int main() {
    INT(n);
    vi v(n);
    iota(all(v),1);
    vi ans;
    auto ask = [](vi &a) {
        cout << "?";
        rep(i,a.size()) {
            cout << " " << a[i];
        }
        cout << endl;
        INT(x);
        return x;
    };
    rep(i,n) {
        int L = 0,R = v.size();
        while(R - L > 1) {
            int mid = (R + L) / 2;
            vi tmp = ans;
            tmp.emplace_back(v[mid]);
            rep(j,v.size()) {
                if(j == mid) continue;
                tmp.emplace_back(v[j]);
            }
            int flg = ask(tmp);
            if(flg == 1) L = mid;
            else R = mid;
        }
        ans.emplace_back(v[L]);
        vi nv;
        rep(j,v.size()) {
            if(j == L) continue;
            nv.emplace_back(v[j]);
        }
        swap(v,nv);
    }
    cout << "!";
    rep(i,n) cout << " " << ans[i];
    cout << endl;
}

yukicoder

結果

テストケース

ソースコード