結果
問題 | No.1262 グラフを作ろう! |
ユーザー | torisasami4 |
提出日時 | 2020-10-17 15:01:47 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 392 ms / 3,000 ms |
コード長 | 5,094 bytes |
コンパイル時間 | 3,161 ms |
コンパイル使用メモリ | 176,092 KB |
実行使用メモリ | 50,020 KB |
最終ジャッジ日時 | 2023-09-28 08:03:23 |
合計ジャッジ時間 | 32,134 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 335 ms
41,312 KB |
testcase_01 | AC | 237 ms
39,984 KB |
testcase_02 | AC | 343 ms
44,340 KB |
testcase_03 | AC | 300 ms
37,496 KB |
testcase_04 | AC | 67 ms
46,624 KB |
testcase_05 | AC | 181 ms
42,892 KB |
testcase_06 | AC | 68 ms
48,988 KB |
testcase_07 | AC | 46 ms
36,864 KB |
testcase_08 | AC | 239 ms
47,180 KB |
testcase_09 | AC | 194 ms
36,196 KB |
testcase_10 | AC | 167 ms
39,416 KB |
testcase_11 | AC | 247 ms
48,916 KB |
testcase_12 | AC | 309 ms
40,372 KB |
testcase_13 | AC | 318 ms
38,088 KB |
testcase_14 | AC | 152 ms
40,516 KB |
testcase_15 | AC | 159 ms
35,456 KB |
testcase_16 | AC | 255 ms
46,268 KB |
testcase_17 | AC | 237 ms
43,596 KB |
testcase_18 | AC | 354 ms
45,864 KB |
testcase_19 | AC | 76 ms
45,272 KB |
testcase_20 | AC | 154 ms
49,720 KB |
testcase_21 | AC | 374 ms
44,220 KB |
testcase_22 | AC | 52 ms
44,452 KB |
testcase_23 | AC | 198 ms
37,536 KB |
testcase_24 | AC | 255 ms
46,912 KB |
testcase_25 | AC | 56 ms
40,516 KB |
testcase_26 | AC | 85 ms
41,620 KB |
testcase_27 | AC | 170 ms
46,276 KB |
testcase_28 | AC | 145 ms
44,536 KB |
testcase_29 | AC | 110 ms
45,968 KB |
testcase_30 | AC | 125 ms
41,288 KB |
testcase_31 | AC | 354 ms
41,636 KB |
testcase_32 | AC | 214 ms
41,856 KB |
testcase_33 | AC | 92 ms
35,780 KB |
testcase_34 | AC | 206 ms
48,924 KB |
testcase_35 | AC | 293 ms
38,796 KB |
testcase_36 | AC | 104 ms
35,300 KB |
testcase_37 | AC | 375 ms
46,044 KB |
testcase_38 | AC | 207 ms
44,684 KB |
testcase_39 | AC | 186 ms
37,184 KB |
testcase_40 | AC | 175 ms
39,008 KB |
testcase_41 | AC | 129 ms
46,992 KB |
testcase_42 | AC | 320 ms
46,728 KB |
testcase_43 | AC | 168 ms
43,424 KB |
testcase_44 | AC | 193 ms
42,320 KB |
testcase_45 | AC | 285 ms
48,136 KB |
testcase_46 | AC | 115 ms
49,748 KB |
testcase_47 | AC | 214 ms
35,560 KB |
testcase_48 | AC | 270 ms
46,008 KB |
testcase_49 | AC | 360 ms
45,324 KB |
testcase_50 | AC | 302 ms
46,956 KB |
testcase_51 | AC | 235 ms
37,228 KB |
testcase_52 | AC | 127 ms
48,432 KB |
testcase_53 | AC | 71 ms
38,468 KB |
testcase_54 | AC | 337 ms
40,284 KB |
testcase_55 | AC | 242 ms
41,008 KB |
testcase_56 | AC | 127 ms
46,464 KB |
testcase_57 | AC | 392 ms
48,176 KB |
testcase_58 | AC | 299 ms
39,448 KB |
testcase_59 | AC | 126 ms
47,388 KB |
testcase_60 | AC | 372 ms
47,068 KB |
testcase_61 | AC | 151 ms
39,792 KB |
testcase_62 | AC | 344 ms
44,036 KB |
testcase_63 | AC | 331 ms
39,196 KB |
testcase_64 | AC | 223 ms
40,844 KB |
testcase_65 | AC | 76 ms
41,652 KB |
testcase_66 | AC | 159 ms
40,332 KB |
testcase_67 | AC | 121 ms
42,620 KB |
testcase_68 | AC | 103 ms
49,560 KB |
testcase_69 | AC | 127 ms
41,800 KB |
testcase_70 | AC | 264 ms
48,652 KB |
testcase_71 | AC | 222 ms
44,676 KB |
testcase_72 | AC | 300 ms
48,324 KB |
testcase_73 | AC | 342 ms
44,976 KB |
testcase_74 | AC | 294 ms
42,376 KB |
testcase_75 | AC | 260 ms
45,020 KB |
testcase_76 | AC | 211 ms
44,424 KB |
testcase_77 | AC | 278 ms
43,504 KB |
testcase_78 | AC | 256 ms
45,596 KB |
testcase_79 | AC | 348 ms
48,504 KB |
testcase_80 | AC | 253 ms
49,180 KB |
testcase_81 | AC | 276 ms
43,116 KB |
testcase_82 | AC | 339 ms
43,952 KB |
testcase_83 | AC | 240 ms
48,436 KB |
testcase_84 | AC | 220 ms
44,384 KB |
testcase_85 | AC | 370 ms
48,504 KB |
testcase_86 | AC | 273 ms
44,636 KB |
testcase_87 | AC | 336 ms
46,688 KB |
testcase_88 | AC | 271 ms
43,224 KB |
testcase_89 | AC | 231 ms
47,596 KB |
testcase_90 | AC | 358 ms
49,716 KB |
testcase_91 | AC | 343 ms
50,020 KB |
testcase_92 | AC | 345 ms
49,756 KB |
testcase_93 | AC | 373 ms
49,828 KB |
testcase_94 | AC | 343 ms
49,764 KB |
testcase_95 | AC | 341 ms
49,744 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define pb(x) push_back(x) #define mp(a, b) make_pair(a, b) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define lscan(x) scanf("%I64d", &x) #define lprint(x) printf("%I64d", x) #define rep(i, n) for (ll i = 0; i < (n); i++) #define rep2(i, n) for (ll i = n - 1; i >= 0; i--) const ll mod = 1e9 + 7; ll gcd(ll a, ll b) { ll c = a % b; while (c != 0) { a = b; b = c; c = a % b; } return b; } long long extGCD(long long a, long long b, long long &x, long long &y) { if (b == 0) { x = 1; y = 0; return a; } long long d = extGCD(b, a % b, y, x); y -= a / b * x; return d; } struct UnionFind { vector<ll> data; UnionFind(int sz) { data.assign(sz, -1); } bool unite(int x, int y) { x = find(x), y = find(y); if (x == y) return (false); if (data[x] > data[y]) swap(x, y); data[x] += data[y]; data[y] = x; return (true); } int find(int k) { if (data[k] < 0) return (k); return (data[k] = find(data[k])); } ll size(int k) { return (-data[find(k)]); } }; ll M = 1000000007; vector<ll> fac(2000011); //n!(mod M) vector<ll> ifac(2000011); //k!^{M-2} (mod M) ll mpow(ll x, ll n) { ll ans = 1; while (n != 0) { if (n & 1) ans = ans * x % M; x = x * x % M; n = n >> 1; } return ans; } ll mpow2(ll x, ll n, ll mod) { ll ans = 1; while (n != 0) { if (n & 1) ans = ans * x % mod; x = x * x % mod; n = n >> 1; } return ans; } void setcomb() { fac[0] = 1; ifac[0] = 1; for (ll i = 0; i < 2000010; i++) { fac[i + 1] = fac[i] * (i + 1) % M; // n!(mod M) } ifac[2000010] = mpow(fac[2000010], M - 2); for (ll i = 2000010; i > 0; i--) { ifac[i - 1] = ifac[i] * i % M; } } ll comb(ll a, ll b) { if (a == 0 && b == 0) return 1; if (a < b || a < 0) return 0; ll tmp = ifac[a - b] * ifac[b] % M; return tmp * fac[a] % M; } ll perm(ll a, ll b) { if (a == 0 && b == 0) return 1; if (a < b || a < 0) return 0; return fac[a] * ifac[a - b] % M; } long long modinv(long long a) { long long b = M, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } u %= M; if (u < 0) u += M; return u; } ll modinv2(ll a, ll mod) { ll b = mod, u = 1, v = 0; while (b) { ll t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } u %= mod; if (u < 0) u += mod; return u; } template <int mod> struct ModInt { int x; ModInt() : x(0) {} ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} ModInt &operator+=(const ModInt &p) { if ((x += p.x) >= mod) x -= mod; return *this; } ModInt &operator-=(const ModInt &p) { if ((x += mod - p.x) >= mod) x -= mod; return *this; } ModInt &operator*=(const ModInt &p) { x = (int)(1LL * x * p.x % mod); return *this; } ModInt &operator/=(const ModInt &p) { *this *= p.inverse(); return *this; } ModInt operator-() const { return ModInt(-x); } ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; } ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; } ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; } ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; } bool operator==(const ModInt &p) const { return x == p.x; } bool operator!=(const ModInt &p) const { return x != p.x; } ModInt inverse() const { int a = x, b = mod, u = 1, v = 0, t; while (b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); } return ModInt(u); } ModInt pow(int64_t n) const { ModInt ret(1), mul(x); while (n > 0) { if (n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; } friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt<mod>(t); return (is); } static int get_mod() { return mod; } }; using mint = ModInt<mod>; typedef vector<vector<mint>> Matrix; Matrix mul(Matrix a, Matrix b) { int i, j, k; mint t; int n = a.size(), m = b[0].size(), l = a[0].size(); Matrix c(n, vector<mint>(m)); for (i = 0; i < n; i++) { for (j = 0; j < m; j++) { t = 0; for (k = 0; k < l; k++) t += a[i][k] * b[k][j]; c[i][j] = t; } } return c; } Matrix mat_pow(Matrix x, ll n) { ll k = x.size(); Matrix ans(k, vector<mint>(k, 0)); for (int i = 0; i < k; i++) ans[i][i] = 1; while (n != 0) { if (n & 1) ans = mul(ans, x); x = mul(x, x); n = n >> 1; } return ans; } int main() { ll n,m; cin>>n>>m; ll p[n+1]; rep(i, n + 1) p[i] = 1; for (ll i = 2; i <= n;i++){ if(p[i]==1){ for (ll j = i * 2; j <= n;j+=i) p[j] = i; } } ll sum[n + 1]; sum[1] = 1; for (ll i = 2; i <= n;i++){ if(p[i]==1) sum[i] = 2 * i - 1; else{ ll ci = i; ll k = 1; while (ci % p[i] == 0) ci /= p[i], k *= p[i]; sum[i] = sum[ci] * (k-k/p[i]) + sum[i/p[i]] * p[i]; } } ll ans = 0, a; rep(i, m) cin >> a, ans += sum[a] - a; cout << ans << endl; }