結果
問題 | No.2577 Simple Permutation Guess |
ユーザー |
![]() |
提出日時 | 2023-11-27 23:16:15 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 4,716 bytes |
コンパイル時間 | 9,712 ms |
コンパイル使用メモリ | 464,164 KB |
実行使用メモリ | 25,964 KB |
平均クエリ数 | 536.96 |
最終ジャッジ日時 | 2024-09-26 22:32:25 |
合計ジャッジ時間 | 25,548 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 104 RE * 7 |
ソースコード
/*このコード、と~おれ!Be accepted!∧_∧(。・ω・。)つ━☆・*。⊂ ノ ・゜+.しーJ °。+ *´¨).· ´¸.·*´¨) ¸.·*¨)(¸.·´ (¸.·'* ☆*/#include <cstdio>#include <algorithm>#include <string>#include <cmath>#include <cstring>#include <vector>#include <numeric>#include <iostream>#include <random>#include <map>#include <unordered_map>#include <queue>#include <regex>#include <functional>#include <complex>#include <list>#include <cassert>#include <iomanip>#include <set>#include <stack>#include <bitset>#include <array>#include <chrono>#include <unordered_set>//#pragma GCC target("arch=skylake-avx512")//#pragma GCC target("avx2")//#pragma GCC optimize("O3")//#pragma GCC optimize("Ofast")//#pragma GCC target("sse4")//#pragma GCC optimize("unroll-loops")//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")#define repeat(i, n, m) for(int i = n; i < (m); ++i)#define rep(i, n) for(int i = 0; i < (n); ++i)#define printynl(a) printf(a ? "yes\n" : "no\n")#define printyn(a) printf(a ? "Yes\n" : "No\n")#define printYN(a) printf(a ? "YES\n" : "NO\n")#define printim(a) printf(a ? "possible\n" : "imposible\n")#define printdb(a) printf("%.50lf\n", a)#define printLdb(a) printf("%.50Lf\n", a)#define printdbd(a) printf("%.16lf\n", a)#define prints(s) printf("%s\n", s.c_str())#define all(x) (x).begin(), (x).end()#define deg_to_rad(deg) (((deg)/360.0L)*2.0L*PI)#define rad_to_deg(rad) (((rad)/2.0L/PI)*360.0L)#define Please return#define AC 0#define manhattan_dist(a, b, c, d) (abs(a - c) + abs(b - d))using ll = long long;using ull = unsigned long long;constexpr int INF = 1073741823;constexpr int MINF = -1073741823;constexpr ll LINF = ll(4661686018427387903);constexpr ll MOD = 1e9 + 7;constexpr ll mod = 998244353;constexpr long double eps = 1e-14;const long double PI = acosl(-1.0L);using namespace std;void scans(string& str) {char c;str = "";scanf("%c", &c);if (c == '\n')scanf("%c", &c);while (c != '\n' && c != -1 && c != ' ') {str += c;scanf("%c", &c);}}void scanc(char& str) {char c;scanf("%c", &c);if (c == -1)return;while (c == '\n') {scanf("%c", &c);}str = c;}double acot(double x) {return PI / 2 - atan(x);}ll LSB(ll n) { return (n & (-n)); }template<typename T>inline T chmin(T& a, const T& b) {if (a > b)a = b;return a;}template<typename T>inline T chmax(T& a, const T& b) {if (a < b)a = b;return a;}//cpp_int#if __has_include(<boost/multiprecision/cpp_int.hpp>)#include <boost/multiprecision/cpp_int.hpp>#include <boost/multiprecision/cpp_dec_float.hpp>using namespace boost::multiprecision;#elseusing cpp_int = ll;#endif//atcoder library#if __has_include(<atcoder/all>)#include <atcoder/all>//using namespace atcoder;#endif/*random_device seed_gen;mt19937 engine(seed_gen());uniform_int_distribution dist(1, 100);*//*----------------------------------------------------------------------------------*//** @title kth_permutation* @docs kyopro/docs/kth_permutation.md*/template<typename T = int>vector<T> kth_permutation(int n, T k) {vector<T> a(n), b(n);rep(i, n)b[i] = i + 1;vector<T> x(n);rep(i, n) {x[i] = (k % (ll)(i + 1));k /= (i + 1);}reverse(all(x));rep(i, n) {a[i] = b[x[i]];b.erase(b.begin() + x[i]);}return a;}int main() {int n;scanf("%d", &n);vector<int> ans(n);if (n <= 20) {ll ng = 1, ok = 0;rep(i, n)ng *= i + 1;while (abs(ng - ok) > 1) {ll mid = (ok + ng) / 2;auto a = kth_permutation<int>(n, mid);puts("?");rep(i, n)printf("%d ", a[i]);puts("");fflush(stdout);int res;scanf("%d", &res);if (res == 1)ok = mid;else ng = mid;}ans = kth_permutation<int>(n, ok);}else {set<int> st;rep(i, n)st.insert(i + 1);map<vector<int>, int> mp;rep(i, n) {int k = st.size(),ok = 0, ng = k;while (abs(ok - ng) > 1) {int mid = (ok + ng) / 2;auto stt = st;vector<int> a(n);rep(j, i)a[j] = ans[j];a[i] = *next(stt.begin(), mid);stt.erase(next(stt.begin(), mid));rep(j, n - i - 1)a[i + j + 1] = *next(stt.begin(), j);int res;if (mp.find(a) == mp.end()) {puts("?");rep(i, n)printf("%d ", a[i]);puts("");fflush(stdout);scanf("%d", &res);mp[a] = res;}res = mp[a];if (res == 1)ok = mid;else ng = mid;}ans[i] = *next(st.begin(), ok);st.erase(next(st.begin(), ok));}}puts("!");rep(i, n)printf("%d\n", ans[i]);fflush(stdout);Please AC;}