#940816 (C++17) No.2577 Simple Permutation Guess

提出ソース

結果

問題	No.2577 Simple Permutation Guess
ユーザー	akiaa11
提出日時	2023-12-28 16:31:22
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	149 ms / 2,000 ms
コード長	4,035 bytes
コンパイル時間	4,716 ms
コンパイル使用メモリ	267,056 KB
実行使用メモリ	25,476 KB
平均クエリ数	251.86
最終ジャッジ日時	2024-09-27 15:46:41
合計ジャッジ時間	18,271 ms
ジャッジサーバーID （参考情報）	judge4 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	25 ms 25,196 KB
testcase_01	AC	120 ms 24,812 KB
testcase_02	AC	46 ms 25,196 KB
testcase_03	AC	25 ms 24,556 KB
testcase_04	AC	63 ms 24,940 KB
testcase_05	AC	72 ms 24,812 KB
testcase_06	AC	144 ms 25,100 KB
testcase_07	AC	148 ms 24,812 KB
testcase_08	AC	143 ms 24,428 KB
testcase_09	AC	149 ms 24,940 KB
testcase_10	AC	144 ms 24,556 KB
testcase_11	AC	25 ms 25,196 KB
testcase_12	AC	24 ms 25,196 KB
testcase_13	AC	27 ms 25,196 KB
testcase_14	AC	26 ms 25,052 KB
testcase_15	AC	25 ms 25,196 KB
testcase_16	AC	23 ms 24,812 KB
testcase_17	AC	22 ms 24,940 KB
testcase_18	AC	22 ms 25,196 KB
testcase_19	AC	22 ms 25,196 KB
testcase_20	AC	22 ms 24,556 KB
testcase_21	AC	22 ms 24,812 KB
testcase_22	AC	21 ms 25,208 KB
testcase_23	AC	22 ms 24,836 KB
testcase_24	AC	22 ms 24,836 KB
testcase_25	AC	21 ms 24,964 KB
testcase_26	AC	22 ms 24,836 KB
testcase_27	AC	22 ms 24,836 KB
testcase_28	AC	22 ms 25,476 KB
testcase_29	AC	21 ms 25,220 KB
testcase_30	AC	21 ms 24,836 KB
testcase_31	AC	22 ms 25,196 KB
testcase_32	AC	22 ms 24,556 KB
testcase_33	AC	23 ms 25,196 KB
testcase_34	AC	22 ms 24,428 KB
testcase_35	AC	22 ms 24,556 KB
testcase_36	AC	25 ms 24,556 KB
testcase_37	AC	24 ms 24,836 KB
testcase_38	AC	22 ms 24,836 KB
testcase_39	AC	21 ms 25,204 KB
testcase_40	AC	21 ms 25,220 KB
testcase_41	AC	22 ms 24,836 KB
testcase_42	AC	21 ms 24,580 KB
testcase_43	AC	22 ms 24,836 KB
testcase_44	AC	21 ms 24,964 KB
testcase_45	AC	22 ms 24,836 KB
testcase_46	AC	22 ms 24,580 KB
testcase_47	AC	22 ms 24,836 KB
testcase_48	AC	22 ms 24,580 KB
testcase_49	AC	22 ms 24,836 KB
testcase_50	AC	22 ms 25,220 KB
testcase_51	AC	22 ms 24,824 KB
testcase_52	AC	21 ms 24,836 KB
testcase_53	AC	22 ms 24,964 KB
testcase_54	AC	22 ms 25,208 KB
testcase_55	AC	22 ms 25,220 KB
testcase_56	AC	22 ms 25,220 KB
testcase_57	AC	22 ms 24,836 KB
testcase_58	AC	21 ms 24,964 KB
testcase_59	AC	22 ms 25,220 KB
testcase_60	AC	22 ms 24,836 KB
testcase_61	AC	22 ms 25,220 KB
testcase_62	AC	21 ms 25,220 KB
testcase_63	AC	22 ms 24,964 KB
testcase_64	AC	21 ms 24,580 KB
testcase_65	AC	22 ms 24,580 KB
testcase_66	AC	22 ms 24,964 KB
testcase_67	AC	22 ms 24,836 KB
testcase_68	AC	24 ms 24,452 KB
testcase_69	AC	24 ms 25,220 KB
testcase_70	AC	24 ms 25,220 KB
testcase_71	AC	24 ms 24,964 KB
testcase_72	AC	24 ms 25,220 KB
testcase_73	AC	25 ms 25,196 KB
testcase_74	AC	27 ms 25,196 KB
testcase_75	AC	26 ms 25,424 KB
testcase_76	AC	27 ms 24,800 KB
testcase_77	AC	27 ms 24,812 KB
testcase_78	AC	27 ms 24,928 KB
testcase_79	AC	25 ms 24,940 KB
testcase_80	AC	25 ms 24,812 KB
testcase_81	AC	24 ms 25,452 KB
testcase_82	AC	24 ms 24,812 KB
testcase_83	AC	24 ms 24,544 KB
testcase_84	AC	23 ms 24,556 KB
testcase_85	AC	24 ms 24,812 KB
testcase_86	AC	23 ms 24,556 KB
testcase_87	AC	24 ms 25,196 KB
testcase_88	AC	24 ms 24,556 KB
testcase_89	AC	24 ms 25,196 KB
testcase_90	AC	24 ms 25,196 KB
testcase_91	AC	25 ms 25,472 KB
testcase_92	AC	120 ms 24,812 KB
testcase_93	AC	110 ms 25,196 KB
testcase_94	AC	108 ms 24,812 KB
testcase_95	AC	140 ms 25,196 KB
testcase_96	AC	141 ms 24,812 KB
testcase_97	AC	144 ms 24,940 KB
testcase_98	AC	132 ms 24,812 KB
testcase_99	AC	139 ms 25,196 KB
testcase_100	AC	112 ms 24,824 KB
testcase_101	AC	132 ms 25,196 KB
evil_1_rnd_1.txt	AC	259 ms 24,428 KB
evil_1_rnd_2.txt	AC	264 ms 24,812 KB
evil_2_big_1.txt	AC	324 ms 25,196 KB
evil_2_big_2.txt	AC	327 ms 24,428 KB
evil_2_big_3.txt	AC	328 ms 25,196 KB
evil_3_sorted_1.txt	AC	186 ms 25,208 KB
evil_4_sorted_rev_1.txt	AC	159 ms 25,220 KB
evil_4_sorted_rev_2.txt	AC	226 ms 24,964 KB
evil_400_sorted.txt	AC	305 ms 24,568 KB
evil_400_sorted_rev.txt	AC	334 ms 25,448 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
#include <atcoder/all>
#define SELECTER(_1,_2,_3,SELECT,...) SELECT
#define rep1(i,n) for(int i=0;i<(int)n;++i)
#define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i)
#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT
#define rrep1(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define rrep2(i,a,n) for(int i=(int)(n)-1;i>=(int)a;--i)
#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define PrintR LogOutput
#ifdef _DEBUG
#define Log(...) LogOutput(__VA_ARGS__)
#else
#define Log(...)
#endif
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
using pdd=pair<long double,long double>;
using tp=tuple<int,int,int>;
using tpll=tuple<ll,ll,ll>;
using veci=vector<int>;
using vecpii=vector<pair<int,int>>;
using vecll=vector<long long>;
using vecpll=vector<pair<long long,long long>>;
using vecpdd=vector<pair<long double,long double>>;
using vecs=vector<string>;
using vecb=vector<bool>;
using vecd=vector<long double>;
using vectp=vector<tp>;
using vectpll=vector<tpll>;
using mint=modint998244353;
using mint10=modint1000000007;
template<typename T, typename S>
istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;}
template<typename T, typename S>
ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;}
ostream& operator<<(ostream& out, const mint& a){return out << a.val();}
ostream& operator<<(ostream& out, const mint10& a){return out << a.val();}
ostream& operator<<(ostream& out, const modint& a){return out << a.val();}
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;}
template<typename T, typename S>
pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};}
template<typename T, typename S>
pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};}
template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;}
template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;}
bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;}
bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;}

