#936922 (C++23) No.2577 Simple Permutation Guess

提出ソース

結果

問題	No.2577 Simple Permutation Guess
ユーザー	👑 amentorimaru
提出日時	2023-12-06 19:40:23
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	QLE
実行時間	-
コード長	4,186 bytes
コンパイル時間	4,016 ms
コンパイル使用メモリ	232,192 KB
実行使用メモリ	25,476 KB
平均クエリ数	251.96
最終ジャッジ日時	2024-09-27 01:45:32
合計ジャッジ時間	16,415 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	22 ms 24,940 KB
testcase_01	AC	121 ms 24,940 KB
testcase_02	AC	44 ms 24,940 KB
testcase_03	AC	22 ms 24,800 KB
testcase_04	AC	58 ms 24,940 KB
testcase_05	AC	64 ms 25,452 KB
testcase_06	AC	148 ms 24,928 KB
testcase_07	AC	144 ms 24,812 KB
testcase_08	AC	148 ms 24,812 KB
testcase_09	AC	148 ms 24,940 KB
testcase_10	AC	144 ms 25,452 KB
testcase_11	AC	22 ms 24,812 KB
testcase_12	AC	22 ms 24,940 KB
testcase_13	AC	23 ms 25,196 KB
testcase_14	AC	22 ms 25,436 KB
testcase_15	AC	21 ms 25,196 KB
testcase_16	AC	20 ms 24,812 KB
testcase_17	AC	21 ms 24,556 KB
testcase_18	AC	20 ms 24,940 KB
testcase_19	AC	20 ms 24,812 KB
testcase_20	AC	21 ms 25,196 KB
testcase_21	AC	22 ms 24,556 KB
testcase_22	AC	21 ms 24,836 KB
testcase_23	AC	22 ms 24,836 KB
testcase_24	QLE	-
testcase_25	AC	21 ms 25,220 KB
testcase_26	AC	21 ms 25,220 KB
testcase_27	AC	21 ms 24,580 KB
testcase_28	AC	21 ms 24,836 KB
testcase_29	AC	20 ms 24,580 KB
testcase_30	AC	22 ms 25,220 KB
testcase_31	AC	22 ms 25,452 KB
testcase_32	AC	22 ms 24,812 KB
testcase_33	AC	22 ms 24,556 KB
testcase_34	AC	21 ms 24,940 KB
testcase_35	AC	21 ms 24,812 KB
testcase_36	AC	21 ms 25,264 KB
testcase_37	AC	21 ms 25,220 KB
testcase_38	AC	21 ms 24,836 KB
testcase_39	AC	21 ms 24,964 KB
testcase_40	AC	20 ms 25,220 KB
testcase_41	AC	21 ms 25,220 KB
testcase_42	AC	20 ms 24,580 KB
testcase_43	AC	21 ms 24,580 KB
testcase_44	AC	21 ms 25,220 KB
testcase_45	AC	20 ms 25,220 KB
testcase_46	AC	21 ms 24,964 KB
testcase_47	AC	21 ms 25,476 KB
testcase_48	AC	20 ms 24,580 KB
testcase_49	AC	21 ms 24,580 KB
testcase_50	AC	21 ms 24,836 KB
testcase_51	AC	20 ms 25,220 KB
testcase_52	AC	21 ms 25,220 KB
testcase_53	AC	21 ms 24,580 KB
testcase_54	AC	20 ms 25,208 KB
testcase_55	AC	21 ms 24,580 KB
testcase_56	AC	20 ms 25,220 KB
testcase_57	AC	20 ms 24,952 KB
testcase_58	AC	20 ms 25,220 KB
testcase_59	AC	20 ms 24,836 KB
testcase_60	AC	21 ms 24,836 KB
testcase_61	AC	20 ms 24,836 KB
testcase_62	AC	21 ms 24,580 KB
testcase_63	AC	20 ms 24,836 KB
testcase_64	AC	19 ms 24,836 KB
testcase_65	AC	20 ms 24,836 KB
testcase_66	AC	21 ms 24,964 KB
testcase_67	AC	21 ms 25,220 KB
testcase_68	AC	21 ms 25,220 KB
testcase_69	AC	20 ms 25,476 KB
testcase_70	AC	21 ms 24,964 KB
testcase_71	AC	20 ms 25,220 KB
testcase_72	AC	20 ms 24,964 KB
testcase_73	AC	20 ms 25,452 KB
testcase_74	AC	21 ms 25,196 KB
testcase_75	AC	22 ms 24,556 KB
testcase_76	AC	22 ms 25,452 KB
testcase_77	AC	23 ms 24,812 KB
testcase_78	AC	23 ms 24,556 KB
testcase_79	AC	23 ms 25,196 KB
testcase_80	AC	23 ms 24,556 KB
testcase_81	AC	23 ms 25,196 KB
testcase_82	AC	22 ms 24,940 KB
testcase_83	AC	23 ms 25,324 KB
testcase_84	AC	23 ms 24,556 KB
testcase_85	AC	23 ms 25,184 KB
testcase_86	AC	23 ms 25,196 KB
testcase_87	AC	23 ms 25,196 KB
testcase_88	AC	22 ms 24,812 KB
testcase_89	AC	22 ms 25,452 KB
testcase_90	AC	22 ms 24,812 KB
testcase_91	AC	21 ms 25,196 KB
testcase_92	AC	117 ms 24,812 KB
testcase_93	AC	110 ms 24,940 KB
testcase_94	AC	102 ms 24,928 KB
testcase_95	AC	139 ms 25,196 KB
testcase_96	AC	144 ms 24,556 KB
testcase_97	AC	134 ms 24,812 KB
testcase_98	AC	133 ms 25,196 KB
testcase_99	AC	137 ms 24,812 KB
testcase_100	AC	111 ms 25,040 KB
testcase_101	AC	132 ms 25,196 KB
evil_1_rnd_1.txt	AC	256 ms 24,556 KB
evil_1_rnd_2.txt	AC	259 ms 24,812 KB
evil_2_big_1.txt	AC	325 ms 25,196 KB
evil_2_big_2.txt	AC	319 ms 24,556 KB
evil_2_big_3.txt	AC	321 ms 25,184 KB
evil_3_sorted_1.txt	AC	178 ms 25,464 KB
evil_4_sorted_rev_1.txt	AC	161 ms 24,964 KB
evil_4_sorted_rev_2.txt	AC	225 ms 25,288 KB
evil_400_sorted.txt	AC	304 ms 25,208 KB
evil_400_sorted_rev.txt	AC	351 ms 24,836 KB

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

