結果

問題 No.2496 LCM between Permutations
ユーザー 👑 rin204rin204
提出日時 2023-10-06 22:21:44
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 120 ms / 2,000 ms
コード長 15,616 bytes
コンパイル時間 4,568 ms
コンパイル使用メモリ 261,932 KB
実行使用メモリ 24,372 KB
平均クエリ数 953.28
最終ジャッジ日時 2023-10-06 22:21:53
合計ジャッジ時間 8,486 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 31 ms
24,036 KB
testcase_01 AC 26 ms
23,652 KB
testcase_02 AC 25 ms
24,372 KB
testcase_03 AC 26 ms
23,424 KB
testcase_04 AC 25 ms
24,360 KB
testcase_05 AC 26 ms
23,436 KB
testcase_06 AC 26 ms
23,688 KB
testcase_07 AC 26 ms
24,324 KB
testcase_08 AC 27 ms
23,832 KB
testcase_09 AC 26 ms
23,388 KB
testcase_10 AC 26 ms
24,048 KB
testcase_11 AC 26 ms
24,012 KB
testcase_12 AC 27 ms
23,388 KB
testcase_13 AC 26 ms
23,628 KB
testcase_14 AC 39 ms
23,856 KB
testcase_15 AC 33 ms
23,400 KB
testcase_16 AC 35 ms
24,228 KB
testcase_17 AC 36 ms
23,844 KB
testcase_18 AC 97 ms
23,436 KB
testcase_19 AC 75 ms
23,556 KB
testcase_20 AC 99 ms
24,048 KB
testcase_21 AC 87 ms
24,036 KB
testcase_22 AC 83 ms
23,424 KB
testcase_23 AC 108 ms
24,024 KB
testcase_24 AC 102 ms
24,276 KB
testcase_25 AC 118 ms
23,436 KB
testcase_26 AC 119 ms
24,048 KB
testcase_27 AC 120 ms
23,556 KB
testcase_28 AC 118 ms
23,424 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: 関数 ‘void solve()’ 内:
main.cpp:670:17: 警告: ‘ii’ may be used uninitialized [-Wmaybe-uninitialized]
  670 |             A[ii] = ma;
      |                 ^
main.cpp:658:13: 備考: ‘ii’ はここで定義されています
  658 |         int ii;
      |             ^~
main.cpp:655:30: 警告: ‘ii’ may be used uninitialized [-Wmaybe-uninitialized]
  655 |         fori(j, n) B[j] = ask(ii, j);
      |                           ~~~^~~~~~~
main.cpp:651:13: 備考: ‘ii’ はここで定義されています
  651 |         int ii;
      |             ^~

ソースコード

diff # 

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

namespace templates {
// type
using ll  = long long;
using ull = unsigned long long;
template <class T>
using pq = priority_queue<T>;
template <class T>
using qp = priority_queue<T, vector<T>, greater<T>>;
#define vec(T, A, ...) vector<T> A(__VA_ARGS__);
#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));
#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));

// for loop
#define fori1(a) for (ll _ = 0; _ < (a); _++)
#define fori2(i, a) for (ll i = 0; i < (a); i++)
#define fori3(i, a, b) for (ll i = (a); i < (b); i++)
#define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))
#define overload4(a, b, c, d, e, ...) e
#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)

// declare and input
// clang-format off
#define INT(...) int __VA_ARGS__; inp(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; inp(__VA_ARGS__);
#define STRING(...) string __VA_ARGS__; inp(__VA_ARGS__);
#define CHAR(...) char __VA_ARGS__; inp(__VA_ARGS__);
#define DOUBLE(...) double __VA_ARGS__; STRING(str___); __VA_ARGS__ = stod(str___);
#define VEC(T, A, n) vector<T> A(n); inp(A);
#define VVEC(T, A, n, m) vector<vector<T>> A(n, vector<T>(m)); inp(A);
// clang-format on

// const value
const ll MOD1   = 1000000007;
const ll MOD9   = 998244353;
const double PI = acos(-1);

// other macro
#ifndef RIN__LOCAL
// #define endl "\n"
#endif
#define spa ' '
#define len(A) ll(A.size())
#define all(A) begin(A), end(A)

// function
vector<char> stoc(string &S) {
    int n = S.size();
    vector<char> ret(n);
    for (int i = 0; i < n; i++) ret[i] = S[i];
    return ret;
}
string ctos(vector<char> &S) {
    int n      = S.size();
    string ret = "";
    for (int i = 0; i < n; i++) ret += S[i];
    return ret;
}

template <class T>
auto min(const T &a) {
    return *min_element(all(a));
}
template <class T>
auto max(const T &a) {
    return *max_element(all(a));
}
template <class T, class S>
auto clamp(T &a, const S &l, const S &r) {
    return (a > r ? r : a < l ? l : a);
}
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);
}
template <class T, class S>
inline bool chclamp(T &a, const S &l, const S &r) {
    auto b = clamp(a, l, r);
    return (a != b ? a = b, 1 : 0);
}

