結果
問題 | No.1411 Hundreds of Conditions Sequences |
ユーザー | tokusakurai |
提出日時 | 2021-02-27 09:41:03 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 364 ms / 2,000 ms |
コード長 | 5,207 bytes |
コンパイル時間 | 2,165 ms |
コンパイル使用メモリ | 208,452 KB |
実行使用メモリ | 20,140 KB |
最終ジャッジ日時 | 2024-04-10 15:18:03 |
合計ジャッジ時間 | 12,411 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 12 ms
14,888 KB |
testcase_01 | AC | 12 ms
15,036 KB |
testcase_02 | AC | 11 ms
14,924 KB |
testcase_03 | AC | 12 ms
14,992 KB |
testcase_04 | AC | 12 ms
14,896 KB |
testcase_05 | AC | 13 ms
14,956 KB |
testcase_06 | AC | 12 ms
15,040 KB |
testcase_07 | AC | 13 ms
14,988 KB |
testcase_08 | AC | 12 ms
15,040 KB |
testcase_09 | AC | 13 ms
15,000 KB |
testcase_10 | AC | 12 ms
14,932 KB |
testcase_11 | AC | 12 ms
14,824 KB |
testcase_12 | AC | 115 ms
17,944 KB |
testcase_13 | AC | 90 ms
17,172 KB |
testcase_14 | AC | 53 ms
16,092 KB |
testcase_15 | AC | 92 ms
17,288 KB |
testcase_16 | AC | 18 ms
14,948 KB |
testcase_17 | AC | 87 ms
17,184 KB |
testcase_18 | AC | 117 ms
17,696 KB |
testcase_19 | AC | 124 ms
18,148 KB |
testcase_20 | AC | 53 ms
16,288 KB |
testcase_21 | AC | 131 ms
18,400 KB |
testcase_22 | AC | 58 ms
16,336 KB |
testcase_23 | AC | 117 ms
17,940 KB |
testcase_24 | AC | 13 ms
14,820 KB |
testcase_25 | AC | 115 ms
17,944 KB |
testcase_26 | AC | 87 ms
17,228 KB |
testcase_27 | AC | 54 ms
16,204 KB |
testcase_28 | AC | 98 ms
17,532 KB |
testcase_29 | AC | 23 ms
15,456 KB |
testcase_30 | AC | 75 ms
16,744 KB |
testcase_31 | AC | 73 ms
16,780 KB |
testcase_32 | AC | 135 ms
18,504 KB |
testcase_33 | AC | 133 ms
18,296 KB |
testcase_34 | AC | 135 ms
18,320 KB |
testcase_35 | AC | 136 ms
18,384 KB |
testcase_36 | AC | 133 ms
18,216 KB |
testcase_37 | AC | 132 ms
18,292 KB |
testcase_38 | AC | 135 ms
18,336 KB |
testcase_39 | AC | 134 ms
18,516 KB |
testcase_40 | AC | 136 ms
18,356 KB |
testcase_41 | AC | 135 ms
18,448 KB |
testcase_42 | AC | 133 ms
18,320 KB |
testcase_43 | AC | 132 ms
18,320 KB |
testcase_44 | AC | 136 ms
18,436 KB |
testcase_45 | AC | 135 ms
18,432 KB |
testcase_46 | AC | 138 ms
18,220 KB |
testcase_47 | AC | 143 ms
18,300 KB |
testcase_48 | AC | 136 ms
18,380 KB |
testcase_49 | AC | 140 ms
18,272 KB |
testcase_50 | AC | 135 ms
18,416 KB |
testcase_51 | AC | 139 ms
18,328 KB |
testcase_52 | AC | 155 ms
18,276 KB |
testcase_53 | AC | 155 ms
18,492 KB |
testcase_54 | AC | 157 ms
18,508 KB |
testcase_55 | AC | 155 ms
18,388 KB |
testcase_56 | AC | 155 ms
18,360 KB |
testcase_57 | AC | 176 ms
18,492 KB |
testcase_58 | AC | 158 ms
18,416 KB |
testcase_59 | AC | 168 ms
18,324 KB |
testcase_60 | AC | 166 ms
18,404 KB |
testcase_61 | AC | 161 ms
18,284 KB |
testcase_62 | AC | 364 ms
17,652 KB |
testcase_63 | AC | 226 ms
20,140 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define each(e, v) for(auto &e: v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; const int MOD = 1000000007; //const int MOD = 998244353; const int inf = (1<<30)-1; const ll INF = (1LL<<60)-1; template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;}; template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;}; struct io_setup{ io_setup(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; template<int mod> struct Mod_Int{ int x; Mod_Int() : x(0) {} Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} Mod_Int &operator += (const Mod_Int &p){ if((x += p.x) >= mod) x -= mod; return *this; } Mod_Int &operator -= (const Mod_Int &p){ if((x += mod - p.x) >= mod) x -= mod; return *this; } Mod_Int &operator *= (const Mod_Int &p){ x = (int) (1LL * x * p.x % mod); return *this; } Mod_Int &operator /= (const Mod_Int &p){ *this *= p.inverse(); return *this; } Mod_Int &operator ++ () {return *this += Mod_Int(1);} Mod_Int operator ++ (int){ Mod_Int tmp = *this; ++*this; return tmp; } Mod_Int &operator -- () {return *this -= Mod_Int(1);} Mod_Int operator -- (int){ Mod_Int tmp = *this; --*this; return tmp; } Mod_Int operator - () const {return Mod_Int(-x);} Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;} Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;} Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;} Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;} bool operator == (const Mod_Int &p) const {return x == p.x;} bool operator != (const Mod_Int &p) const {return x != p.x;} Mod_Int inverse() const { assert(*this != Mod_Int(0)); return pow(mod-2); } Mod_Int pow(long long k) const{ Mod_Int now = *this, ret = 1; for(; k > 0; k >>= 1, now *= now){ if(k&1) ret *= now; } return ret; } friend ostream &operator << (ostream &os, const Mod_Int &p){ return os << p.x; } friend istream &operator >> (istream &is, Mod_Int &p){ long long a; is >> a; p = Mod_Int<mod>(a); return is; } }; using mint = Mod_Int<MOD>; template<typename T> vector<T> divisors(const T &n){ vector<T> ret; for(T i = 1; i*i <= n; i++){ if(n%i == 0){ ret.pb(i); if(i*i != n) ret.pb(n/i); } } sort(all(ret)); return ret; } template<typename T> vector<pair<T, int>> prime_factor(T n){ vector<pair<T, int>> ret; for(T i = 2; i*i <= n; i++){ int cnt = 0; while(n%i == 0) cnt++, n /= i; if(cnt > 0) ret.emplace_back(i, cnt); } if(n > 1) ret.emplace_back(n, 1); return ret; } template<typename T> bool is_prime(const T &n){ if(n == 1) return false; for(T i = 2; i*i <= n; i++){ if(n%i == 0) return false; } return true; } vector<bool> Eratosthenes(const int &n){ vector<bool> ret(n+1, true); if(n >= 0) ret[0] = false; if(n >= 1) ret[1] = false; for(int i = 2; i*i <= n; i++){ if(!ret[i]) continue; for(int j = i+i; j <= n; j += i) ret[j] = false; } return ret; } vector<int> Eratosthenes2(const int &n){ vector<int> ret(n+1); iota(begin(ret), end(ret), 0); if(n >= 0) ret[0] = -1; if(n >= 1) ret[1] = -1; for(int i = 2; i*i <= n; i++){ if(ret[i] < i) continue; for(int j = i+i; j <= n; j += i) ret[j] = min(ret[j], i); } return ret; } int main(){ int N; cin >> N; int MAX = 1000000; vector<int> cnt1(MAX+1, 0), cnt2(MAX+1, 0), id(MAX+1, -1); vector<int> A(N); mint ans = 1; rep(i, N){ cin >> A[i]; for(auto &e: prime_factor(A[i])){ if(cnt1[e.first] < e.second){ id[e.first] = i; cnt2[e.first] = cnt1[e.first]; cnt1[e.first] = e.second; } else if(cnt2[e.first] < e.second){ cnt2[e.first] = e.second; } } ans *= A[i]; } mint ng = 1; rep2(i, 1, MAX){ ng *= mint(i).pow(cnt1[i]); } vector<vector<int>> check(N); rep2(i, 1, MAX){ if(id[i] == -1) continue; check[id[i]].eb(i); } rep(i, N){ mint tmp = 1; for(auto &e: check[i]){ tmp *= mint(e).pow(cnt1[e]-cnt2[e]); } cout << (ans/A[i])-(ng/tmp) << '\n'; } }