結果
問題 | No.2577 Simple Permutation Guess |
ユーザー | 👑 emthrm |
提出日時 | 2023-12-05 00:36:37 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 141 ms / 2,000 ms |
コード長 | 2,471 bytes |
コンパイル時間 | 3,273 ms |
コンパイル使用メモリ | 261,852 KB |
実行使用メモリ | 24,012 KB |
平均クエリ数 | 251.94 |
最終ジャッジ日時 | 2023-12-05 00:36:55 |
合計ジャッジ時間 | 16,771 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 28 ms
24,000 KB |
testcase_01 | AC | 115 ms
24,000 KB |
testcase_02 | AC | 46 ms
24,000 KB |
testcase_03 | AC | 25 ms
24,000 KB |
testcase_04 | AC | 61 ms
24,000 KB |
testcase_05 | AC | 66 ms
24,000 KB |
testcase_06 | AC | 141 ms
24,000 KB |
testcase_07 | AC | 136 ms
24,000 KB |
testcase_08 | AC | 137 ms
24,000 KB |
testcase_09 | AC | 140 ms
24,000 KB |
testcase_10 | AC | 138 ms
24,000 KB |
testcase_11 | AC | 25 ms
24,000 KB |
testcase_12 | AC | 24 ms
24,000 KB |
testcase_13 | AC | 71 ms
24,000 KB |
testcase_14 | AC | 25 ms
24,000 KB |
testcase_15 | AC | 24 ms
24,000 KB |
testcase_16 | AC | 24 ms
24,000 KB |
testcase_17 | AC | 24 ms
24,000 KB |
testcase_18 | AC | 25 ms
24,000 KB |
testcase_19 | AC | 24 ms
24,000 KB |
testcase_20 | AC | 24 ms
24,000 KB |
testcase_21 | AC | 24 ms
24,000 KB |
testcase_22 | AC | 25 ms
24,012 KB |
testcase_23 | AC | 24 ms
24,012 KB |
testcase_24 | AC | 24 ms
24,012 KB |
testcase_25 | AC | 26 ms
24,012 KB |
testcase_26 | AC | 24 ms
24,012 KB |
testcase_27 | AC | 23 ms
24,012 KB |
testcase_28 | AC | 24 ms
24,012 KB |
testcase_29 | AC | 24 ms
24,012 KB |
testcase_30 | AC | 24 ms
24,012 KB |
testcase_31 | AC | 24 ms
24,000 KB |
testcase_32 | AC | 25 ms
24,000 KB |
testcase_33 | AC | 24 ms
24,000 KB |
testcase_34 | AC | 24 ms
24,000 KB |
testcase_35 | AC | 25 ms
24,000 KB |
testcase_36 | AC | 24 ms
24,000 KB |
testcase_37 | AC | 24 ms
24,000 KB |
testcase_38 | AC | 24 ms
24,000 KB |
testcase_39 | AC | 24 ms
24,000 KB |
testcase_40 | AC | 25 ms
24,000 KB |
testcase_41 | AC | 26 ms
24,000 KB |
testcase_42 | AC | 24 ms
24,000 KB |
testcase_43 | AC | 23 ms
24,000 KB |
testcase_44 | AC | 24 ms
24,000 KB |
testcase_45 | AC | 24 ms
24,000 KB |
testcase_46 | AC | 23 ms
24,000 KB |
testcase_47 | AC | 24 ms
24,000 KB |
testcase_48 | AC | 24 ms
24,000 KB |
testcase_49 | AC | 24 ms
24,000 KB |
testcase_50 | AC | 24 ms
24,000 KB |
testcase_51 | AC | 23 ms
24,000 KB |
testcase_52 | AC | 24 ms
24,000 KB |
testcase_53 | AC | 23 ms
24,000 KB |
testcase_54 | AC | 24 ms
24,000 KB |
testcase_55 | AC | 24 ms
24,000 KB |
testcase_56 | AC | 23 ms
24,000 KB |
testcase_57 | AC | 24 ms
24,000 KB |
testcase_58 | AC | 24 ms
24,000 KB |
testcase_59 | AC | 24 ms
24,000 KB |
testcase_60 | AC | 24 ms
24,000 KB |
testcase_61 | AC | 23 ms
24,000 KB |
testcase_62 | AC | 24 ms
24,000 KB |
testcase_63 | AC | 24 ms
24,000 KB |
testcase_64 | AC | 39 ms
24,012 KB |
testcase_65 | AC | 25 ms
24,012 KB |
testcase_66 | AC | 25 ms
24,012 KB |
testcase_67 | AC | 25 ms
24,012 KB |
testcase_68 | AC | 25 ms
24,012 KB |
testcase_69 | AC | 25 ms
24,012 KB |
testcase_70 | AC | 24 ms
24,012 KB |
testcase_71 | AC | 24 ms
24,012 KB |
testcase_72 | AC | 25 ms
24,012 KB |
testcase_73 | AC | 33 ms
24,000 KB |
testcase_74 | AC | 26 ms
24,000 KB |
testcase_75 | AC | 26 ms
24,000 KB |
testcase_76 | AC | 25 ms
24,000 KB |
testcase_77 | AC | 26 ms
24,000 KB |
testcase_78 | AC | 26 ms
24,000 KB |
testcase_79 | AC | 26 ms
24,000 KB |
testcase_80 | AC | 26 ms
24,000 KB |
testcase_81 | AC | 27 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 | 28 ms
24,000 KB |
testcase_86 | AC | 27 ms
24,000 KB |
testcase_87 | AC | 28 ms
24,012 KB |
testcase_88 | AC | 27 ms
24,012 KB |
testcase_89 | AC | 28 ms
24,012 KB |
testcase_90 | AC | 27 ms
24,012 KB |
testcase_91 | AC | 26 ms
24,012 KB |
testcase_92 | AC | 116 ms
24,012 KB |
testcase_93 | AC | 108 ms
24,012 KB |
testcase_94 | AC | 102 ms
24,012 KB |
testcase_95 | AC | 133 ms
24,012 KB |
testcase_96 | AC | 134 ms
24,012 KB |
testcase_97 | AC | 126 ms
24,012 KB |
testcase_98 | AC | 125 ms
24,012 KB |
testcase_99 | AC | 130 ms
24,012 KB |
testcase_100 | AC | 107 ms
24,012 KB |
testcase_101 | AC | 126 ms
24,012 KB |
evil_1_rnd_1.txt | AC | 240 ms
24,012 KB |
evil_1_rnd_2.txt | AC | 245 ms
24,012 KB |
evil_2_big_1.txt | AC | 296 ms
24,012 KB |
evil_2_big_2.txt | AC | 297 ms
24,012 KB |
evil_2_big_3.txt | AC | 290 ms
24,012 KB |
evil_3_sorted_1.txt | AC | 170 ms
24,012 KB |
evil_4_sorted_rev_1.txt | AC | 150 ms
24,012 KB |
evil_4_sorted_rev_2.txt | AC | 208 ms
24,012 KB |
evil_400_sorted.txt | AC | 273 ms
24,012 KB |
evil_400_sorted_rev.txt | AC | 311 ms
24,012 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) using ll = long long; constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr double EPS = 1e-8; constexpr int MOD = 998244353; // constexpr int MOD = 1000000007; constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1}; constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}; constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1}; template <typename T, typename U> inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; } template <typename T, typename U> inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << fixed << setprecision(20); } } iosetup; int main() { // constexpr int N = 400; // array<int, N + 1> need{}; // FOR(n, 2, N + 1) need[n] = llround(ceil(log2(n))); // FOR(n, 3, N + 1) need[n] += need[n - 1]; // FOR(n, 2, N + 1) assert(n == 6 || need[n] <= llround(floor((n - 1) * log2(n))) - n / 2 + 1 ); int n; cin >> n; if (n == 6) { vector<vector<int>> all_p; vector<int> q(n); iota(q.begin(), q.end(), 0); do { all_p.emplace_back(q); } while (ranges::next_permutation(q).found); int lb = 0, ub = all_p.size(); while (ub - lb > 1) { const int mid = midpoint(lb, ub); cout << '?'; for (const int p_i : all_p[mid]) cout << ' ' << p_i + 1; cout << endl; int ret; cin >> ret; assert(ret != -1); (ret == 1 ? lb : ub) = mid; } cout << '!'; for (const int p_i : all_p[lb]) cout << ' ' << p_i + 1; cout << endl; vector<int> rem(n); } else { vector<int> rem(n); iota(rem.begin(), rem.end(), 0); vector<int> p; p.reserve(n); REP(i, n) { int lb = 0, ub = n - i; while (ub - lb > 1) { const int mid = midpoint(lb, ub); cout << '?'; for (const int p_i : p) cout << ' ' << p_i + 1; cout << ' ' << rem[mid] + 1; for (const int e : rem) { if (e != rem[mid]) cout << ' ' << e + 1; } cout << endl; int ret; cin >> ret; assert(ret != -1); (ret == 1 ? lb : ub) = mid; } p.emplace_back(rem[lb]); rem.erase(next(rem.begin(), lb)); } cout << '!'; for (const int p_i : p) cout << ' ' << p_i + 1; cout << endl; } return 0; }