結果

問題 No.1262 グラフを作ろう！
ユーザー heno239heno239
提出日時 2020-10-16 22:27:34
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 4,595 bytes
コンパイル時間 1,952 ms
コンパイル使用メモリ 128,460 KB
実行使用メモリ 151,808 KB
最終ジャッジ日時 2024-07-20 22:51:01
合計ジャッジ時間 165,824 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,859 ms
149,504 KB
testcase_01 AC 1,660 ms
149,216 KB
testcase_02 AC 2,078 ms
150,272 KB
testcase_03 AC 1,480 ms
148,580 KB
testcase_04 AC 1,204 ms
150,912 KB
testcase_05 AC 1,663 ms
149,984 KB
testcase_06 AC 1,113 ms
151,552 KB
testcase_07 AC 1,190 ms
148,448 KB
testcase_08 AC 1,947 ms
150,912 KB
testcase_09 AC 1,308 ms
148,316 KB
testcase_10 AC 1,519 ms
149,088 KB
testcase_11 AC 1,984 ms
151,356 KB
testcase_12 AC 1,734 ms
149,344 KB
testcase_13 AC 1,545 ms
148,704 KB
testcase_14 AC 1,497 ms
149,348 KB
testcase_15 AC 1,220 ms
148,188 KB
testcase_16 AC 1,984 ms
150,628 KB
testcase_17 AC 1,854 ms
150,112 KB
testcase_18 AC 2,211 ms
150,756 KB
testcase_19 AC 1,279 ms
150,500 KB
testcase_20 AC 1,598 ms
151,680 KB
testcase_21 AC 2,122 ms
150,144 KB
testcase_22 AC 1,131 ms
150,144 KB
testcase_23 AC 1,433 ms
148,572 KB
testcase_24 AC 1,978 ms
150,912 KB
testcase_25 AC 1,209 ms
149,348 KB
testcase_26 AC 1,335 ms
149,600 KB
testcase_27 AC 1,665 ms
150,880 KB
testcase_28 AC 1,606 ms
150,368 KB
testcase_29 AC 1,417 ms
150,656 KB
testcase_30 AC 1,445 ms
149,504 KB
testcase_31 AC 1,911 ms
149,468 KB
testcase_32 AC 1,736 ms
149,632 KB
testcase_33 AC 1,182 ms
147,968 KB
testcase_34 AC 1,833 ms
151,424 KB
testcase_35 AC 1,621 ms
148,864 KB
testcase_36 AC 1,150 ms
148,096 KB
testcase_37 AC 2,254 ms
150,752 KB
testcase_38 AC 1,801 ms
150,368 KB
testcase_39 AC 1,396 ms
148,320 KB
testcase_40 AC 1,485 ms
148,964 KB
testcase_41 AC 1,500 ms
151,040 KB
testcase_42 AC 2,190 ms
150,876 KB
testcase_43 AC 1,620 ms
150,052 KB
testcase_44 AC 1,691 ms
149,728 KB
testcase_45 AC 2,123 ms
151,168 KB
testcase_46 AC 1,379 ms
151,552 KB
testcase_47 AC 1,249 ms
148,068 KB
testcase_48 AC 1,996 ms
150,656 KB
testcase_49 AC 2,231 ms
150,400 KB
testcase_50 AC 2,126 ms
150,784 KB
testcase_51 AC 1,316 ms
148,572 KB
testcase_52 AC 1,523 ms
151,264 KB
testcase_53 AC 1,306 ms
148,736 KB
testcase_54 AC 1,677 ms
149,220 KB
testcase_55 AC 1,697 ms
149,376 KB
testcase_56 AC 1,494 ms
150,784 KB
testcase_57 AC 2,394 ms
151,420 KB
testcase_58 AC 1,548 ms
148,992 KB
testcase_59 AC 1,540 ms
150,876 KB
testcase_60 AC 2,339 ms
151,028 KB
testcase_61 AC 1,510 ms
149,120 KB
testcase_62 AC 2,040 ms
150,368 KB
testcase_63 AC 1,585 ms
148,960 KB
testcase_64 AC 1,635 ms
149,376 KB
testcase_65 AC 1,310 ms
149,632 KB
testcase_66 AC 1,508 ms
149,340 KB
testcase_67 AC 1,473 ms
149,852 KB
testcase_68 AC 1,370 ms
151,552 KB
testcase_69 AC 1,481 ms
149,600 KB
testcase_70 AC 1,890 ms
151,392 KB
testcase_71 AC 1,510 ms
150,456 KB
testcase_72 AC 1,928 ms
151,164 KB
testcase_73 AC 1,608 ms
150,400 KB
testcase_74 AC 1,204 ms
149,724 KB
testcase_75 AC 1,550 ms
150,400 KB
testcase_76 AC 1,462 ms
150,144 KB
testcase_77 AC 1,365 ms
150,108 KB
testcase_78 AC 1,615 ms
150,656 KB
testcase_79 AC 2,014 ms
151,296 KB
testcase_80 AC 1,894 ms
151,424 KB
testcase_81 AC 1,305 ms
149,984 KB
testcase_82 AC 1,418 ms
150,112 KB
testcase_83 AC 1,812 ms
151,296 KB
testcase_84 AC 1,475 ms
150,400 KB
testcase_85 AC 1,997 ms
151,224 KB
testcase_86 AC 1,504 ms
150,272 KB
testcase_87 AC 1,853 ms
150,912 KB
testcase_88 AC 1,284 ms
149,856 KB
testcase_89 AC 1,786 ms
151,064 KB
testcase_90 AC 1,191 ms
151,672 KB
testcase_91 AC 1,192 ms
151,680 KB
testcase_92 AC 1,192 ms
151,680 KB
testcase_93 AC 1,264 ms
151,624 KB
testcase_94 AC 1,173 ms
151,808 KB
testcase_95 TLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("Ofast")
#pragma GCC target ("sse4")

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
    ll res = 1;
    while (n) {
        if (n & 1)res = res * x % m;
        x = x * x % m; n >>= 1;
    }
    return res;
}
struct modint {
    ll n;
    modint() :n(0) { ; }
    modint(ll m) :n(m) {
        if (n >= mod)n %= mod;
        else if (n < 0)n = (n % mod + mod) % mod;
    }
    operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
    if (n == 0)return modint(1);
    modint res = (a * a) ^ (n / 2);
    if (n % 2)res = res * a;
    return res;
}

