結果
| 問題 | No.2495 Three Sets |
| ユーザー |
 tokusakurai
|
| 提出日時 | 2023-10-06 22:49:06 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 9,450 bytes |
| コンパイル時間 | 2,147 ms |
| コンパイル使用メモリ | 207,188 KB |
| 最終ジャッジ日時 | 2025-02-17 05:24:26 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | RE * 3 |
| other | WA * 1 RE * 17 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for (int i = 0; i < (n); i++)#define per(i, n) for (int i = (n)-1; i >= 0; i--)#define rep2(i, l, r) for (int i = (l); i < (r); i++)#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)#define each(e, v) for (auto &e : v)#define MM << " " <<#define pb push_back#define eb emplace_back#define all(x) begin(x), end(x)#define rall(x) rbegin(x), rend(x)#define sz(x) (int)x.size()using ll = long long;using pii = pair<int, int>;using pil = pair<int, ll>;using pli = pair<ll, int>;using pll = pair<ll, ll>;template <typename T>using minheap = priority_queue<T, vector<T>, greater<T>>;template <typename T>using maxheap = priority_queue<T>;template <typename T>bool chmax(T &x, const T &y) {return (x < y) ? (x = y, true) : false;}template <typename T>bool chmin(T &x, const T &y) {return (x > y) ? (x = y, true) : false;}template <typename T>int flg(T x, int i) {return (x >> i) & 1;}int pct(int x) { return __builtin_popcount(x); }int pct(ll x) { return __builtin_popcountll(x); }int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }template <typename T>void print(const vector<T> &v, T x = 0) {int n = v.size();for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');if (v.empty()) cout << '\n';}template <typename T>void printn(const vector<T> &v, T x = 0) {int n = v.size();for (int i = 0; i < n; i++) cout << v[i] + x << '\n';}template <typename T>int lb(const vector<T> &v, T x) {return lower_bound(begin(v), end(v), x) - begin(v);}template <typename T>int ub(const vector<T> &v, T x) {return upper_bound(begin(v), end(v), x) - begin(v);}template <typename T>void rearrange(vector<T> &v) {sort(begin(v), end(v));v.erase(unique(begin(v), end(v)), end(v));}template <typename T>vector<int> id_sort(const vector<T> &v, bool greater = false) {int n = v.size();vector<int> ret(n);iota(begin(ret), end(ret), 0);sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });return ret;}template <typename T>void reorder(vector<T> &a, const vector<int> &ord) {int n = a.size();vector<T> b(n);for (int i = 0; i < n; i++) b[i] = a[ord[i]];swap(a, b);}template <typename T>T floor(T x, T y) {assert(y != 0);if (y < 0) x = -x, y = -y;return (x >= 0 ? x / y : (x - y + 1) / y);}template <typename T>T ceil(T x, T y) {assert(y != 0);if (y < 0) x = -x, y = -y;return (x >= 0 ? (x + y - 1) / y : x / y);}template <typename S, typename T>pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {return make_pair(p.first + q.first, p.second + q.second);}template <typename S, typename T>pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {return make_pair(p.first - q.first, p.second - q.second);}template <typename S, typename T>istream &operator>>(istream &is, pair<S, T> &p) {S a;T b;is >> a >> b;p = make_pair(a, b);return is;}template <typename S, typename T>ostream &operator<<(ostream &os, const pair<S, T> &p) {return os << p.first << ' ' << p.second;}struct io_setup {io_setup() {ios_base::sync_with_stdio(false);cin.tie(NULL);cout << fixed << setprecision(15);cerr << fixed << setprecision(15);}} io_setup;constexpr int inf = (1 << 30) - 1;constexpr ll INF = (1LL << 60) - 1;// constexpr int MOD = 1000000007;constexpr int MOD = 998244353;template <typename T>vector<T> divisors(const T &n) {vector<T> ret;for (T i = 1; i * i <= n; i++) {if (n % i == 0) {ret.push_back(i);if (i * i != n) ret.push_back(n / i);}}sort(begin(ret), end(ret));return ret;}template <typename T>vector<pair<T, int>> prime_factor(T n) {vector<pair<T, int>> ret;for (T i = 2; i * i <= n; i++) {int cnt = 0;while (n % i == 0) cnt++, n /= i;if (cnt > 0) ret.emplace_back(i, cnt);}if (n > 1) ret.emplace_back(n, 1);return ret;}template <typename T>bool is_prime(const T &n) {if (n == 1) return false;for (T i = 2; i * i <= n; i++) {if (n % i == 0) return false;}return true;}// 1,2,...,n のうち k と互いに素である自然数の個数template <typename T>T count_coprime(T n, T k) {vector<pair<T, int>> ps = prime_factor(k);int m = ps.size();T ret = 0;for (int i = 0; i < (1 << m); i++) {T prd = 1;for (int j = 0; j < m; j++) {if ((i >> j) & 1) prd *= ps[j].first;}ret += (__builtin_parity(i) ? -1 : 1) * (n / prd);}return ret;}vector<bool> Eratosthenes(const int &n) {vector<bool> ret(n + 1, true);if (n >= 0) ret[0] = false;if (n >= 1) ret[1] = false;for (int i = 2; i * i <= n; i++) {if (!ret[i]) continue;for (int j = i + i; j <= n; j += i) ret[j] = false;}return ret;}vector<int> Eratosthenes2(const int &n) {vector<int> ret(n + 1);iota(begin(ret), end(ret), 0);if (n >= 0) ret[0] = -1;if (n >= 1) ret[1] = -1;for (int i = 2; i * i <= n; i++) {if (ret[i] < i) continue;for (int j = i + i; j <= n; j += i) ret[j] = min(ret[j], i);}return ret;}// n 以下の素数の数え上げtemplate <typename T>T count_prime(T n) {if (n < 2) return 0;vector<T> ns = {0};for (T i = n; i > 0; i = n / (n / i + 1)) ns.push_back(i);vector<T> h = ns;for (T &x : h) x--;for (T x = 2, m = sqrtl(n), k = ns.size(); x <= m; x++) {if (h[k - x] == h[k - x + 1]) continue; // h(x-1,x-1) = h(x-1,x) ならば x は素数ではないT x2 = x * x, pi = h[k - x + 1];for (T i = 1, j = ns[i]; i < k && j >= x2; j = ns[++i]) h[i] -= h[i * x <= m ? i * x : k - j / x] - pi;}return h[1];}// i 以下で i と互いに素な自然数の個数のテーブルvector<int> Euler_totient_table(const int &n) {vector<int> dp(n + 1, 0);for (int i = 1; i <= n; i++) dp[i] = i;for (int i = 2; i <= n; i++) {if (dp[i] == i) {dp[i]--;for (int j = i + i; j <= n; j += i) {dp[j] /= i;dp[j] *= i - 1;}}}return dp;}// 約数包除に用いる係数テーブル (平方数で割り切れるなら 0、素因数の種類が偶数なら +1、奇数なら -1)vector<int> inclusion_exclusion_table(int n) {auto p = Eratosthenes2(n);vector<int> ret(n + 1, 0);if (n >= 1) ret[1] = 1;for (int i = 2; i <= n; i++) {int x = p[i], j = i / x;ret[i] = (p[j] == x ? 0 : -ret[j]);}return ret;}int query(int i, int j) {cout << "? " << i + 1 MM j + 1 MM endl;int x;cin >> x;return x;}void answer(vector<int> a, vector<int> b) {cout << "!";each(e, a) cout << " " << e;each(e, b) cout << " " << e;cout << endl;}void solve() {int N;cin >> N;vector<int> a(N), b(N);if (N == 1) {a[0] = 1;b[0] = 1;answer(a, b);return;}auto judge = [&](int x) {auto ps = prime_factor(x);each(e, ps) {if (e.first * 2 > N) return e.first;}return -1;};auto solve = [&](int i, int x, bool rev) {if (!rev) {// b[i] = xvector<int> ids;rep(j, N) {a[j] = query(j, i) / x;if (a[j] == 1) ids.eb(j);}assert(sz(ids) == 2);int k = ids[0];if (query(k, (i + 1) % N) % x == 0) {a[k] = x;k = ids[1];} else {a[ids[1]] = x;}// a[k] = 1rep(j, N) {if (j == i) {b[j] = x;} else {b[j] = query(k, j);}}} else {// a[i] = xvector<int> ids;rep(j, N) {b[j] = query(i, j) / x;if (b[j] == 1) ids.eb(j);}assert(sz(ids) == 2);int k = ids[0];if (query((i + 1) % N, k) % x == 0) {b[k] = x;k = ids[1];} else {b[ids[1]] = x;}// b[k] = 1rep(j, N) {if (j == i) {a[j] = x;} else {a[j] = query(j, k);}}}};int x = judge(query(0, 0));if (x != -1) {if (query(0, 1) % x == 0) {solve(0, x, true);} else {solve(0, x, false);}} else {rep2(i, 1, N) {int y = query(0, i);if (y != -1) {solve(i, y, false);break;}}}answer(a, b);}int main() {int T = 1;// cin >> T;while (T--) solve();}