#937481 (C++14) No.2577 Simple Permutation Guess

• 問題: No.2577 Simple Permutation Guess
• ユーザー: anonymously
• 提出日時: 2023-12-08 20:54:26
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: QLE
• 実行時間: -
• コード長: 1,023 bytes
• コンパイル時間: 1,686 ms
• コンパイル使用メモリ: 171,876 KB
• 実行使用メモリ: 24,012 KB
• 平均クエリ数: 251.96
• 最終ジャッジ日時: 2023-12-08 20:54:44
• 合計ジャッジ時間: 15,739 ms
• ジャッジサーバーID （参考情報）: judge11 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	31 ms; 24,000 KB
testcase_01	AC	119 ms; 24,000 KB
testcase_02	AC	46 ms; 24,000 KB
testcase_03	AC	26 ms; 24,000 KB
testcase_04	AC	61 ms; 24,000 KB
testcase_05	AC	69 ms; 24,000 KB
testcase_06	AC	145 ms; 24,000 KB
testcase_07	AC	145 ms; 24,000 KB
testcase_08	AC	145 ms; 24,000 KB
testcase_09	AC	145 ms; 24,000 KB
testcase_10	AC	147 ms; 24,000 KB
testcase_11	AC	25 ms; 24,000 KB
testcase_12	AC	24 ms; 24,000 KB
testcase_13	AC	26 ms; 24,000 KB
testcase_14	AC	26 ms; 24,000 KB
testcase_15	AC	25 ms; 24,000 KB
testcase_16	AC	24 ms; 24,000 KB
testcase_17	AC	24 ms; 24,000 KB
testcase_18	AC	24 ms; 24,000 KB
testcase_19	AC	25 ms; 24,000 KB
testcase_20	AC	23 ms; 24,000 KB
testcase_21	AC	24 ms; 24,000 KB
testcase_22	AC	24 ms; 24,012 KB
testcase_23	AC	24 ms; 24,012 KB
testcase_24	QLE	-
testcase_25	AC	25 ms; 24,012 KB
testcase_26	AC	24 ms; 24,012 KB
testcase_27	AC	25 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	24 ms; 24,000 KB
testcase_33	AC	42 ms; 24,000 KB
testcase_34	AC	26 ms; 24,000 KB
testcase_35	AC	24 ms; 24,000 KB
testcase_36	AC	26 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	24 ms; 24,000 KB
testcase_41	AC	24 ms; 24,000 KB
testcase_42	AC	24 ms; 24,000 KB
testcase_43	AC	24 ms; 24,000 KB
testcase_44	AC	24 ms; 24,000 KB
testcase_45	AC	23 ms; 24,000 KB
testcase_46	AC	25 ms; 24,000 KB
testcase_47	AC	24 ms; 24,000 KB
testcase_48	AC	25 ms; 24,000 KB
testcase_49	AC	24 ms; 24,000 KB
testcase_50	AC	24 ms; 24,000 KB
testcase_51	AC	25 ms; 24,000 KB
testcase_52	AC	25 ms; 24,000 KB
testcase_53	AC	24 ms; 24,000 KB
testcase_54	AC	24 ms; 24,000 KB
testcase_55	AC	24 ms; 24,000 KB
testcase_56	AC	24 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	24 ms; 24,000 KB
testcase_62	AC	24 ms; 24,000 KB
testcase_63	AC	23 ms; 24,000 KB
testcase_64	AC	23 ms; 24,012 KB
testcase_65	AC	24 ms; 24,012 KB
testcase_66	AC	24 ms; 24,012 KB
testcase_67	AC	24 ms; 24,012 KB
testcase_68	AC	23 ms; 24,012 KB
testcase_69	AC	24 ms; 24,012 KB
testcase_70	AC	24 ms; 24,012 KB
testcase_71	AC	24 ms; 24,012 KB
testcase_72	AC	24 ms; 24,012 KB
testcase_73	AC	25 ms; 24,000 KB
testcase_74	AC	25 ms; 24,000 KB
testcase_75	AC	26 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	25 ms; 24,000 KB
testcase_80	AC	26 ms; 24,000 KB
testcase_81	AC	26 ms; 24,000 KB
testcase_82	AC	27 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	27 ms; 24,012 KB
testcase_88	AC	27 ms; 24,012 KB
testcase_89	AC	26 ms; 24,012 KB
testcase_90	AC	26 ms; 24,012 KB
testcase_91	AC	26 ms; 24,012 KB
testcase_92	AC	121 ms; 24,012 KB
testcase_93	AC	111 ms; 24,012 KB
testcase_94	AC	106 ms; 24,012 KB
testcase_95	AC	138 ms; 24,012 KB
testcase_96	AC	139 ms; 24,012 KB
testcase_97	AC	133 ms; 24,012 KB
testcase_98	AC	130 ms; 24,012 KB
testcase_99	AC	137 ms; 24,012 KB
testcase_100	AC	138 ms; 24,012 KB
testcase_101	AC	133 ms; 24,012 KB
evil_1_rnd_1.txt	AC	254 ms; 24,012 KB
evil_1_rnd_2.txt	AC	260 ms; 24,012 KB
evil_2_big_1.txt	AC	315 ms; 24,012 KB
evil_2_big_2.txt	AC	338 ms; 24,012 KB
evil_2_big_3.txt	AC	313 ms; 24,012 KB
evil_3_sorted_1.txt	AC	177 ms; 24,012 KB
evil_4_sorted_rev_1.txt	AC	157 ms; 24,012 KB
evil_4_sorted_rev_2.txt	AC	218 ms; 24,012 KB
evil_400_sorted.txt	AC	291 ms; 24,012 KB
evil_400_sorted_rev.txt	AC	334 ms; 24,012 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;

int main(){
	int n;
	cin >> n;
	
	/*
	 * 方針
	 * 先頭から二分探索で確定させていく。
	 * 投げる順列Qは、
	 * 確定部分P＋（残りの要素の中、先頭がqである順列の最も「小さい」順列）、すなわち
	 * P,q,1,2,...,q-1,q+1,...,n
	 */

	vector<int> P; //確定
	vector<int> Q(n); //暫定
	iota(Q.begin(),Q.end(),1);
	
	while(Q.size()){
		int left=0;
		int right=Q.size();
		while(right-left>1){
			int mid=(left+right)/2;
			cout << '?';
			for(int p:P){
				cout << ' ' << p;
			}
			cout << ' ' << Q[mid];
			for(int q=0;q<Q.size();q++){
				if(q!=mid){
					cout << ' ' << Q[q];
				}
			}
			cout << endl << flush;
			int ret;
			cin >> ret;
			if(ret==1){//答えはQ以上
				left=mid;
			}else if(ret==0){//答えは小さい
				right=mid;
			}else{
				abort();
			}
		}
		P.push_back(Q[left]);
		Q.erase(Q.begin()+left);
	}
	cout << '!';
	for(int p:P){
		cout << ' ' << p;
	}
	cout << endl << flush;
	return 0;
}