ll inv(ll a, ll p) {
    return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 21;
modint fact[max_n], factinv[max_n];
void init_f() {
    fact[0] = modint(1);
    for (int i = 0; i < max_n - 1; i++) {
        fact[i + 1] = fact[i] * modint(i + 1);
    }
    factinv[max_n - 1] = modint(1) / fact[max_n - 1];
    for (int i = max_n - 2; i >= 0; i--) {
        factinv[i] = factinv[i + 1] * modint(i + 1);
    }
}
modint comb(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[b] * factinv[a - b];
}

int mebius[1 << 20];
vector<int> chcnt(1 << 20);
int loc[1 << 20];
vector<int> ch[1 << 20];
bool isp[1 << 20];
void init() {
    fill(isp + 2, isp + (1 << 20), true);
    fill(mebius, mebius + (1 << 20), 1);
    for (int i = 2; i < (1 << 20); i++) {
        if (!isp[i])continue;
        mebius[i] *= -1;
        for (int j = 2 * i; j < (1 << 20); j += i) {
            isp[j] = false;
            mebius[j] *= -1;
            if ((j / i) % i == 0) {
                mebius[j] = 0;
            }
        }
    }
    for (int i = 2; i < (1 << 20); i++) {
        for (int j = i; j < (1 << 20); j += i) {
            chcnt[j]++;
        }
    }
    for (int i = 2; i < (1 << 20); i++)ch[i].resize(chcnt[i]);
    for (int i = 2; i < (1 << 20); i++) {
        for (int j = i; j < (1 << 20); j += i) {
            ch[j][loc[j]]= i; loc[j]++;
        }
    }
}
void solve() {
    int n, m; cin >> n >> m;
    vector<int> cnt(n+1);
    rep(i, m) {
        int a; cin >> a; cnt[a]++;
    }
    ll ans = 0;
    vector<ll> num;
    rep1(i, n) {
        if (cnt[i] == 0)continue;
        ll s = 0;
        num.clear();
        num.resize(ch[i].size());
        for (int j = ch[i].size() - 1; j >= 0; j--) {
            num[j] = i / ch[i][j];
            for (int k = j + 1; k < ch[i].size(); k++) {
                if (ch[i][k] % ch[i][j] == 0) {
                    num[j] += mebius[ch[i][k] / ch[i][j]] * (i / ch[i][k]);
                }
            }
        }
        ll sum = 0;
        rep(j, ch[i].size()) {
            int d = ch[i][j];
            sum += (d - 1) * num[j];
        }
        ans += cnt[i]*sum;
    }
    cout << ans << "\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    //cout << fixed << setprecision(15);
    //init_f();
    init();
    //expr();
    //int t; cin >> t; rep(i, t)
    solve();
    return 0;
}
0