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

提出ソース

結果

問題	No.2577 Simple Permutation Guess
ユーザー	apricity
提出日時	2023-12-06 18:37:14
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	4,298 bytes
コンパイル時間	2,359 ms
コンパイル使用メモリ	181,308 KB
実行使用メモリ	24,012 KB
平均クエリ数	251.34
最終ジャッジ日時	2023-12-06 18:37:32
合計ジャッジ時間	15,934 ms
ジャッジサーバーID （参考情報）	judge13 / judge11

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	WA	-
testcase_01	AC	122 ms 24,000 KB
testcase_02	AC	48 ms 24,000 KB
testcase_03	AC	24 ms 24,000 KB
testcase_04	AC	62 ms 24,000 KB
testcase_05	AC	71 ms 24,000 KB
testcase_06	AC	151 ms 24,000 KB
testcase_07	AC	150 ms 24,000 KB
testcase_08	AC	151 ms 24,000 KB
testcase_09	AC	152 ms 24,000 KB
testcase_10	AC	161 ms 24,000 KB
testcase_11	AC	26 ms 24,000 KB
testcase_12	WA	-
testcase_13	AC	27 ms 24,000 KB
testcase_14	AC	27 ms 24,000 KB
testcase_15	AC	24 ms 24,000 KB
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-
testcase_36	WA	-
testcase_37	AC	25 ms 24,000 KB
testcase_38	WA	-
testcase_39	AC	26 ms 24,000 KB
testcase_40	WA	-
testcase_41	WA	-
testcase_42	WA	-
testcase_43	WA	-
testcase_44	WA	-
testcase_45	WA	-
testcase_46	WA	-
testcase_47	WA	-
testcase_48	WA	-
testcase_49	WA	-
testcase_50	WA	-
testcase_51	WA	-
testcase_52	WA	-
testcase_53	WA	-
testcase_54	WA	-
testcase_55	WA	-
testcase_56	WA	-
testcase_57	WA	-
testcase_58	WA	-
testcase_59	WA	-
testcase_60	WA	-
testcase_61	WA	-
testcase_62	WA	-
testcase_63	WA	-
testcase_64	WA	-
testcase_65	WA	-
testcase_66	WA	-
testcase_67	WA	-
testcase_68	WA	-
testcase_69	WA	-
testcase_70	WA	-
testcase_71	WA	-
testcase_72	WA	-
testcase_73	WA	-
testcase_74	AC	26 ms 24,000 KB
testcase_75	AC	27 ms 24,000 KB
testcase_76	AC	26 ms 24,000 KB
testcase_77	AC	26 ms 24,000 KB
testcase_78	AC	26 ms 24,000 KB
testcase_79	AC	27 ms 24,000 KB
testcase_80	AC	26 ms 24,000 KB
testcase_81	AC	26 ms 24,000 KB
testcase_82	AC	26 ms 24,000 KB
testcase_83	AC	26 ms 24,000 KB
testcase_84	AC	26 ms 24,000 KB
testcase_85	AC	26 ms 24,000 KB
testcase_86	AC	27 ms 24,000 KB
testcase_87	AC	26 ms 24,012 KB
testcase_88	AC	27 ms 24,012 KB
testcase_89	AC	27 ms 24,012 KB
testcase_90	AC	27 ms 24,012 KB
testcase_91	AC	27 ms 24,012 KB
testcase_92	AC	126 ms 24,012 KB
testcase_93	AC	115 ms 24,012 KB
testcase_94	AC	110 ms 24,012 KB
testcase_95	AC	144 ms 24,012 KB
testcase_96	AC	148 ms 24,012 KB
testcase_97	AC	138 ms 24,012 KB
testcase_98	AC	136 ms 24,012 KB
testcase_99	AC	142 ms 24,012 KB
testcase_100	AC	118 ms 24,012 KB
testcase_101	AC	136 ms 24,012 KB
evil_1_rnd_1.txt	AC	263 ms 24,012 KB
evil_1_rnd_2.txt	AC	265 ms 24,012 KB
evil_2_big_1.txt	AC	324 ms 24,012 KB
evil_2_big_2.txt	AC	323 ms 24,012 KB
evil_2_big_3.txt	AC	349 ms 24,012 KB
evil_3_sorted_1.txt	AC	182 ms 24,012 KB
evil_4_sorted_rev_1.txt	AC	162 ms 24,012 KB
evil_4_sorted_rev_2.txt	AC	222 ms 24,012 KB
evil_400_sorted.txt	AC	302 ms 24,012 KB
evil_400_sorted_rev.txt	AC	339 ms 24,012 KB

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

ソースコード

raw source code

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<cctype>
#include<chrono>
#include<random>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>

#ifdef LOCAL
#  include "debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = double;
using LD = long double;
using P = pair<int, int>;
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}

template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << p.first << " " << p.second;
    return os;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for (auto &x : v) is >> x;
    return is;
}
void in() {}
template<typename T, class... U>
void in(T &t, U &...u) {
    cin >> t;
    in(u...);
}
void out() { cout << "\n"; }
template<typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
    cout << t;
    outr(u...);
}

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

int query(vector<int> &v){
    out("?",v);
    cout.flush();
    int ret; in(ret);
    if(ret == -1) exit(0);
    return ret;
}

void answer(vector<int> &v){
    out("!",v);
    cout.flush();
    exit(0);
}

vector<int> fact(12);

vector<int> fact_to_vec(int m, int n){
    vector<int> ret;
    RFOR(i,1,n+1){
        int d = m/fact[i];
        ret.pb(d);
        m %= fact[i];
    }
    return ret;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; in(n);

    fact[0] = 1;
    FOR(i,1,12) fact[i] = fact[i-1]*i;

    if(n < 10){
        int ok = 0, ng = 1;
        FOR(i,1,n+1) ok += fact[i]*(n+1-i);
        FOR(i,1,n+1) ng += fact[i]*i;
        while(ng-ok > 1){
            int mid = (ok+ng)/2;
            vector<int> q = fact_to_vec(mid,n);
            int res = query(q);
            if(res == 1) ok = mid;
            else ng = mid;
        }
        vector<int> ans = fact_to_vec(ok,n);
        answer(ans);
    }
    else{
        tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> s;
        rep(i,n) s.insert(i+1);
        vector<int> ans;
        vector<int> q;
        rep(i,n){
            int ok = 0, ng = s.size();
            while(ng-ok > 1) {
                int mid = (ok+ng)/2;
                int qi = *s.find_by_order(mid);
                q = ans;
                q.pb(qi);
                for(int x : s) {
                    if(x != qi) q.pb(x);
                }
                int res = query(q);
                if(res == 1) ok = mid;
                else ng = mid;
            }
            int qi = *s.find_by_order(ok);
            s.erase(qi);
            ans.pb(qi);
        }
        answer(ans);
    }
}

yukicoder

結果

テストケース

ソースコード