結果

問題 No.1262 グラフを作ろう！
ユーザー tatyamtatyam
提出日時 2020-10-16 23:20:58
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 11,042 bytes
コンパイル時間 2,912 ms
コンパイル使用メモリ 222,496 KB
実行使用メモリ 19,684 KB
最終ジャッジ日時 2024-07-20 23:53:21
合計ジャッジ時間 135,133 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,475 ms
14,484 KB
testcase_01 AC 983 ms
11,460 KB
testcase_02 AC 1,712 ms
15,696 KB
testcase_03 AC 1,310 ms
13,000 KB
testcase_04 AC 156 ms
10,652 KB
testcase_05 AC 797 ms
11,716 KB
testcase_06 AC 112 ms
11,560 KB
testcase_07 AC 125 ms
6,088 KB
testcase_08 AC 1,158 ms
14,528 KB
testcase_09 AC 747 ms
10,176 KB
testcase_10 AC 678 ms
10,036 KB
testcase_11 AC 1,237 ms
15,312 KB
testcase_12 AC 1,370 ms
13,508 KB
testcase_13 AC 1,303 ms
13,216 KB
testcase_14 AC 618 ms
9,824 KB
testcase_15 AC 527 ms
9,032 KB
testcase_16 AC 1,205 ms
14,608 KB
testcase_17 AC 1,093 ms
13,128 KB
testcase_18 AC 1,799 ms
16,704 KB
testcase_19 AC 251 ms
10,216 KB
testcase_20 AC 754 ms
13,636 KB
testcase_21 AC 1,875 ms
16,360 KB
testcase_22 AC 90 ms
9,020 KB
testcase_23 AC 753 ms
10,172 KB
testcase_24 AC 1,312 ms
14,792 KB
testcase_25 AC 137 ms
7,744 KB
testcase_26 AC 287 ms
8,896 KB
testcase_27 AC 749 ms
12,616 KB
testcase_28 AC 628 ms
11,332 KB
testcase_29 AC 438 ms
11,236 KB
testcase_30 AC 537 ms
9,732 KB
testcase_31 AC 1,773 ms
15,280 KB
testcase_32 AC 936 ms
11,764 KB
testcase_33 AC 288 ms
7,072 KB
testcase_34 AC 978 ms
14,664 KB
testcase_35 AC 1,210 ms
12,820 KB
testcase_36 AC 314 ms
7,240 KB
testcase_37 AC 1,928 ms
17,092 KB
testcase_38 AC 930 ms
12,784 KB
testcase_39 AC 679 ms
9,668 KB
testcase_40 AC 681 ms
9,896 KB
testcase_41 AC 518 ms
12,232 KB
testcase_42 AC 1,604 ms
16,064 KB
testcase_43 AC 715 ms
11,336 KB
testcase_44 AC 819 ms
11,512 KB
testcase_45 AC 1,445 ms
16,072 KB
testcase_46 AC 388 ms
12,736 KB
testcase_47 AC 703 ms
10,436 KB
testcase_48 AC 1,295 ms
14,664 KB
testcase_49 AC 1,825 ms
16,772 KB
testcase_50 AC 1,610 ms
15,760 KB
testcase_51 AC 1,095 ms
11,260 KB
testcase_52 AC 520 ms
12,736 KB
testcase_53 AC 248 ms
7,108 KB
testcase_54 AC 1,687 ms
14,276 KB
testcase_55 AC 1,204 ms
12,480 KB
testcase_56 AC 618 ms
11,840 KB
testcase_57 AC 2,277 ms
18,500 KB
testcase_58 AC 1,446 ms
13,228 KB
testcase_59 AC 516 ms
12,100 KB
testcase_60 AC 2,087 ms
17,548 KB
testcase_61 AC 663 ms
9,768 KB
testcase_62 AC 1,804 ms
15,648 KB
testcase_63 AC 1,679 ms
14,020 KB
testcase_64 AC 1,068 ms
11,720 KB
testcase_65 AC 258 ms
8,696 KB
testcase_66 AC 710 ms
10,048 KB
testcase_67 AC 485 ms
9,920 KB
testcase_68 AC 342 ms
12,468 KB
testcase_69 AC 536 ms
10,036 KB
testcase_70 AC 1,697 ms
16,072 KB
testcase_71 AC 1,507 ms
13,832 KB
testcase_72 AC 2,039 ms
16,704 KB
testcase_73 AC 2,510 ms
17,132 KB
testcase_74 AC 2,037 ms
15,148 KB
testcase_75 AC 1,832 ms
14,920 KB
testcase_76 AC 1,447 ms
13,376 KB
testcase_77 AC 1,989 ms
14,948 KB
testcase_78 AC 1,726 ms
14,788 KB
testcase_79 AC 2,419 ms
17,852 KB
testcase_80 AC 1,647 ms
15,820 KB
testcase_81 AC 1,947 ms
14,792 KB
testcase_82 AC 2,444 ms
16,452 KB
testcase_83 AC 1,553 ms
15,332 KB
testcase_84 AC 1,489 ms
13,764 KB
testcase_85 AC 2,601 ms
18,376 KB
testcase_86 AC 1,986 ms
15,296 KB
testcase_87 AC 2,374 ms
17,220 KB
testcase_88 AC 1,936 ms
14,788 KB
testcase_89 AC 1,440 ms
14,660 KB
testcase_90 TLE -
testcase_91 TLE -
testcase_92 TLE -
testcase_93 AC 1,398 ms
19,516 KB
testcase_94 TLE -
testcase_95 AC 2,156 ms
19,648 KB
権限があれば一括ダウンロードができます

