結果

問題 No.1262 グラフを作ろう！
ユーザー 👑 tatyamtatyam
提出日時 2020-10-16 23:40:48
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 10,226 bytes
コンパイル時間 4,425 ms
コンパイル使用メモリ 221,144 KB
実行使用メモリ 23,292 KB
最終ジャッジ日時 2023-09-28 05:58:41
合計ジャッジ時間 46,652 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 466 ms
17,856 KB
testcase_01 AC 311 ms
15,020 KB
testcase_02 AC 495 ms
19,116 KB
testcase_03 AC 443 ms
16,552 KB
testcase_04 AC 70 ms
14,104 KB
testcase_05 AC 247 ms
14,956 KB
testcase_06 AC 60 ms
14,904 KB
testcase_07 AC 56 ms
9,592 KB
testcase_08 AC 326 ms
18,168 KB
testcase_09 AC 291 ms
13,568 KB
testcase_10 AC 229 ms
13,376 KB
testcase_11 AC 365 ms
18,944 KB
testcase_12 AC 424 ms
17,008 KB
testcase_13 AC 450 ms
16,748 KB
testcase_14 AC 196 ms
13,256 KB
testcase_15 AC 226 ms
12,252 KB
testcase_16 AC 355 ms
18,116 KB
testcase_17 AC 330 ms
16,408 KB
testcase_18 AC 522 ms
20,160 KB
testcase_19 AC 80 ms
13,640 KB
testcase_20 AC 201 ms
17,304 KB
testcase_21 AC 542 ms
20,100 KB
testcase_22 AC 48 ms
12,644 KB
testcase_23 AC 285 ms
13,804 KB
testcase_24 AC 350 ms
18,400 KB
testcase_25 AC 57 ms
11,076 KB
testcase_26 AC 99 ms
12,480 KB
testcase_27 AC 215 ms
16,144 KB
testcase_28 AC 192 ms
14,880 KB
testcase_29 AC 127 ms
14,992 KB
testcase_30 AC 173 ms
12,972 KB
testcase_31 AC 503 ms
18,640 KB
testcase_32 AC 291 ms
15,212 KB
testcase_33 AC 129 ms
10,600 KB
testcase_34 AC 282 ms
18,164 KB
testcase_35 AC 412 ms
16,276 KB
testcase_36 AC 148 ms
10,684 KB
testcase_37 AC 560 ms
20,576 KB
testcase_38 AC 298 ms
16,340 KB
testcase_39 AC 270 ms
13,148 KB
testcase_40 AC 240 ms
13,428 KB
testcase_41 AC 169 ms
15,560 KB
testcase_42 AC 467 ms
19,696 KB
testcase_43 AC 232 ms
15,076 KB
testcase_44 AC 264 ms
15,156 KB
testcase_45 AC 448 ms
19,684 KB
testcase_46 AC 126 ms
16,316 KB
testcase_47 AC 316 ms
13,964 KB
testcase_48 AC 373 ms
18,184 KB
testcase_49 AC 554 ms
20,220 KB
testcase_50 AC 423 ms
19,612 KB
testcase_51 AC 357 ms
14,700 KB
testcase_52 AC 153 ms
15,936 KB
testcase_53 AC 85 ms
10,668 KB
testcase_54 AC 493 ms
18,068 KB
testcase_55 AC 347 ms
15,748 KB
testcase_56 AC 167 ms
15,280 KB
testcase_57 AC 591 ms
22,012 KB
testcase_58 AC 438 ms
17,004 KB
testcase_59 AC 153 ms
15,588 KB
testcase_60 AC 565 ms
21,088 KB
testcase_61 AC 209 ms
13,272 KB
testcase_62 AC 512 ms
19,124 KB
testcase_63 AC 487 ms
17,524 KB
testcase_64 AC 319 ms
15,220 KB
testcase_65 AC 91 ms
12,132 KB
testcase_66 AC 210 ms
13,484 KB
testcase_67 AC 148 ms
13,440 KB
testcase_68 AC 111 ms
16,112 KB
testcase_69 AC 167 ms
13,436 KB
testcase_70 AC 397 ms
19,420 KB
testcase_71 AC 356 ms
17,308 KB
testcase_72 AC 481 ms
20,360 KB
testcase_73 AC 585 ms
20,616 KB
testcase_74 AC 428 ms
18,512 KB
testcase_75 AC 428 ms
18,384 KB
testcase_76 AC 329 ms
17,064 KB
testcase_77 AC 450 ms
18,364 KB
testcase_78 AC 394 ms
18,192 KB
testcase_79 AC 559 ms
21,348 KB
testcase_80 AC 377 ms
19,404 KB
testcase_81 AC 441 ms
18,252 KB
testcase_82 AC 541 ms
20,160 KB
testcase_83 AC 373 ms
18,840 KB
testcase_84 AC 336 ms
17,116 KB
testcase_85 AC 643 ms
21,880 KB
testcase_86 AC 451 ms
18,632 KB
testcase_87 AC 544 ms
20,748 KB
testcase_88 AC 438 ms
18,100 KB
testcase_89 AC 337 ms
18,316 KB
testcase_90 AC 210 ms
23,148 KB
testcase_91 AC 209 ms
23,056 KB
testcase_92 AC 209 ms
23,068 KB
testcase_93 AC 706 ms
23,064 KB
testcase_94 AC 1,929 ms
23,208 KB
testcase_95 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tuplis = array<ll, 3>;
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF=0x1fffffffffffffff;
const ll MINF=0x7fffffffffff;
const int INF=0x3fffffff;
const int MOD=1000000007;
const int MODD=998244353;
const ld DINF=numeric_limits<ld>::infinity();
const ld EPS=1e-9;
const ld PI=3.1415926535897932;
const ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};
#define overload4(_1,_2,_3,_4,name,...) name
#define overload3(_1,_2,_3,name,...) name
#define rep1(n) for(ll i=0;i<n;++i)
#define rep2(i,n) for(ll i=0;i<n;++i)
#define rep3(i,a,b) for(ll i=a;i<b;++i)
#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)
#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i=n;i--;)
#define rrep2(i,n) for(ll i=n;i--;)
#define rrep3(i,a,b) for(ll i=b;i-->(a);)
#define rrep4(i,a,b,c) for(ll i=(a)+((b)-(a)-1)/(c)*(c);i>=(a);i-=c)
#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)
#define each1(i,a) for(auto&&i:a)
#define each2(x,y,a) for(auto&&[x,y]:a)
#define each3(x,y,z,a) for(auto&&[x,y,z]:a)
#define each(...) overload4(__VA_ARGS__,each3,each2,each1)(__VA_ARGS__)
#define all1(i) begin(i),end(i)
#define all2(i,a) begin(i),begin(i)+a
#define all3(i,a,b) begin(i)+a,begin(i)+b
#define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__)
#define rall1(i) (i).rbegin(),(i).rend()
#define rall2(i,k) (i).rbegin(),(i).rbegin()+k
#define rall3(i,a,b) (i).rbegin()+a,(i).rbegin()+b
#define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
#define dsum(...) accumulate(all(__VA_ARGS__),0.0L)
#define Msum(...) accumulate(all(__VA_ARGS__),0_M)
#define elif else if
#define unless(a) if(!(a))
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)
#define Sort(a) sort(all(a))
#define Rev(a) reverse(all(a))
#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))
#define vec(type,name,...) vector<type>name(__VA_ARGS__)
#define VEC(type,name,size) vector<type>name(size);in(name)
#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)
#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
template<class T> auto min(const T& a){ return *min_element(all(a)); }
template<class T> auto max(const T& a){ return *max_element(all(a)); }
inline ll popcnt(ull a){ return __builtin_popcountll(a); }
ll gcd(ll a, ll b){ while(b){ ll c = b; b = a % b; a = c; } return a; }
ll lcm(ll a, ll b){ if(!a || !b) return 0; return a * b / gcd(a, b); }
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
template<class T> bool chmin(T& a, const T& b){ if(a > b){ a = b; return 1; } return 0; }
template<class T> bool chmax(T& a, const T& b){ if(a < b){ a = b; return 1; } return 0; }
template<class T, class U> bool chmin(T& a, const U& b){ if(a > T(b)){ a = b; return 1; } return 0; }
template<class T, class U> bool chmax(T& a, const U& b){ if(a < T(b)){ a = b; return 1; } return 0; }
vector<ll> iota(ll n, ll begin = 0){ vector<ll> a(n); iota(a.begin(), a.end(), begin); return a; }
vector<pll> factor(ull x){ vector<pll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }
map<ll,ll> factor_map(ull x){ map<ll,ll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans[i] = 1; while((x /= i) % i == 0) ans[i]++; } if(x != 1) ans[x] = 1; return ans; }
vector<ll> divisor(ull x){ vector<ll> ans; for(ull i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }
template<class T> unordered_map<T, ll> press(vector<T> a){ Uniq(a); unordered_map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }
template<class T> map<T, ll> press_map(vector<T> a){ Uniq(a); map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }
int scan(){ return getchar(); }
void scan(int& a){ scanf("%d", &a); }
void scan(unsigned& a){ scanf("%u", &a); }
void scan(long& a){ scanf("%ld", &a); }
void scan(long long& a){ scanf("%lld", &a); }
void scan(unsigned long long& a){ scanf("%llu", &a); }
void scan(char& a){ do{ a = getchar(); }while(a == ' ' || a == '\n'); }
void scan(float& a){ scanf("%f", &a); }
void scan(double& a){ scanf("%lf", &a); }
void scan(long double& a){ scanf("%Lf", &a); }
void scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++){ int b; scan(b); a[i] = b; } }
void scan(char a[]){ scanf("%s", a); }
void scan(string& a){ cin >> a; }
template<class T> void scan(vector<T>&);
template<class T, size_t size> void scan(array<T, size>&);
template<class T, class L> void scan(pair<T, L>&);
template<class T, size_t size> void scan(T(&)[size]);
template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }
template<class T> void scan(deque<T>& a){ for(auto&& i : a) scan(i); }
template<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i); }
template<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); }
template<class T, size_t size> void scan(T (&a)[size]){ for(auto&& i : a) scan(i); }
template<class T> void scan(T& a){ cin >> a; }
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }
void print(){ putchar(' '); }
void print(bool a){ printf("%d", a); }
void print(int a){ printf("%d", a); }
void print(unsigned a){ printf("%u", a); }
void print(long a){ printf("%ld", a); }
void print(long long a){ printf("%lld", a); }
void print(unsigned long long a){ printf("%llu", a); }
void print(char a){ printf("%c", a); }
void print(char a[]){ printf("%s", a); }
void print(const char a[]){ printf("%s", a); }
void print(float a){ printf("%.15f", a); }
void print(double a){ printf("%.15f", a); }
void print(long double a){ printf("%.15Lf", a); }
void print(const string& a){ for(auto&& i : a) print(i); }
template<class T> void print(const complex<T>& a){ if(a.real() >= 0) print('+'); print(a.real()); if(a.imag() >= 0) print('+'); print(a.imag()); print('i'); }
template<class T> void print(const vector<T>&);
template<class T, size_t size> void print(const array<T, size>&);
template<class T, class L> void print(const pair<T, L>& p);
template<class T, size_t size> void print(const T (&)[size]);
template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }
template<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }
template<class T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }
#ifdef DEBUG
inline ll __lg(ull __n){ return sizeof(ull) * __CHAR_BIT__  - 1 - __builtin_clzll(__n); }
#define debug(...) { print(#__VA_ARGS__); print(":"); out(__VA_ARGS__); }
#else
#define debug(...) void(0)
#endif
int first(bool i = true){ return out(i?"first":"second"); }
int First(bool i = true){ return out(i?"First":"Second"); }
int yes(bool i = true){ return out(i?"yes":"no"); }
int Yes(bool i = true){ return out(i?"Yes":"No"); }
int No(){ return out("No"); }
int YES(bool i = true){ return out(i?"YES":"NO"); }
int NO(){ return out("NO"); }
int Yay(bool i = true){ return out(i?"Yay!":":("); }
int possible(bool i = true){ return out(i?"possible":"impossible"); }
int Possible(bool i = true){ return out(i?"Possible":"Impossible"); }
int POSSIBLE(bool i = true){ return out(i?"POSSIBLE":"IMPOSSIBLE"); }
void Case(ll i){ printf("Case #%lld: ", i); }