constexpr ll INF=numeric_limits<ll>::max() / 4;
constexpr int inf=numeric_limits<int>::max() / 2;
constexpr ll MOD=998244353;
const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0};

template<typename... Args>
void LogOutput(Args&&... args){
	stringstream ss;
	((ss << args << ' '), ...);
	cout << ss.str().substr(0, ss.str().length() - 1) << endl;
}
template<typename T>
void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);}

int main(){
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n;cin>>n;
	vector<int> a(n);
	iota(all(a), 1);
	auto f = [&](char c){
		PrintR(c, a);
		if(c == '!') exit(0);
		int r;cin>>r;
		assert(r >= 0);
		return r;
	};
	if(n <= 10){
		auto kf = [&](int k){
			vector<int> b(n);
			iota(all(a), 1);
			iota(all(b), 1);
			rep(i, n){
				int s = 1;
				rep(j, 1, n - i) s *= j;
				rrep(j, b.size()){
					if(k >= s * j){
						k -= s * j;
						a[i] = b[j];
						b.erase(b.begin() + j);
						break;
					}
				}
			}
		};
		int s = 1;
		rep(i, 1, n + 1) s *= i;
		int l = 0, r = s;
		while(r - l > 1){
			int mid = (l + r) / 2;
			kf(mid);
			if(f('?')) l = mid;
			else r = mid;
		}
		kf(l);
		f('!');
	}
	vector<int> b(n);
	iota(all(b), 1);
	rep(i, n){
		int l = 0, r = b.size();
		while(r - l > 1){
			int mid = (l + r) / 2;
			a[i] = b[mid];
			int v = 0;
			rep(j, i + 1, n){
				if(v == mid) v++;
				a[j] = b[v++];
			}
			if(f('?')) 	l = mid;
			else r = mid;
		}
		a[i] = b[l];
		b.erase(b.begin() + l);
	}
	f('!');
}

yukicoder

結果

テストケース

ソースコード