結果
問題 | No.2075 GCD Subsequence |
ユーザー | au7777 |
提出日時 | 2023-02-22 15:46:04 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 283 ms / 4,000 ms |
コード長 | 4,096 bytes |
コンパイル時間 | 3,588 ms |
コンパイル使用メモリ | 241,076 KB |
実行使用メモリ | 12,732 KB |
最終ジャッジ日時 | 2023-09-29 23:29:07 |
合計ジャッジ時間 | 11,491 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 9 ms
10,936 KB |
testcase_01 | AC | 8 ms
10,856 KB |
testcase_02 | AC | 9 ms
10,972 KB |
testcase_03 | AC | 9 ms
10,860 KB |
testcase_04 | AC | 8 ms
10,988 KB |
testcase_05 | AC | 8 ms
10,976 KB |
testcase_06 | AC | 9 ms
10,848 KB |
testcase_07 | AC | 9 ms
10,784 KB |
testcase_08 | AC | 71 ms
11,968 KB |
testcase_09 | AC | 112 ms
12,472 KB |
testcase_10 | AC | 75 ms
12,168 KB |
testcase_11 | AC | 102 ms
12,504 KB |
testcase_12 | AC | 86 ms
11,988 KB |
testcase_13 | AC | 63 ms
11,772 KB |
testcase_14 | AC | 94 ms
12,164 KB |
testcase_15 | AC | 68 ms
11,752 KB |
testcase_16 | AC | 72 ms
11,960 KB |
testcase_17 | AC | 115 ms
12,564 KB |
testcase_18 | AC | 275 ms
12,444 KB |
testcase_19 | AC | 283 ms
12,432 KB |
testcase_20 | AC | 271 ms
12,436 KB |
testcase_21 | AC | 275 ms
12,700 KB |
testcase_22 | AC | 275 ms
12,432 KB |
testcase_23 | AC | 272 ms
12,624 KB |
testcase_24 | AC | 278 ms
12,412 KB |
testcase_25 | AC | 275 ms
12,732 KB |
testcase_26 | AC | 275 ms
12,488 KB |
testcase_27 | AC | 274 ms
12,364 KB |
testcase_28 | AC | 266 ms
12,396 KB |
testcase_29 | AC | 9 ms
10,824 KB |
testcase_30 | AC | 9 ms
10,856 KB |
ソースコード
#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; using mint = modint998244353; #else const ll MOD = 1000000007; using mint = modint1000000007; #endif const int MAX = 2000005; 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; } template<typename T> vector<T> smallest_prime_factors(T n) { vector<T> spf(n + 1); for (int i = 0; i <= n; i++) spf[i] = i; for (T i = 2; i * i <= n; i++) { // 素数だったら if (spf[i] == i) { for (T j = i * i; j <= n; j += i) { // iを持つ整数かつまだ素数が決まっていないなら if (spf[j] == j) { spf[j] = i; } } } } return spf; } vector<int> relatedP(int a, vector<int>& spf) { vector<int> ret; while (a > 1) { int div = spf[a]; while (a % div == 0) { a /= div; } ret.push_back(div); } return ret; } int main() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; vector<mint> ans(n, 0); const int MA = 1000000; vector<mint> sumOfMultiple(MA + 1, 0); vector<int> spf = smallest_prime_factors(MA); for (int i = 0; i < n; i++) { vector<int> relatedPrimes = relatedP(a[i], spf); const int NUM = relatedPrimes.size(); ans[i] = 1; for (int j = 1; j < (1 << NUM); j++) { int cnt = 0; int val = 1; for (int k = 0; k < NUM; k++) { if ((j >> k) & 1) { cnt++; val *= relatedPrimes[k]; } } if (cnt % 2) ans[i] += sumOfMultiple[val]; else ans[i] -= sumOfMultiple[val]; } for (int j = 1; j < (1 << NUM); j++) { int val = 1; for (int k = 0; k < NUM; k++) { if ((j >> k) & 1) { val *= relatedPrimes[k]; } } sumOfMultiple[val] += ans[i]; } // cout << " i is " << i << " ans is " << ans[i].val() << endl; } mint ANS = 0; for (auto x : ans) { ANS += x; } cout << ANS.val() << endl; return 0; }