結果
| 問題 | No.2496 LCM between Permutations |
| ユーザー |
 maspy
|
| 提出日時 | 2023-11-07 22:07:02 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 109 ms / 2,000 ms |
| コード長 | 11,971 bytes |
| コンパイル時間 | 3,842 ms |
| コンパイル使用メモリ | 280,104 KB |
| 実行使用メモリ | 25,476 KB |
| 平均クエリ数 | 951.93 |
| 最終ジャッジ日時 | 2024-09-25 23:29:04 |
| 合計ジャッジ時間 | 7,098 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 28 |
ソースコード
#line 1 "/home/maspy/compro/library/my_template.hpp"#if defined(LOCAL)#include <my_template_compiled.hpp>#else#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;using ll = long long;using u32 = unsigned int;using u64 = unsigned long long;using i128 = __int128;using u128 = unsigned __int128;using f128 = __float128;template <class T>constexpr T infty = 0;template <>constexpr int infty<int> = 1'000'000'000;template <>constexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;template <>constexpr u32 infty<u32> = infty<int>;template <>constexpr u64 infty<u64> = infty<ll>;template <>constexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;template <>constexpr double infty<double> = infty<ll>;template <>constexpr long double infty<long double> = infty<ll>;using pi = pair<ll, ll>;using vi = vector<ll>;template <class T>using vc = vector<T>;template <class T>using vvc = vector<vc<T>>;template <class T>using vvvc = vector<vvc<T>>;template <class T>using vvvvc = vector<vvvc<T>>;template <class T>using vvvvvc = vector<vvvvc<T>>;template <class T>using pq = priority_queue<T>;template <class T>using pqg = priority_queue<T, vector<T>, greater<T>>;#define vv(type, name, h, ...) \vector<vector<type>> name(h, vector<type>(__VA_ARGS__))#define vvv(type, name, h, w, ...) \vector<vector<vector<type>>> name( \h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))#define vvvv(type, name, a, b, c, ...) \vector<vector<vector<vector<type>>>> name( \a, vector<vector<vector<type>>>( \b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))// https://trap.jp/post/1224/#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)#define overload4(a, b, c, d, e, ...) e#define overload3(a, b, c, d, ...) d#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)#define FOR_R(...) overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)#define FOR_subset(t, s) \for (ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))#define all(x) x.begin(), x.end()#define len(x) ll(x.size())#define elif else if#define eb emplace_back#define mp make_pair#define mt make_tuple#define fi first#define se second#define stoi stollint popcnt(int x) { return __builtin_popcount(x); }int popcnt(u32 x) { return __builtin_popcount(x); }int popcnt(ll x) { return __builtin_popcountll(x); }int popcnt(u64 x) { return __builtin_popcountll(x); }int popcnt_mod_2(int x) { return __builtin_parity(x); }int popcnt_mod_2(u32 x) { return __builtin_parity(x); }int popcnt_mod_2(ll x) { return __builtin_parityll(x); }int popcnt_mod_2(u64 x) { return __builtin_parityll(x); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }template <typename T>T floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);}template <typename T>T ceil(T x, T y) {return floor(x + y - 1, y);}template <typename T>T bmod(T x, T y) {return x - y * floor(x, y);}template <typename T>pair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};}template <typename T, typename U>T SUM(const vector<U> &A) {T sm = 0;for (auto &&a: A) sm += a;return sm;}#define MIN(v) *min_element(all(v))#define MAX(v) *max_element(all(v))#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))#define UNIQUE(x) \sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()template <typename T>T POP(deque<T> &que) {T a = que.front();que.pop_front();return a;}template <typename T>T POP(pq<T> &que) {T a = que.top();que.pop();return a;}template <typename T>T POP(pqg<T> &que) {T a = que.top();que.pop();return a;}template <typename T>T POP(vc<T> &que) {T a = que.back();que.pop_back();return a;}template <typename F>ll binary_search(F check, ll ok, ll ng, bool check_ok = true) {if (check_ok) assert(check(ok));while (abs(ok - ng) > 1) {auto x = (ng + ok) / 2;(check(x) ? ok : ng) = x;}return ok;}template <typename F>double binary_search_real(F check, double ok, double ng, int iter = 100) {FOR(iter) {double x = (ok + ng) / 2;(check(x) ? ok : ng) = x;}return (ok + ng) / 2;}template <class T, class S>inline bool chmax(T &a, const S &b) {return (a < b ? a = b, 1 : 0);}template <class T, class S>inline bool chmin(T &a, const S &b) {return (a > b ? a = b, 1 : 0);}// ? は -1vc<int> s_to_vi(const string &S, char first_char) {vc<int> A(S.size());FOR(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }return A;}template <typename T, typename U>vector<T> cumsum(vector<U> &A, int off = 1) {int N = A.size();vector<T> B(N + 1);FOR(i, N) { B[i + 1] = B[i] + A[i]; }if (off == 0) B.erase(B.begin());return B;}// stable sorttemplate <typename T>vector<int> argsort(const vector<T> &A) {vector<int> ids(len(A));iota(all(ids), 0);sort(all(ids),[&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });return ids;}// A[I[0]], A[I[1]], ...template <typename T>vc<T> rearrange(const vc<T> &A, const vc<int> &I) {vc<T> B(len(I));FOR(i, len(I)) B[i] = A[I[i]];return B;}#endif#line 1 "/home/maspy/compro/library/other/io2.hpp"#define INT(...) \int __VA_ARGS__; \IN(__VA_ARGS__)#define LL(...) \ll __VA_ARGS__; \IN(__VA_ARGS__)#define STR(...) \string __VA_ARGS__; \IN(__VA_ARGS__)#define CHR(...) \char __VA_ARGS__; \IN(__VA_ARGS__)#define DBL(...) \long double __VA_ARGS__; \IN(__VA_ARGS__)#define VEC(type, name, size) \vector<type> name(size); \read(name)#define VV(type, name, h, w) \vector<vector<type>> name(h, vector<type>(w)); \read(name)void read(int &a) { cin >> a; }void read(long long &a) { cin >> a; }void read(char &a) { cin >> a; }void read(double &a) { cin >> a; }void read(long double &a) { cin >> a; }void read(string &a) { cin >> a; }template <class T, class S> void read(pair<T, S> &p) { read(p.first), read(p.second); }template <class T> void read(vector<T> &a) {for(auto &i : a) read(i);}template <class T> void read(T &a) { cin >> a; }void IN() {}template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {read(head);IN(tail...);}template <typename T, typename U>ostream& operator<<(ostream& os, const pair<T, U>& A) {os << A.fi << " " << A.se;return os;}template <typename T>ostream& operator<<(ostream& os, const vector<T>& A) {for (size_t i = 0; i < A.size(); i++) {if(i) os << " ";os << A[i];}return os;}void print() {cout << "\n";cout.flush();}template <class Head, class... Tail>void print(Head&& head, Tail&&... tail) {cout << head;if (sizeof...(Tail)) cout << " ";print(forward<Tail>(tail)...);}void YES(bool t = 1) { print(t ? "YES" : "NO"); }void NO(bool t = 1) { YES(!t); }void Yes(bool t = 1) { print(t ? "Yes" : "No"); }void No(bool t = 1) { Yes(!t); }void yes(bool t = 1) { print(t ? "yes" : "no"); }void no(bool t = 1) { yes(!t); }#line 3 "main.cpp"#line 2 "/home/maspy/compro/library/random/base.hpp"u64 RNG_64() {static uint64_t x_= uint64_t(chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count())* 10150724397891781847ULL;x_ ^= x_ << 7;return x_ ^= x_ >> 9;}u64 RNG(u64 lim) { return RNG_64() % lim; }ll RNG(ll l, ll r) { return l + RNG_64() % (r - l); }#line 2 "/home/maspy/compro/library/mod/mongomery_modint.hpp"// odd mod.// x の代わりに rx を持つtemplate <int id, typename U1, typename U2>struct Mongomery_modint {using mint = Mongomery_modint;inline static U1 m, r, n2;static constexpr int W = numeric_limits<U1>::digits;static void set_mod(U1 mod) {assert(mod & 1 && mod <= U1(1) << (W - 2));m = mod, n2 = -U2(m) % m, r = m;FOR(5) r *= 2 - m * r;r = -r;assert(r * m == U1(-1));}static U1 reduce(U2 b) { return (b + U2(U1(b) * r) * m) >> W; }U1 x;Mongomery_modint() : x(0) {}Mongomery_modint(U1 x) : x(reduce(U2(x) * n2)){};U1 val() const {U1 y = reduce(x);return y >= m ? y - m : y;}mint &operator+=(mint y) {x = ((x += y.x) >= m ? x - m : x);return *this;}mint &operator-=(mint y) {x -= (x >= y.x ? y.x : y.x - m);return *this;}mint &operator*=(mint y) {x = reduce(U2(x) * y.x);return *this;}mint operator+(mint y) const { return mint(*this) += y; }mint operator-(mint y) const { return mint(*this) -= y; }mint operator*(mint y) const { return mint(*this) *= y; }bool operator==(mint y) const {return (x >= m ? x - m : x) == (y.x >= m ? y.x - m : y.x);}bool operator!=(mint y) const { return not operator==(y); }mint pow(ll n) const {assert(n >= 0);mint y = 1, z = *this;for (; n; n >>= 1, z *= z)if (n & 1) y *= z;return y;}};template <int id>using Mongomery_modint_32 = Mongomery_modint<id, u32, u64>;template <int id>using Mongomery_modint_64 = Mongomery_modint<id, u64, u128>;#line 3 "/home/maspy/compro/library/nt/primetest.hpp"bool primetest(const u64 x) {assert(x < u64(1) << 62);if (x == 2 or x == 3 or x == 5 or x == 7) return true;if (x % 2 == 0 or x % 3 == 0 or x % 5 == 0 or x % 7 == 0) return false;if (x < 121) return x > 1;const u64 d = (x - 1) >> lowbit(x - 1);using mint = Mongomery_modint_64<202311020>;mint::set_mod(x);const mint one(u64(1)), minus_one(x - 1);auto ok = [&](u64 a) -> bool {auto y = mint(a).pow(d);u64 t = d;while (y != one && y != minus_one && t != x - 1) y *= y, t <<= 1;if (y != minus_one && t % 2 == 0) return false;return true;};if (x < (u64(1) << 32)) {for (u64 a: {2, 7, 61})if (!ok(a)) return false;} else {for (u64 a: {2, 325, 9375, 28178, 450775, 9780504, 1795265022}) {if (!ok(a)) return false;}}return true;}#line 6 "main.cpp"void solve() {LL(N);map<pi, int> MP;auto ask = [&](int i, int j) -> int {pi p = {i, j};if (MP.count(p)) return MP[p];++i, ++j;print("?", i, j);INT(x);MP[p] = x;return x;};if (N == 1) {print("!", 1, 1);return;}int p = N;while (!primetest(p)) --p;vc<int> I;FOR(i, N) if (ask(i, i) % p == 0) I.eb(i);int x = 0, y = 0;if (len(I) == 1) {x = I[0], y = I[0];} else {for (auto& a: I) {for (auto& b: I) {if (ask(a, b) % p == 0) continue;int sm = I[0] + I[1];x = sm - a, y = sm - b;}}}vc<int> A(N), B(N);A[x] = B[y] = p;FOR(i, N) {if (i == x) continue;A[i] = ask(i, y) / p;}FOR(i, N) {if (i == y) continue;B[i] = ask(x, i) / p;}print("!", A, B);}signed main() {int T = 1;// INT(T);FOR(T) solve();return 0;}