結果

問題 No.2496 LCM between Permutations
ユーザー ecottea
提出日時 2023-10-06 22:32:27
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 110 ms / 2,000 ms
コード長 7,713 bytes
コンパイル時間 3,838 ms
コンパイル使用メモリ 255,508 KB
最終ジャッジ日時 2025-02-17 05:19:13
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 28
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; // -2^63 2^63 = 9 * 10^18int -2^31 2^31 = 2 * 10^9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vvvvi = vector<vvvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vvvvl = vector<vvvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
const vi DX = { 1, 0, -1, 0 }; // 4
const vi DY = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004003104004004LL; // (int)INFL = 1010931620;
double EPS = 1e-15;
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0; set < (1 << int(d)); ++set) // d
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // mod
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) //
//
template <class T> inline ll pow(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
template <class T> inline T get(T set, int i) { return (set >> i) & T(1); }
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
#endif //
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#ifdef _MSC_VER
#include "localACL.hpp"
#endif
//using mint = modint1000000007;
using mint = modint998244353;
//using mint = modint; // mint::set_mod(m);
namespace atcoder {
inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>;
#endif
#ifdef _MSC_VER // Visual Studio
#include "local.hpp"
#else // gcc
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
inline int msb(__int128 n) { return (n >> 64) != 0 ? (127 - __builtin_clzll((ll)(n >> 64))) : n != 0 ? (63 - __builtin_clzll((ll)(n))) : -1; }
#define gcd __gcd
#define dump(...)
#define dumpel(v)
#define dump_list(v)
#define dump_mat(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) while (1) cout << "OLE"; }
#endif
//O(√n)
/*
* n
*/
bool primeQ(ll n) {
// verify : https://algo-method.com/tasks/319
if (n == 1) return false;
// i = ()
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) return false;
}
return true;
}
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
int n;
cin >> n;
if (n == 1) {
cout << "! 1 1" << endl;
return 0;
}
vl a(n + 1, -1), b(n + 1, -1);
vl B(n + 1, INFL); int i1 = -1, j1 = -1;
repi(j, 1, n) {
cout << "? 1 " << j << endl; // n
cin >> B[j];
if (B[j] == 1) {
i1 = 1;
j1 = j;
}
}
if (i1 != -1) {
repi(j, 1, n) {
cout << "? " << i1 << " " << j << endl; // n
cin >> b[j];
}
repi(i, 1, n) {
cout << "? " << i << " " << j1 << endl; // n
cin >> a[i];
}
cout << "!";
repi(i, 1, n) cout << " " << a[i];
repi(j, 1, n) cout << " " << b[j];
cout << endl;
return 0;
}
a[1] = *min_element(all(B));
ll p = -1;
repir(i, n, 1) if (primeQ(i)) {
p = i;
break;
}
if (a[1] == p) {
int j1 = -1, j2 = -1;
repi(j, 1, n) {
if (B[j] == p) {
if (j1 == -1) j1 = j;
else j2 = j;
}
}
cout << "? 2 " << j1 << endl; // 1
ll x1;
cin >> x1;
cout << "? 2 " << j2 << endl; // 1
ll x2;
cin >> x2;
if (x1 > x2) swap(j1, j2);
b[j1] = 1;
b[j2] = p;
int i1 = 1;
repi(i, 2, n) {
cout << "? " << i << " " << j1 << endl; // n-1
cin >> a[i];
if (a[i] == 1) i1 = i;
}
repi(j, 1, n) {
if (b[j] != -1) continue;
cout << "? " << i1 << " " << j << endl; // n-2
cin >> b[j];
}
cout << "!";
repi(i, 1, n) cout << " " << a[i];
repi(j, 1, n) cout << " " << b[j];
cout << endl;
}
else {
int jp = -1;
repi(j, 1, n) {
if (B[j] == a[1] * p) {
jp = j;
}
}
b[jp] = p;
int i1 = -1, i2 = -1;
repi(i, 2, n) {
cout << "? " << i << " " << jp << endl; // n-1
cin >> a[i];
a[i] /= p;
if (a[i] == 1) {
if (i1 == -1) i1 = i;
else i2 = i;
}
}
if (i2 == -1) {
i2 = 1;
a[1] = p;
}
cout << "? " << i1 << " " << (jp == 1 ? 2 : jp - 1) << endl; // 1
ll x1;
cin >> x1;
cout << "? " << i2 << " " << (jp == 1 ? 2 : jp - 1) << endl; // 1
ll x2;
cin >> x2;
if (x1 > x2) swap(i1, i2);
a[i1] = 1;
a[i2] = p;
repi(j, 1, n) {
if (b[j] != -1) continue;
cout << "? " << i1 << " " << j << endl; // n-1
cin >> b[j];
}
cout << "!";
repi(i, 1, n) cout << " " << a[i];
repi(j, 1, n) cout << " " << b[j];
cout << endl;
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0