#918774 (C++23) No.2496 LCM between Permutations

提出ソース

結果

問題	No.2496 LCM between Permutations
ユーザー	sgfc
提出日時	2023-10-06 23:16:25
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	114 ms / 2,000 ms
コード長	5,546 bytes
コンパイル時間	6,111 ms
コンパイル使用メモリ	323,488 KB
実行使用メモリ	25,476 KB
平均クエリ数	953.34
最終ジャッジ日時	2024-07-26 16:59:37
合計ジャッジ時間	8,790 ms
ジャッジサーバーID （参考情報）	judge3 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	27 ms 25,196 KB
testcase_01	AC	23 ms 24,836 KB
testcase_02	AC	22 ms 24,964 KB
testcase_03	AC	23 ms 24,836 KB
testcase_04	AC	24 ms 25,220 KB
testcase_05	AC	24 ms 25,220 KB
testcase_06	AC	24 ms 25,076 KB
testcase_07	AC	24 ms 24,836 KB
testcase_08	AC	24 ms 25,476 KB
testcase_09	AC	25 ms 25,220 KB
testcase_10	AC	25 ms 24,964 KB
testcase_11	AC	24 ms 25,208 KB
testcase_12	AC	23 ms 24,836 KB
testcase_13	AC	24 ms 24,836 KB
testcase_14	AC	24 ms 24,836 KB
testcase_15	AC	30 ms 24,812 KB
testcase_16	AC	31 ms 24,556 KB
testcase_17	AC	33 ms 25,196 KB
testcase_18	AC	91 ms 25,476 KB
testcase_19	AC	70 ms 24,964 KB
testcase_20	AC	95 ms 24,580 KB
testcase_21	AC	82 ms 24,580 KB
testcase_22	AC	79 ms 24,964 KB
testcase_23	AC	105 ms 25,092 KB
testcase_24	AC	89 ms 24,580 KB
testcase_25	AC	112 ms 24,964 KB
testcase_26	AC	111 ms 24,556 KB
testcase_27	AC	112 ms 24,940 KB
testcase_28	AC	114 ms 25,196 KB

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

ソースコード

raw source code

#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>

#include <stdio.h>
#include <math.h>
#include <cassert>

#include "atcoder/all"
#include <float.h>

//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
// std::fixed << std::setprecision(10) <<

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;

const double eps = 1e-9;

#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define REPI(i, init, n) for (ll i = init; i < ll(n); ++i)
#define REPD(i, init) for (ll i = init; i >=0; --i)
#define REPDI(i, init, n) for (ll i = init; i >=n; --i)
#define REPE(i, c) for (const auto& i : c)
#define TCASE() ll t; cin >> t; REP(i, t)

using vl = vector<ll>;
#define VL(a, n) vector<ll> a; a.assign(n, 0);
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;
using vvl = vector<vector<ll>>;
#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);
using vd = vector<double>;
using pl = pair<ll, ll>;

struct uv { ll u; ll v; ll c; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }
vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;
using vm = vector<mint>;
using vvm = vector<vm>;

void yn(bool f) { std::cout << (f ? "Yes" : "No") << endl; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };
template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } };

const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値
auto gmax(const auto& a, const auto& b) { return a > b ? a : b; };
auto gmin(const auto& a, const auto& b) { return a < b ? a : b; };
template<class T, class U> bool chmin(T& a, const U& b) { const T olda = a; a = gmin(a, b); return olda != a; }
template<class T, class U> bool chmax(T& a, const U& b) { const T olda = a; a = gmax(a, b); return olda != a; }
template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };
template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };
template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };

vector<bool> pr;
void Eratosthenes(int n) {
	pr.assign(n, false);
	for (int i = 0; i < n; i++) {
		pr[i] = true;
	}
	pr[0] = pr[1] = false;
	for (int i = 2; i < n; i++) {
		if (pr[i]) {
			for (int j = 0; i * (j + 2) < n; j++) {
				pr[i * (j + 2)] = false;
			}
		}
	}
}

ll question(ll a, ll b) {
	cout << "? " << a + 1 << " " << b + 1 << endl;
	ll ret;
	cin >> ret;
	return ret;
}	

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	ll n;
	cin >> n;

	if (n == 1) {
		cout << "! 1 1" << endl;
		return 0;
	}

	Eratosthenes(n + 1);

	//n以下の最大の素数を求める
	ll mpr = 0;
	REPD(i, n) {
		if (pr[i]) {
			mpr = i;
			break;
		}
	}

	vl ansa(n, -1);
	vl ansb(n, -1);

	//a[0]と全てのbについて確認する
	map<ll, vl> mp;
	ll dib = 0;
	REP(i, n) {
		ll ans = question(0, i);
		mp[ans].push_back(i);
		if (ans % mpr == 0) dib = i;
	}

	if (mp.begin()->second.size() == 1) {
		//a[0]は1
		ansa[0] = 1;

		ll b1i = 0;
		REP(i, n) {
			ll ans = question(0, i);
			ansb[i] = ans;
			if (ans == 1) b1i = i;
		}
		REP(i, n) {
			if (i == 0) continue;
			ll ans = question(i, b1i);
			ansa[i] = ans;
		}
	}
	else if (mp.begin()->second.size() == 2) {
		//a[0]は素数
		ansa[0] = mp.begin()->first;
		//どちらかが1
		ll b0 = mp.begin()->second[0];
		ll b1 = mp.begin()->second[1];

		ll a1b0 = question(1, b0);
		ll a1b1 = question(1, b1);

		ll b1t = -1;
		if (a1b0 < a1b1) {
			ansb[b0] = 1;
			ansb[b1] = ansa[0];
			b1t = b0;
		}
		else {
			ansb[b1] = 1;
			ansb[b0] = ansa[0];
			b1t = b1;
		}

		ll a1i = 0;
		REP(i, n) {
			if (ansa[i] != -1) continue;
			ll ans = question(i, b1t);
			ansa[i] = ans;
			if (ans == 1) a1i = i;
		}
		REP(i, n) {
			if (ansb[i] != -1) continue;
			ll ans = question(a1i, i);
			ansb[i] = ans;
		}
	}
	else {
		//a[0]は合成数
		ansb[dib] = mpr;

		vl unk; //確定しない要素が2個あるはず
		REP(i, n) {
			if (ansa[i] != -1) continue;
			ll ans = question(i, dib);
			if (ans == mpr) {
				unk.push_back(i);
			}
			else {
				ansa[i] = ans / mpr;
			}
		}

		ll tb = 0; //このbで確認する
		if (dib == 0) tb++;

		ll a0b0 = question(unk[0], tb);
		ll a1b0 = question(unk[1], tb);

		ll a1t = -1;
		if (a0b0 < a1b0) {
			ansa[unk[0]] = 1;
			ansa[unk[1]] = mpr;
			ansb[tb] = a0b0;
			a1t = unk[0];
		}
		else {
			ansa[unk[1]] = 1;
			ansa[unk[0]] = mpr;
			ansb[tb] = a1b0;
			a1t = unk[1];
		}

		REP(i, n) {
			if (ansb[i] != -1) continue;
			ll ans = question(a1t, i);
			ansb[i] = ans;
		}
	}
	cout << "!";
	REP(i, n) {
		cout << " " << ansa[i];
	}
	REP(i, n) {
		cout << " " << ansb[i];
	}
	cout << endl;
}

yukicoder

結果

テストケース

ソースコード