結果

問題 No.2497 GCD of LCMs
ユーザー au7777au7777
提出日時 2023-10-08 20:32:52
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 5,128 bytes
コンパイル時間 4,157 ms
コンパイル使用メモリ 254,308 KB
実行使用メモリ 10,272 KB
最終ジャッジ日時 2024-07-26 18:12:41
合計ジャッジ時間 12,166 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
10,272 KB
testcase_01 AC 4 ms
6,812 KB
testcase_02 AC 11 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 1 ms
6,940 KB
testcase_06 AC 16 ms
6,940 KB
testcase_07 AC 357 ms
6,944 KB
testcase_08 TLE -
testcase_09 TLE -
testcase_10 AC 1,601 ms
6,944 KB
testcase_11 AC 1,086 ms
6,944 KB
testcase_12 TLE -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <atcoder/all>
typedef long long int ll;
using namespace std;
typedef pair<ll, ll> P;
using namespace atcoder;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
#define USE998244353
#ifdef USE998244353
const ll MOD = 998244353;
// const double PI = 3.1415926535897932;
using mint = modint998244353;
#else
const ll MOD = 1000000007;
using mint = modint1000000007;
#endif
const int MAX = 2000001;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll x, ll y) {
   if (y == 0) return x;
   else if (y > x) {
       return gcd (y, x); 
   }
   else return gcd(x % y, y);
}
ll lcm(ll x, ll y) {
   return x / gcd(x, y) * y;
}
ll my_sqrt(ll x) {
    // 
    ll m = 0;
    ll M = 3000000001;
    while (M - m > 1) {
        ll now = (M + m) / 2;
        if (now * now <= x) {
            m = now;
        }
        else {
            M = now;
        }
    }
    return m;
}
ll keta(ll num, ll arity) {
    ll ret = 0;
    while (num) {
        num /= arity;
        ret++;
    }
    return ret;
}
ll ceil(ll n, ll m) {
    // n > 0, m > 0
    ll ret = n / m;
    if (n % m) ret++;
    return ret;
}
ll pow_ll(ll x, ll n) {
    if (n == 0) return 1;
    if (n % 2) {
        return pow_ll(x, n - 1) * x;
    }
    else {
        ll tmp = pow_ll(x, n / 2);
        return tmp * tmp;
    }
}
vector<ll> compress(vector<ll>& v) {
    // [3 5 5 6 1 1 10 1] -> [1 2 2 3 0 0 4 0] 
    vector<ll> u = v;
    sort(u.begin(), u.end());
    u.erase(unique(u.begin(),u.end()),u.end());
    map<ll, ll> mp;
    for (int i = 0; i < u.size(); i++) {
        mp[u[i]] = i;
    }
    for (int i = 0; i < v.size(); i++) {
        v[i] = mp[v[i]];
    }
    return v;
}

vector<ll> Eratosthenes( const ll N )
{
    vector<bool> is_prime( N + 1 );
    for( ll i = 0; i <= N; i++ )
    {
        is_prime[ i ] = true;
    }
    vector<ll> P;
    for( ll i = 2; i <= N; i++ )
    {
        if( is_prime[ i ] )
        {
            for( ll j = 2 * i; j <= N; j += i )
            {
                is_prime[ j ] = false;
            }
            P.emplace_back( i );
        }
    }
    return P;
}

// unordered_map<ll, ll> um;

unordered_map<ll, ll> itom(ll n) {
    unordered_map<ll, ll> ret;
    ll N = n;
    for (ll i = 2; i * i <= N; i++) {
        if (n % i == 0) {
            ll cnt = 0;
            while (n % i == 0) {
                n /= i;
                cnt++;
            }
            ret[i] = cnt;
        }
    }
    if (n > 1) {
        ret[n] = 1;
    } 
    return ret;
}

unordered_map<ll, ll> add(const unordered_map<ll, ll>& original, const unordered_map<ll, ll>& put) {
    unordered_map<ll, ll> ret;
    for (auto keyval : original) {
        ret[keyval.first] = keyval.second;
    }
    for (auto keyval : put) {
        ret[keyval.first] = max(ret[keyval.first], keyval.second);
    }
    return ret;
}

bool chmin(unordered_map<ll, ll>& original, const unordered_map<ll, ll>& put) {
    if (original.size() == 0) {
        original = put;
        return true;
    }
    bool update = false;
    for (auto keyval : original) {
        ll key = keyval.first;
        ll val = keyval.second;
        ll put_val;
        if (put.find(key) == put.end()) {
            put_val = 0;
        }
        else {
            put_val = put.find(key)->second;
        }
        if (put_val < val) {
            update = true;
            original[key] = put_val;
        }
    }
    return update;
}

void output(unordered_map<ll, ll> um) {
    for (auto keyval : um) {
        cerr << keyval.first << ' ' << keyval.second << '\n';
    }
}

mint umtov(unordered_map<ll, ll> um) {
    mint ret = 1;
    for (auto keyval : um) {
        ret *= pow_mod(keyval.first, keyval.second, MOD);
    }
    return ret;
}

int main() {
    int n, m;
    cin >> n >> m;
    vector<ll> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    vector<vector<int>> edge(n);
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        edge[u].push_back(v);
        edge[v].push_back(u);
    }
    vector<unordered_map<ll, ll>> dp(n);
    dp[0] = itom(a[0]);
    queue<int> que;
    que.push(0);
    vector<int> contain_num(n, 0);
    contain_num[0] = 1;
    while (que.size()) {
        int cur = que.front();
        // cerr << "cur is " << cur << '\n';
        que.pop();
        contain_num[cur]--;
        for (auto nex : edge[cur]) {
            if (chmin(dp[nex], add(dp[cur], itom(a[nex]))) && (contain_num[nex] == 0)) {
                contain_num[nex]++;
                que.push(nex);
            }
        }
    }
    for (int i = 0; i < n; i++) {
        cout << umtov(dp[i]).val() << '\n';
    }
    return 0;
}
0