template <typename T>
T sum(vector<T> &A) {
    T tot = 0;
    for (auto a : A) tot += a;
    return tot;
}

template <typename T>
vector<T> compression(vector<T> X) {
    sort(all(X));
    X.erase(unique(all(X)), X.end());
    return X;
}

// input and output
namespace io {

// vector<T>
template <typename T>
istream &operator>>(istream &is, vector<T> &A) {
    for (auto &a : A) is >> a;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << ' ';
    }
    return os;
}

// vector<vector<T>>
template <typename T>
istream &operator>>(istream &is, vector<vector<T>> &A) {
    for (auto &a : A) is >> a;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << endl;
    }
    return os;
}

// pair<S, T>
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &A) {
    is >> A.first >> A.second;
    return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, pair<S, T> &A) {
    os << A.first << ' ' << A.second;
    return os;
}

// vector<pair<S, T>>
template <typename S, typename T>
ostream &operator<<(ostream &os, vector<pair<S, T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << endl;
    }
    return os;
}

// set<T>
template <typename T>
ostream &operator<<(ostream &os, set<T> &A) {
    for (auto itr = A.begin(); itr != A.end(); itr++) {
        os << *itr;
        if (next(itr) != A.end()) os << ' ';
    }
    return os;
}

// unordered_set<T>
template <typename T>
ostream &operator<<(ostream &os, unordered_set<T> &A) {
    for (auto itr = A.begin(); itr != A.end(); itr++) {
        os << *itr;
        if (next(itr) != A.end()) os << ' ';
    }
    return os;
}

// multiset<T>
template <typename T>
ostream &operator<<(ostream &os, multiset<T> &A) {
    for (auto itr = A.begin(); itr != A.end(); itr++) {
        os << *itr;
        if (next(itr) != A.end()) os << ' ';
    }
    return os;
}

// unordered_multiset<T>
template <typename T>
ostream &operator<<(ostream &os, unordered_multiset<T> &A) {
    for (auto itr = A.begin(); itr != A.end(); itr++) {
        os << *itr;
        if (next(itr) != A.end()) os << endl;
    }
    return os;
}

// map<S, T>
template <typename S, typename T>
ostream &operator<<(ostream &os, map<S, T> &A) {
    for (auto itr = A.begin(); itr != A.end(); itr++) {
        os << *itr;
        if (next(itr) != A.end()) os << endl;
    }
    return os;
}

// unordered_map<S, T>
template <typename S, typename T>
ostream &operator<<(ostream &os, unordered_map<S, T> &A) {
    for (auto itr = A.begin(); itr != A.end(); itr++) {
        os << *itr;
        if (next(itr) != A.end()) os << endl;
    }
    return os;
}

// tuple
template <typename T, size_t N>
struct TuplePrint {
    static ostream &print(ostream &os, const T &t) {
        TuplePrint<T, N - 1>::print(os, t);
        os << ' ' << get<N - 1>(t);
        return os;
    }
};
template <typename T>
struct TuplePrint<T, 1> {
    static ostream &print(ostream &os, const T &t) {
        os << get<0>(t);
        return os;
    }
};
template <typename... Args>
ostream &operator<<(ostream &os, const tuple<Args...> &t) {
    TuplePrint<decltype(t), sizeof...(Args)>::print(os, t);
    return os;
}

// queue<T>
template <typename T>
ostream &operator<<(ostream &os, queue<T> &A) {
    auto B = A;
    while (!B.empty()) {
        os << B.front();
        B.pop();
        if (!B.empty()) os << ' ';
    }
    return os;
}

// deque<T>
template <typename T>
ostream &operator<<(ostream &os, deque<T> &A) {
    auto B = A;
    while (!B.empty()) {
        os << B.front();
        B.pop_front();
        if (!B.empty()) os << ' ';
    }
    return os;
}

// stack<T>
template <typename T>
ostream &operator<<(ostream &os, stack<T> &A) {
    auto B = A;
    stack<T> C;
    while (!B.empty()) {
        C.push(B.top());
        B.pop();
    }
    while (!C.empty()) {
        os << C.top();
        C.pop();
        if (!C.empty()) os << ' ';
    }
    return os;
}