ソースコード

raw source code

#define ATCODER
#define _USE_MATH_DEFINES
#include<stdio.h>
#include<iostream>
#include<fstream>
#include<algorithm>
#include<vector>
#include<string>
#include <cassert>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <math.h>
#include <climits>
#include <set>
#include <map>
#include <list>
#include <random>
#include <iterator>
#include <bitset>
#include <chrono>

using namespace std;

using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;

//template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;

#define FOR(i, a, b) for(ll i=(a); i<(b);i++)
#define REP(i, n) for(ll i=0; i<(n);i++)
#define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--)
#define PER(i, n) for(ll i=n-1; i>=0;i--)
#define REPREP(i,j,a,b) for(ll i=0;i<a;i++)for(ll j=0;j<b;j++)
#define VV(type) vector< vector<type> >
#define VV2(type,n,m,val) vector< vector<type> > val;val.resize(n);for(ll i;i<n;i++)val[i].resize(m)
#define vec(type) vector<type>
#define VEC(type,n,val) vector<type> val;val.resize(n)
#define VL vector<ll>
#define VVL vector< vector<ll> >
#define VP vector< pair<ll,ll> >
#define SZ size()
#define all(i) begin(i),end(i)
#define SORT(i) sort(all(i))
#define BITI(i) (1<<i)
#define BITSET(x,i) x | (ll(1)<<i)
#define BITCUT(x,i) x & ~(ll(1)<<i)
#define EXISTBIT(x,i) (((x>>i) & 1) != 0)
#define ALLBIT(n) (ll(1)<<n-1)
#define CHMAX(n,v) n=n<v?v:n
#define CHMIN(n,v) n=n>v?v:n
#define MP(a,b) make_pair(a,b)
#define DET2(x1,y1,x2,y2) x1*y2-x2*y1
#define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) x1*y2*z3+x2*y3*z1+x3*y1*z2-z1*y2*x3-z2*y3*x1-z3*y1*x2
#define INC(a) for(auto& v:a)v++;
#define DEC(a) for(auto& v:a)v--;
#define SQU(x) (x)*(x)
#define L0 ll(0)
#ifdef ATCODER
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using mint2 = modint998244353;
#endif
template<typename T = ll>
vector<T> read(size_t n) {
  vector<T> ts(n);
  for (size_t i = 0; i < n; i++) cin >> ts[i];
  return ts;
}

