結果
問題 | No.2577 Simple Permutation Guess |
ユーザー | Kude |
提出日時 | 2023-12-05 00:22:31 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 238 ms / 2,000 ms |
コード長 | 1,829 bytes |
コンパイル時間 | 7,985 ms |
コンパイル使用メモリ | 422,012 KB |
実行使用メモリ | 25,424 KB |
平均クエリ数 | 248.84 |
最終ジャッジ日時 | 2024-09-26 23:34:05 |
合計ジャッジ時間 | 20,421 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 22 ms
25,196 KB |
testcase_01 | AC | 175 ms
24,556 KB |
testcase_02 | AC | 49 ms
24,812 KB |
testcase_03 | AC | 21 ms
25,196 KB |
testcase_04 | AC | 71 ms
24,556 KB |
testcase_05 | AC | 83 ms
24,940 KB |
testcase_06 | AC | 220 ms
24,812 KB |
testcase_07 | AC | 224 ms
24,556 KB |
testcase_08 | AC | 229 ms
24,812 KB |
testcase_09 | AC | 238 ms
24,556 KB |
testcase_10 | AC | 228 ms
24,940 KB |
testcase_11 | AC | 22 ms
24,812 KB |
testcase_12 | AC | 21 ms
25,196 KB |
testcase_13 | AC | 24 ms
25,196 KB |
testcase_14 | AC | 24 ms
25,196 KB |
testcase_15 | AC | 22 ms
24,940 KB |
testcase_16 | AC | 21 ms
24,556 KB |
testcase_17 | AC | 21 ms
24,940 KB |
testcase_18 | AC | 21 ms
24,940 KB |
testcase_19 | AC | 21 ms
24,556 KB |
testcase_20 | AC | 22 ms
24,812 KB |
testcase_21 | AC | 22 ms
25,196 KB |
testcase_22 | AC | 22 ms
25,220 KB |
testcase_23 | AC | 22 ms
24,836 KB |
testcase_24 | AC | 22 ms
24,580 KB |
testcase_25 | AC | 21 ms
24,580 KB |
testcase_26 | AC | 21 ms
25,220 KB |
testcase_27 | AC | 21 ms
24,580 KB |
testcase_28 | AC | 22 ms
24,964 KB |
testcase_29 | AC | 21 ms
24,964 KB |
testcase_30 | AC | 21 ms
24,580 KB |
testcase_31 | AC | 21 ms
24,812 KB |
testcase_32 | AC | 22 ms
25,196 KB |
testcase_33 | AC | 22 ms
25,196 KB |
testcase_34 | AC | 21 ms
24,812 KB |
testcase_35 | AC | 22 ms
24,940 KB |
testcase_36 | AC | 21 ms
24,812 KB |
testcase_37 | AC | 21 ms
24,836 KB |
testcase_38 | AC | 20 ms
24,580 KB |
testcase_39 | AC | 20 ms
24,836 KB |
testcase_40 | AC | 21 ms
24,964 KB |
testcase_41 | AC | 20 ms
24,580 KB |
testcase_42 | AC | 22 ms
24,836 KB |
testcase_43 | AC | 21 ms
25,100 KB |
testcase_44 | AC | 25 ms
24,580 KB |
testcase_45 | AC | 22 ms
24,580 KB |
testcase_46 | AC | 21 ms
24,580 KB |
testcase_47 | AC | 22 ms
24,836 KB |
testcase_48 | AC | 21 ms
24,580 KB |
testcase_49 | AC | 20 ms
24,836 KB |
testcase_50 | AC | 19 ms
25,220 KB |
testcase_51 | AC | 19 ms
24,964 KB |
testcase_52 | AC | 21 ms
24,580 KB |
testcase_53 | AC | 19 ms
24,964 KB |
testcase_54 | AC | 21 ms
24,580 KB |
testcase_55 | AC | 21 ms
24,964 KB |
testcase_56 | AC | 22 ms
24,964 KB |
testcase_57 | AC | 21 ms
24,580 KB |
testcase_58 | AC | 21 ms
24,836 KB |
testcase_59 | AC | 21 ms
25,220 KB |
testcase_60 | AC | 20 ms
24,580 KB |
testcase_61 | AC | 20 ms
24,580 KB |
testcase_62 | AC | 22 ms
24,836 KB |
testcase_63 | AC | 21 ms
25,220 KB |
testcase_64 | AC | 21 ms
24,836 KB |
testcase_65 | AC | 22 ms
24,836 KB |
testcase_66 | AC | 20 ms
25,220 KB |
testcase_67 | AC | 21 ms
24,836 KB |
testcase_68 | AC | 21 ms
25,220 KB |
testcase_69 | AC | 20 ms
25,220 KB |
testcase_70 | AC | 22 ms
24,964 KB |
testcase_71 | AC | 22 ms
24,964 KB |
testcase_72 | AC | 21 ms
24,964 KB |
testcase_73 | AC | 20 ms
25,196 KB |
testcase_74 | AC | 23 ms
24,812 KB |
testcase_75 | AC | 23 ms
24,556 KB |
testcase_76 | AC | 22 ms
24,812 KB |
testcase_77 | AC | 22 ms
24,940 KB |
testcase_78 | AC | 22 ms
25,196 KB |
testcase_79 | AC | 23 ms
24,812 KB |
testcase_80 | AC | 22 ms
24,796 KB |
testcase_81 | AC | 22 ms
24,556 KB |
testcase_82 | AC | 23 ms
25,196 KB |
testcase_83 | AC | 23 ms
24,812 KB |
testcase_84 | AC | 23 ms
24,812 KB |
testcase_85 | AC | 23 ms
24,556 KB |
testcase_86 | AC | 22 ms
25,196 KB |
testcase_87 | AC | 22 ms
24,940 KB |
testcase_88 | AC | 22 ms
24,812 KB |
testcase_89 | AC | 22 ms
24,556 KB |
testcase_90 | AC | 23 ms
24,556 KB |
testcase_91 | AC | 23 ms
25,196 KB |
testcase_92 | AC | 181 ms
25,196 KB |
testcase_93 | AC | 161 ms
24,812 KB |
testcase_94 | AC | 152 ms
25,424 KB |
testcase_95 | AC | 217 ms
25,196 KB |
testcase_96 | AC | 214 ms
24,556 KB |
testcase_97 | AC | 200 ms
24,940 KB |
testcase_98 | AC | 196 ms
24,940 KB |
testcase_99 | AC | 205 ms
24,812 KB |
testcase_100 | AC | 158 ms
25,196 KB |
testcase_101 | AC | 201 ms
25,196 KB |
evil_1_rnd_1.txt | AC | 452 ms
24,812 KB |
evil_1_rnd_2.txt | AC | 461 ms
25,452 KB |
evil_2_big_1.txt | AC | 591 ms
25,196 KB |
evil_2_big_2.txt | AC | 596 ms
24,812 KB |
evil_2_big_3.txt | AC | 607 ms
25,136 KB |
evil_3_sorted_1.txt | AC | 283 ms
24,568 KB |
evil_4_sorted_rev_1.txt | AC | 248 ms
25,220 KB |
evil_4_sorted_rev_2.txt | AC | 365 ms
25,220 KB |
evil_400_sorted.txt | AC | 480 ms
25,208 KB |
evil_400_sorted_rev.txt | AC | 656 ms
24,580 KB |
ソースコード
#include<bits/stdc++.h> #include <boost/multiprecision/cpp_int.hpp> using namespace boost::multiprecision; namespace { #pragma GCC diagnostic ignored "-Wunused-function" #include<atcoder/all> #pragma GCC diagnostic warning "-Wunused-function" using namespace std; using namespace atcoder; #define rep(i,n) for(int i = 0; i < (int)(n); i++) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--) #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; } template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; } using ll = long long; using P = pair<int,int>; using VI = vector<int>; using VVI = vector<VI>; using VL = vector<ll>; using VVL = vector<VL>; constexpr unsigned int BSZ = 2048 * 2; using UINT = number<cpp_int_backend<BSZ, BSZ, unsigned_magnitude, unchecked, void> >; UINT fact[401]; } int main() { ios::sync_with_stdio(false); cin.tie(0); fact[0] = 1; for (int i = 1; i <= 400; i++) fact[i] = fact[i-1] * i; int n; cin >> n; auto r = fact[n]; UINT l = 0; VI p; auto get_kth = [&](UINT k) { VI q(n); VI rest(n); rep(i, n) rest[i] = i + 1; rep(i, n) { auto unit = fact[n - 1 - i]; auto j = int(k / unit); q[i] = rest[j]; rest.erase(rest.begin() + j); k -= j * unit; } return q; }; auto check = [&](const auto& q) { cout << "?"; for (int x : q) cout << ' ' << x; cout << endl; int ret; cin >> ret; if (ret == -1) exit(0); return ret; }; while (r - l > 1) { auto c = (l + r) / 2; auto q = get_kth(c); if (check(q)) l = c; else r = c; } auto q = get_kth(l); cout << "!"; for (int x : q) cout << ' ' << x; cout << endl; }