// priority_queue<T>
template <typename T>
ostream &operator<<(ostream &os, priority_queue<T> &A) {
    auto B = A;
    while (!B.empty()) {
        os << B.top();
        B.pop();
        if (!B.empty()) os << endl;
    }
    return os;
}

// bitset<N>
template <size_t N>
ostream &operator<<(ostream &os, bitset<N> &A) {
    for (size_t i = 0; i < N; i++) {
        os << A[i];
    }
    return os;
}

// io functions
void FLUSH() {
    cout << flush;
}

void print() {
    cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
    cout << head;
    if (sizeof...(Tail)) cout << spa;
    print(forward<Tail>(tail)...);
}

template <typename T, typename S>
void prisep(vector<T> &A, S sep) {
    int n = A.size();
    for (int i = 0; i < n; i++) {
        cout << A[i];
        if (i != n - 1) cout << sep;
    }
    cout << endl;
}
template <typename T, typename S>
void priend(T A, S end) {
    cout << A << end;
}
template <typename T>
void prispa(T A) {
    priend(A, spa);
}
template <typename T, typename S>
bool printif(bool f, T A, S B) {
    if (f)
        print(A);
    else
        print(B);
    return f;
}

template <class... T>
void inp(T &...a) {
    (cin >> ... >> a);
}

} // namespace io
using namespace io;

// read graph
vector<vector<int>> read_edges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<int>> edges(n, vector<int>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        u -= indexed;
        v -= indexed;
        edges[u].push_back(v);
        if (!direct) edges[v].push_back(u);
    }
    return edges;
}
vector<vector<int>> read_tree(int n, int indexed = 1) {
    return read_edges(n, n - 1, false, indexed);
}

template <typename T = long long>
vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        T w;
        inp(w);
        u -= indexed;
        v -= indexed;
        edges[u].push_back({v, w});
        if (!direct) edges[v].push_back({u, w});
    }
    return edges;
}
template <typename T = long long>
vector<vector<pair<int, T>>> read_wtree(int n, int indexed = 1) {
    return read_wedges<T>(n, n - 1, false, indexed);
}

// yes / no
namespace yesno {

// yes
inline bool yes(bool f = true) {
    cout << (f ? "yes" : "no") << endl;
    return f;
}
inline bool Yes(bool f = true) {
    cout << (f ? "Yes" : "No") << endl;
    return f;
}
inline bool YES(bool f = true) {
    cout << (f ? "YES" : "NO") << endl;
    return f;
}

// no
inline bool no(bool f = true) {
    cout << (!f ? "yes" : "no") << endl;
    return f;
}
inline bool No(bool f = true) {
    cout << (!f ? "Yes" : "No") << endl;
    return f;
}
inline bool NO(bool f = true) {
    cout << (!f ? "YES" : "NO") << endl;
    return f;
}

// possible
inline bool possible(bool f = true) {
    cout << (f ? "possible" : "impossible") << endl;
    return f;
}
inline bool Possible(bool f = true) {
    cout << (f ? "Possible" : "Impossible") << endl;
    return f;
}
inline bool POSSIBLE(bool f = true) {
    cout << (f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
    return f;
}

// impossible
inline bool impossible(bool f = true) {
    cout << (!f ? "possible" : "impossible") << endl;
    return f;
}
inline bool Impossible(bool f = true) {
    cout << (!f ? "Possible" : "Impossible") << endl;
    return f;
}
inline bool IMPOSSIBLE(bool f = true) {
    cout << (!f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
    return f;
}

// Alice Bob
inline bool Alice(bool f = true) {
    cout << (f ? "Alice" : "Bob") << endl;
    return f;
}
inline bool Bob(bool f = true) {
    cout << (f ? "Bob" : "Alice") << endl;
    return f;
}

// Takahashi Aoki
inline bool Takahashi(bool f = true) {
    cout << (f ? "Takahashi" : "Aoki") << endl;
    return f;
}
inline bool Aoki(bool f = true) {
    cout << (f ? "Aoki" : "Takahashi") << endl;
    return f;
}

} // namespace yesno
using namespace yesno;

} // namespace templates
using namespace templates;

template <typename T>
T modpow(T a, long long b, T MOD) {
    T ret = 1;
    while (b > 0) {
        if (b & 1) {
            ret *= a;
            ret %= MOD;
        }
        a *= a;
        a %= MOD;
        b >>= 1;
    }
    return ret;
}

bool isPrime(long long n) {
    if (n <= 1)
        return false;
    else if (n == 2)
        return true;
    else if (n % 2 == 0)
        return false;

    long long A[7] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};
    long long s    = 0;
    long long d    = n - 1;
    while (d % 2 == 0) {
        d /= 2;
        s++;
    }