ソースコード

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); }


vector<ll> Divisor(ull x){
    vector<ll> ans = {1};
    ll two = 0, three = 0;
    while(~x & 1){
        two++;
        x /= 2;
    }
    while(x % 3 == 0){
        three++;
        x /= 3;
    }
    for(ull i = 5; i * i <= x; i += (i % 6 == 1 ? 4 : 2)) if(x % i == 0) ans.push_back(i);
    rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]);
    two *= ans.size();
    for(ll i = 0; i < two; i++) ans.push_back(ans[i] * 2);
    three *= ans.size();
    for(ll i = 0; i < three; i++) ans.push_back(ans[i] * 3);
    return ans;
}
vector<bool> sieve_of_atkin(int N){
    vector<bool> isprime(N + 1);
    const int sqrtN = sqrt(N);
    int n;
    for(int z = 1; z <= 5; z += 4) for(int y = z; y <= sqrtN; y += 6){
        for(int x = 1; x <= sqrtN && (n = 4*x*x+y*y) <= N; ++x) isprime[n] = !isprime[n];
        for(int x = y+1; x <= sqrtN && (n = 3*x*x-y*y) <= N; x += 2) isprime[n] = !isprime[n];
    }
    for(int z = 2; z <= 4; z += 2) for(int y = z; y <= sqrtN; y += 6){
        for(int x = 1; x <= sqrtN && (n = 3*x*x+y*y) <= N; x += 2) isprime[n] = !isprime[n];
        for(int x = y+1; x <= sqrtN && (n = 3*x*x-y*y) <= N; x += 2) isprime[n] = !isprime[n];
    }
    for(int y = 3; y <= sqrtN; y += 6) for(int z = 1; z <= 2; ++z){
        for(int x = z; x <= sqrtN && (n = 4*x*x+y*y) <= N; x += 3) isprime[n] = !isprime[n];
    }
    for(int n = 5; n <= sqrtN; ++n) if(isprime[n]) for(int k = n*n; k <= N; k+=n*n) isprime[k] = false;
    isprime[2] = isprime[3] = true;
    return isprime;
}
vector<int> primes(int N){
    auto isprime = sieve_of_atkin(N);
    vector<int> ans;
    rep(N + 1) if(isprime[i]) ans.push_back(i);
    return ans;
}
int main(){
    auto prime=primes(1000000);
    LL(n,m);
    VEC(ll,a,m);
    vec(ll,dp,n+1);
    each(x,a){
        each(p,Divisor(x)){
            dp[p]+=x/p;
        }
    }
    each(p,prime)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