結果
問題 | No.1411 Hundreds of Conditions Sequences |
ユーザー |
![]() |
提出日時 | 2021-08-18 17:51:18 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 217 ms / 2,000 ms |
コード長 | 6,273 bytes |
コンパイル時間 | 2,232 ms |
コンパイル使用メモリ | 206,700 KB |
最終ジャッジ日時 | 2025-01-23 22:56:39 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 62 |
ソースコード
//#pragma GCC optimize("Ofast")//#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;using ll = long long;using ull = unsigned long long;using pii = pair<int, int>;template <class T>using V = vector<T>;template <class T>using VV = V<V<T>>;template <class T>V<T> make_vec(size_t a) {return V<T>(a);}template <class T, class... Ts>auto make_vec(size_t a, Ts... ts) {return V<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));}#define pb push_back#define eb emplace_back#define mp make_pair#define fi first#define se second#define rep(i, n) rep2(i, 0, n)#define rep2(i, m, n) for (int i = m; i < (n); i++)#define per(i, b) per2(i, 0, b)#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)#define ALL(c) (c).begin(), (c).end()#define SZ(x) ((int)(x).size())constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }template <class T, class U>void chmin(T& t, const U& u) {if (t > u) t = u;}template <class T, class U>void chmax(T& t, const U& u) {if (t < u) t = u;}template <class T, class U>ostream& operator<<(ostream& os, const pair<T, U>& p) {os << "(" << p.first << "," << p.second << ")";return os;}template <class T>ostream& operator<<(ostream& os, const vector<T>& v) {os << "{";rep(i, v.size()) {if (i) os << ",";os << v[i];}os << "}";return os;}#ifdef LOCALvoid debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << " " << H;debug_out(T...);}#define debug(...) \cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl#else#define debug(...) (void(0))#define dump(x) (void(0))#endiftemplate <unsigned int MOD>struct ModInt {using uint = unsigned int;using ull = unsigned long long;using M = ModInt;uint v;ModInt(ll _v = 0) { set_norm(_v % MOD + MOD); }M& set_norm(uint _v) { //[0, MOD * 2)->[0, MOD)v = (_v < MOD) ? _v : _v - MOD;return *this;}explicit operator bool() const { return v != 0; }explicit operator int() const { return v; }M operator+(const M& a) const { return M().set_norm(v + a.v); }M operator-(const M& a) const { return M().set_norm(v + MOD - a.v); }M operator*(const M& a) const { return M().set_norm(ull(v) * a.v % MOD); }M operator/(const M& a) const { return *this * a.inv(); }M& operator+=(const M& a) { return *this = *this + a; }M& operator-=(const M& a) { return *this = *this - a; }M& operator*=(const M& a) { return *this = *this * a; }M& operator/=(const M& a) { return *this = *this / a; }M operator-() const { return M() - *this; }M& operator++(int) { return *this = *this + 1; }M& operator--(int) { return *this = *this - 1; }M pow(ll n) const {if (n < 0) return inv().pow(-n);M x = *this, res = 1;while (n) {if (n & 1) res *= x;x *= x;n >>= 1;}return res;}M inv() const {ll a = v, b = MOD, p = 1, q = 0, t;while (b != 0) {t = a / b;swap(a -= t * b, b);swap(p -= t * q, q);}return M(p);}friend ostream& operator<<(ostream& os, const M& a) { return os << a.v; }friend istream& operator>>(istream& in, M& x) {ll v_;in >> v_;x = M(v_);return in;}bool operator<(const M& r) const { return v < r.v; }bool operator>(const M& r) const { return v < *this; }bool operator<=(const M& r) const { return !(r < *this); }bool operator>=(const M& r) const { return !(*this < r); }bool operator==(const M& a) const { return v == a.v; }bool operator!=(const M& a) const { return v != a.v; }static uint get_mod() { return MOD; }};using Mint = ModInt<1000000007>;// using Mint = ModInt<998244353>;// https://cp-algorithms.com/algebra/prime-sieve-linear.htmlconst int maxv = 1000010;// lowest prime factorint lp[maxv];bool pri[maxv];vector<int> pr;void linear_sieve() {for (int i = 2; i < maxv; ++i) pri[i] = true;for (int i = 2; i < maxv; ++i) {if (pri[i]) {lp[i] = i;pr.pb(i);}for (int j = 0;j < (int)pr.size() && pr[j] <= lp[i] && i * pr[j] < maxv; ++j) {pri[i * pr[j]] = false;lp[i * pr[j]] = pr[j];if (i % pr[j] == 0) break;}}}int main() {cin.tie(nullptr);ios::sync_with_stdio(false);int N;cin >> N;V<int> A(N);rep(i, N) cin >> A[i];linear_sieve();VV<pii> dvs(N);V<priority_queue<pii, V<pii>, greater<pii>>> qp(maxv);rep(i, N) {int x = A[i];for (auto p : pr) {if (p * p > x) break;if (x % p == 0) {int k = 0;int a = 1;while (x % p == 0) {k++;a *= p;x /= p;}dvs[i].eb(p, a);}}if (x != 1) dvs[i].eb(x, x);debug(i, dvs[i]);for (auto& [p, a] : dvs[i]) {qp[p].emplace(a, i);while (qp[p].size() > 2) {qp[p].pop();}}}Mint prod = 1;Mint all = 1;rep(i, N) { all *= A[i]; }rep(i, maxv) {if (qp[i].empty()) continue;int x = 1;auto q = qp[i];while (SZ(q)) {chmax(x, q.top().fi);q.pop();}debug(i, x);prod *= x;}debug(prod);rep(i, N) {Mint ans = prod;Mint ex = all / A[i];for (auto p : dvs[i]) {int x = 1, mx = 1;auto q = qp[p.fi];while (SZ(q)) {chmax(mx, q.top().fi);if (q.top().se != i) {chmax(x, q.top().fi);}q.pop();}ans = ans / mx * x;}cout << ex - ans << '\n';}return 0;}