#1150165 (C++17) No.3461 Min GCD

• 問題: No.3461 Min GCD
• ユーザー: jupiter_68
• 提出日時: 2026-02-28 14:18:57
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 324 ms / 2,000 ms
• コード長: 3,665 bytes
• コンパイル時間: 2,525 ms
• コンパイル使用メモリ: 222,204 KB
• 実行使用メモリ: 20,864 KB
• 最終ジャッジ日時: 2026-02-28 14:19:05
• 合計ジャッジ時間: 6,647 ms
• ジャッジサーバーID （参考情報）: judge4 / judge7

ファイルパターン	結果
sample	AC * 3
other	AC * 21

ソースコード

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using vl = vector<ll>;
template <class T> using vec = vector<T>;
template <class T> using vv = vec<vec<T>>;
template <class T> using vvv = vv<vec<T>>;
template <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;
#define all(a) (a).begin(),(a).end()
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define reps(i, l, r) for(ll i = (l); i < (r); ++i)
#define rrep(i, l, r) for(ll i = (r)-1; i >= (l); --i)
#define sz(x) (ll) (x).size()
template <typename T>
bool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }
template <typename T>
bool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }

struct Edge {
    ll from, to, cost;
    Edge (ll from, ll to, ll cost = 1ll) : from(from), to(to), cost(cost) {}
};
struct Graph {
    vector<vector<Edge>> G;
    Graph() = default;
    explicit Graph(ll N) : G(N) {}
    size_t size() const {
        return G.size();
    }
    void add(ll from, ll to, ll cost = 1ll, bool direct = 0) {
        G[from].emplace_back(from, to, cost);
        if (!direct) G[to].emplace_back(to, from, cost);
    }
    vector<Edge> &operator[](const int &k) {
        return G[k];
    }
};
using Edges = vector<Edge>;

const ll mod = 998244353; // 1000000007;

struct mint {
    ll x;
    mint(ll y = 0) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    mint &operator+=(const mint &p) {
        if ((x += p.x) >= mod) x -= mod;
        return *this;
    }
    mint &operator-=(const mint &p) {
        if ((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }
    mint &operator*=(const mint &p) {
        x = (ll)(1ll * x * p.x % mod);
        return *this;
    }
    mint &operator/=(const mint &p) {
        *this *= p.inv();
        return *this;
    }
    mint operator-() const { return mint(-x); }
    mint operator+(const mint &p) const { return mint(*this) += p; }
    mint operator-(const mint &p) const { return mint(*this) -= p; }
    mint operator*(const mint &p) const { return mint(*this) *= p; }
    mint operator/(const mint &p) const { return mint(*this) /= p; }
    bool operator==(const mint &p) const { return x == p.x; }
    bool operator!=(const mint &p) const { return x != p.x; }
    friend ostream &operator<<(ostream &os, const mint &p) { return os << p.x; }
    friend istream &operator>>(istream &is, mint &a) {
        ll t; is >> t; a = mint(t); return (is);
    }
    mint inv() const { return pow(mod - 2); }
    mint pow(ll n) const {
        mint ret(1), mul(x);
        while (n > 0) {
            if (n & 1) ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }
};

void solve(){
    ll N, K; cin >> N >> K;
    ll MX = 100009;
    vl a(N); rep(i, N) cin >> a[i];
    vl b(N); rep(i, N) cin >> b[i];
    ll ok = 1, ng = *min_element(all(a)) + 1;
    vv<ll> dp(MX+1);
    reps(i, 1, MX+1){
        for(ll k = i; k <= MX; k += i){
            dp[k].push_back(i);
        }
    }
    while(ng - ok > 1){
        ll mid = (ok + ng) / 2;
        ll cnt = 0;
        rep(i, N){
            ll tmp = 1e18;
            for(ll x : dp[a[i]]){
                if(x < mid) continue;
                ll y = x - (b[i] % x);
                if(y == x) y = 0;
                chmin(tmp, y);
            }
            cnt += tmp;
        }
        if(cnt <= K) ok = mid;
        else ng = mid;
    }
    cout << ok << endl;
}

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    int t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
}