結果

問題 No.2496 LCM between Permutations
コンテスト
ユーザー noya2
提出日時 2025-03-06 16:48:08
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 135 ms / 2,000 ms
コード長 7,230 bytes
コンパイル時間 4,483 ms
コンパイル使用メモリ 296,388 KB
実行使用メモリ 26,228 KB
平均クエリ数 756.45
最終ジャッジ日時 2025-03-06 16:48:17
合計ジャッジ時間 8,089 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 28
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

const bool LOCAL = 0;
mt19937 jmt(-1);
vector<int> ja, jb;

void solve(){
    int n; in(n);
    if (LOCAL){
        ja.resize(n); iota(all(ja),1); shuffle(all(ja),jmt);
        jb.resize(n); iota(all(jb),1); shuffle(all(jb),jmt);
    }
    int qlim = 3*n;
    auto ask = [&](int i, int j) -> int {
        assert(qlim >= 1);
        assert(0 <= i && i < n);
        assert(0 <= j && j < n);
        qlim--;
        if (LOCAL){
            return lcm(ja[i],jb[j]);
        }
        cout << "? " << i+1 << ' ' << j+1 << endl;
        int x; cin >> x;
        return x;
    };
    auto say = [&](vector<int> a, vector<int> b) -> void {
        if (LOCAL){
            assert(a == ja);
            assert(b == jb);
            cout << "OK" << endl;
            return ;
        }
        cout << "! " << a << ' ' << b << endl;
    };
    vector<int> a(n,-1), b(n,-1);
    mt19937 mt(628);
    vector<int> ids(n); iota(all(ids),0);
    shuffle(all(ids),mt);
    vector<vector<int>> ans(n,vector<int>(n,iinf));
    rep(i,n){
        ans[ids[0]][i] = ask(ids[0],i);
    }
    a[ids[0]] = ranges::min(ans[ids[0]]);
    vector<int> same;
    rep(i,n){
        if (ans[ids[0]][i] == a[ids[0]]){
            same.emplace_back(i);
        }
    }
    repp(j,1,n){
        if (same.size() == 1u) break;
        vector<int> nsame;
        for (int i : same){
            ans[ids[j]][i] = ask(ids[j],i);
        }
        a[ids[j]] = ranges::min(ans[ids[j]]);
        for (int i : same){
            if (ans[ids[j]][i] == a[ids[j]]){
                nsame.emplace_back(i);
            }
        }
        swap(same,nsame);
    }
    assert(same.size() == 1u);
    b[same[0]] = 1;
    rep(i,n){
        if (a[i] != -1) continue;
        a[i] = ask(i,same[0]);
    }
    vector<bool> bdone(n+1,false);
    rep(i,n){
        if (b[i] != -1){
            bdone[b[i]] = true;
        }
    }
    int aone = -1;
    rep(i,n){
        if (a[i] == 1){
            aone = i;
            break;
        }
    }
    rep(i,n){
        if (b[i] != -1) continue;
        vector<int> koho;
        for (int x = 1; x <= n; x++){
            if (bdone[x]) continue;
            if (lcm(a[ids[0]],x) == ans[ids[0]][i]){
                koho.emplace_back(x);
            }
        }
        vector<int> nkoho;
        for (int x : koho){
            bool ok = true;
            rep(j,n){
                if (ans[j][i] == iinf) continue;
                if (lcm(a[j],x) != ans[j][i]){
                    ok = false;
                    break;
                }
            }
            if (ok){
                nkoho.emplace_back(x);
            }
        }
        assert(!nkoho.empty());
        if (nkoho.size() == 1u){
            b[i] = nkoho[0];
        }
        else {
            b[i] = ask(aone,i);
        }
        bdone[b[i]] = true;
    }
    say(a,b);
    return ;
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
0