template<typename TV, const ll N> void read_tuple_impl(TV&) {}
template<typename TV, const ll N, typename Head, typename... Tail>
void read_tuple_impl(TV& ts) {
  get<N>(ts).emplace_back(*(istream_iterator<Head>(cin)));
  read_tuple_impl<TV, N + 1, Tail...>(ts);
}
template<typename... Ts> decltype(auto) read_tuple(size_t n) {
  tuple<vector<Ts>...> ts;
  for (size_t i = 0; i < n; i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts);
  return ts;
}

using val1 = pair<mint, mint>;
using val2 = pair<mint2, mint2>;
using func = ll;

val1 op1(val1 a, val1 b) { return MP(a.first * b.second + b.first, a.second * b.second); }
val1 e1() { return MP(0, 1); }
val2 op2(val2 a, val2 b) { return MP(a.first * b.second + b.first, a.second * b.second); }
val2 e2() { return MP(0, 1); }
val1 op1r(val1 a, val1 b) { return MP(b.first * a.second + a.first, a.second * b.second); }
val1 e1r() { return MP(0, 1); }
val2 op2r(val2 a, val2 b) { return MP(b.first * a.second + a.first, a.second * b.second); }
val2 e2r() { return MP(0, 1); }


//val mp(func f, val a) {
//  return MP(a.first + f * a.second, a.second);
//}
func comp(func f, func g) {
  return f + g;
}
func id() { return 0; }

ll di[4] = { 1,0,-1,0 };
ll dj[4] = { 0,1,0,-1 };
ll si[4] = { 0,3,3,0 };
ll sj[4] = { 0,0,3,3 };
//ll di[4] = { -1,-1,1,1 };
//ll dj[4] = { -1,1,-1,1 };
ll di8[8] = { 0,-1,-1,-1,0,1,1,1 };
ll dj8[8] = { -1,-1,0,1,1,1,0,-1 };

void solve() {
  ll n;
  cin >> n;
  VL p(n), ans;
  REP(i, n)
    p[i] = i + 1;

  REP(i, n - 1) {
    ll l = 0, r = p.size();
    while (l + 1 < r) {
      ll m = (l + r) / 2;
      cout << "? ";
      for (auto& v : ans) {
        cout << v << " ";
      }
      cout << p[m] << " ";
      for (auto& v : p) {
        if (v == p[m])continue;
        cout << v << " ";        
      }
      cout << endl;
      ll res;
      cin >> res;
      if (res) {
        l = m;
      }
      else {
        r = m;
      }
    }
    ans.push_back(p[l]);
    p.erase(p.begin() + l);
  }
  ans.push_back(p[0]);
  cout << "! ";
  for (auto& v : ans)
    cout << v << " ";
  cout << endl;
  return;
}

int main() {
  ll t = 1;
  //cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}

yukicoder

結果

テストケース

ソースコード