int main(){
    const int N = 1000001;
    int lp[N+1];
    vector<int> pr;

    for (int i=2; i<=N; ++i) {
        if (lp[i] == 0) {
            lp[i] = i;
            pr.push_back (i);
        }
        for (int j=0; j<(int)pr.size() && pr[j]<=lp[i] && i*pr[j]<=N; ++j)
            lp[i * pr[j]] = pr[j];
    }
    auto factor=[&](ll x){
        vector<vector<ll>>ans;
        while(x>1){
            if(ans.empty()||ans.back()[1]!=lp[x])ans.push_back({1,lp[x]});
            else ans.back().push_back(ans.back().back()*lp[x]);
            x/=lp[x];
        }
        return ans;
    };
    LL(n,m);
    VEC(ll,a,m);
    assert(1<=n&&n<=1000000);
    assert(1<=m&&m<=1000000);
    each(x,a)assert(1<=x&&x<=n);
    vec(ll,dp,n+1);
    each(x,a){
        auto d=factor(x);
        auto dfs=[&](ll at,ll a,ll b,auto dfs)->void{
            if(at==d.size()){
                dp[b]+=a;
                return;
            }
            rep(d[at].size())dfs(at+1,a*d[at][i],b*d[at].rbegin()[i],dfs);
        };
        dfs(0,1,1,dfs);
    }
    each(p,pr)rep(i,1,n/p+1)dp[i]-=dp[i*p];
    ll ans=0;
    rep(n+1)ans+=(i-1)*dp[i];
    out(ans);
}
0