    for (auto a : A) {
        if (a % n == 0) return true;
        long long x = modpow<__int128_t>(a, d, n);
        if (x != 1) {
            bool ng = true;
            for (int i = 0; i < s; i++) {
                if (x == n - 1) {
                    ng = false;
                    break;
                };
                x = __int128_t(x) * x % n;
            }
            if (ng) return false;
        }
    }
    return true;
}
struct RandomNumberGenerator {
    mt19937 mt;
    RandomNumberGenerator() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}
    RandomNumberGenerator(int seed) : mt(seed) {}

    int operator()(int a, int b) {
        uniform_int_distribution<int> dist(a, b - 1);
        return dist(mt);
    }

    int operator()(int b) {
        return (*this)(0, b);
    }
};

vector<int> AA, BB;
int qq = 0;

void init(int &n) {
    qq = 0;
    RandomNumberGenerator rng;
    AA.resize(n);
    BB.resize(n);
    iota(all(AA), 1);
    iota(all(BB), 1);
    fori(i, 1, n) {
        swap(AA[i], AA[rng(i)]);
    }
    fori(i, 1, n) {
        swap(BB[i], BB[rng(i)]);
    }
    // AA = {3, 4, 2, 1};
    // BB = {3, 1, 4, 2};
    // AA = {2, 1};
    // BB = {2, 1};
    // n  = 3;
    // AA = {3, 1, 2};
    // BB = {2, 3, 1};
    print(AA);
    print(BB);
}

void solve() {
    INT(n);
#ifdef RIN__LOCAL
    init(n);
#endif

    vec(int, A, n, -1);
    vec(int, B, n, -1);
    vec(int, C, n, -1);
    vec(int, D, n, -1);
    bool rev = false;

    auto ask = [&](int i, int j) -> int {
        if (rev) swap(i, j);

#ifdef RIN__LOCAL
        return AA[i] * BB[j] / gcd(AA[i], BB[j]);
#endif
        print("?", i + 1, j + 1);
        qq++;
        LL(x);
        return x;
    };

    auto ans = [&]() -> void {
        if (rev) swap(A, B);
        priend("!", " ");
        priend(A, " ");
        print(B);
#ifdef RIN__LOCAL
        assert(qq <= 3 * n);
        assert(A == AA);
        assert(B == BB);
#endif
    };

    if (n == 1) {
        print("! 1 1");
        return;
    } else if (n == 2) {
        vvec(int, C, 2, 2);
        fori(i, 2) fori(j, 2) C[i][j] = ask(i, j);
        fori(i, 2) fori(j, 2) {
            A[i]     = 2;
            B[j]     = 2;
            A[1 - i] = 1;
            B[1 - j] = 1;
            bool ok  = true;
            fori(ii, 2) fori(jj, 2) {
                if (C[ii][jj] != (A[ii] * B[jj] / gcd(A[ii], B[jj]))) ok = false;
            }
            if (ok) {
                ans();
                return;
            };
        }
    }

    int ma = 1;
    fori(j, 1, n + 1) {
        if (isPrime(j)) ma = j;
    }

    int c = 0;
    int jj;
    bool all_ = true;
    // n
    fori(j, n) {
        C[j] = ask(0, j);
        if (C[j] % ma == 0) {
            c++;
            jj = j;
        } else {
            all_ = false;
        }
    }
    // 2n - 1
    if (all_) {
        swap(A, B);
        jj  = 0;
        rev = true;
    }

    A[0] = C[jj];
    fori(i, 1, n) {
        A[i] = ask(i, jj);
    }
    if (max(A) == n) {
        int ii;
        fori(i, n) {
            if (A[i] == 1) ii = i;
        }
        fori(j, n) B[j] = ask(ii, j);
        ans();
    } else {
        int ii;
        fori(i, n) {
            A[i] /= ma;
            if (A[i] == 1) ii = i;
        }
        fori(j, n) B[j] = ask(ii, j);
        if (max(B) == n) {
            fori(i, n) {
                if (A[i] == 1 and i != ii) A[i] = ma;
            }

        } else {
            A[ii] = ma;
            fori(j, n) B[j] /= ma;
            vec(int, ind, 0);
            fori(j, n) {
                if (B[j] == 1) ind.push_back(j);
            }
            assert(ind.size() == 2);
            fori(i, n) {
                if (A[i] == 1) ii = i;
            }
            if (ask(ii, ind[0]) == 1)
                B[ind[1]] = ma;
            else
                B[ind[0]] = ma;
        }
        ans();
    }
}

int main() {
    // cin.tie(0)->sync_with_stdio(0);
    // cout << fixed << setprecision(12);
    int t;
    t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}
0