結果

問題 No.1262 グラフを作ろう！
ユーザー maroon_kurimaroon_kuri
提出日時 2020-10-16 22:06:03
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 114 ms / 3,000 ms
コード長 8,796 bytes
コンパイル時間 2,117 ms
コンパイル使用メモリ 210,856 KB
実行使用メモリ 28,604 KB
最終ジャッジ日時 2024-07-20 21:49:17
合計ジャッジ時間 13,474 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
20,028 KB
testcase_01 AC 45 ms
18,616 KB
testcase_02 AC 68 ms
22,976 KB
testcase_03 AC 47 ms
16,060 KB
testcase_04 AC 57 ms
25,404 KB
testcase_05 AC 57 ms
21,432 KB
testcase_06 AC 62 ms
27,584 KB
testcase_07 AC 26 ms
15,396 KB
testcase_08 AC 70 ms
25,788 KB
testcase_09 AC 35 ms
14,908 KB
testcase_10 AC 40 ms
17,856 KB
testcase_11 AC 82 ms
27,200 KB
testcase_12 AC 51 ms
19,128 KB
testcase_13 AC 48 ms
16,568 KB
testcase_14 AC 41 ms
19,004 KB
testcase_15 AC 31 ms
14,140 KB
testcase_16 AC 72 ms
24,892 KB
testcase_17 AC 57 ms
22,204 KB
testcase_18 AC 70 ms
24,504 KB
testcase_19 AC 49 ms
23,740 KB
testcase_20 AC 77 ms
28,220 KB
testcase_21 AC 70 ms
22,712 KB
testcase_22 AC 46 ms
23,096 KB
testcase_23 AC 40 ms
16,188 KB
testcase_24 AC 70 ms
25,404 KB
testcase_25 AC 36 ms
19,008 KB
testcase_26 AC 39 ms
20,288 KB
testcase_27 AC 68 ms
25,148 KB
testcase_28 AC 56 ms
23,100 KB
testcase_29 AC 57 ms
24,508 KB
testcase_30 AC 41 ms
20,028 KB
testcase_31 AC 60 ms
20,032 KB
testcase_32 AC 52 ms
20,160 KB
testcase_33 AC 27 ms
14,272 KB
testcase_34 AC 76 ms
27,704 KB
testcase_35 AC 48 ms
17,464 KB
testcase_36 AC 27 ms
14,012 KB
testcase_37 AC 75 ms
24,636 KB
testcase_38 AC 62 ms
23,208 KB
testcase_39 AC 38 ms
15,420 KB
testcase_40 AC 40 ms
17,600 KB
testcase_41 AC 62 ms
25,660 KB
testcase_42 AC 72 ms
25,276 KB
testcase_43 AC 50 ms
22,080 KB
testcase_44 AC 51 ms
20,800 KB
testcase_45 AC 77 ms
26,812 KB
testcase_46 AC 66 ms
28,224 KB
testcase_47 AC 34 ms
14,140 KB
testcase_48 AC 66 ms
24,508 KB
testcase_49 AC 86 ms
23,996 KB
testcase_50 AC 99 ms
25,536 KB
testcase_51 AC 46 ms
15,932 KB
testcase_52 AC 68 ms
27,068 KB
testcase_53 AC 31 ms
16,952 KB
testcase_54 AC 52 ms
18,492 KB
testcase_55 AC 50 ms
19,512 KB
testcase_56 AC 58 ms
25,144 KB
testcase_57 AC 80 ms
26,812 KB
testcase_58 AC 46 ms
17,728 KB
testcase_59 AC 60 ms
25,792 KB
testcase_60 AC 114 ms
25,788 KB
testcase_61 AC 41 ms
18,364 KB
testcase_62 AC 67 ms
22,716 KB
testcase_63 AC 51 ms
17,724 KB
testcase_64 AC 48 ms
19,516 KB
testcase_65 AC 41 ms
20,284 KB
testcase_66 AC 42 ms
18,876 KB
testcase_67 AC 55 ms
21,312 KB
testcase_68 AC 83 ms
27,964 KB
testcase_69 AC 45 ms
20,524 KB
testcase_70 AC 73 ms
27,324 KB
testcase_71 AC 66 ms
23,224 KB
testcase_72 AC 78 ms
26,940 KB
testcase_73 AC 76 ms
23,488 KB
testcase_74 AC 58 ms
20,792 KB
testcase_75 AC 62 ms
23,484 KB
testcase_76 AC 56 ms
22,968 KB
testcase_77 AC 57 ms
22,124 KB
testcase_78 AC 61 ms
24,124 KB
testcase_79 AC 76 ms
27,068 KB
testcase_80 AC 75 ms
27,836 KB
testcase_81 AC 57 ms
21,692 KB
testcase_82 AC 61 ms
22,464 KB
testcase_83 AC 68 ms
26,944 KB
testcase_84 AC 59 ms
23,204 KB
testcase_85 AC 77 ms
26,816 KB
testcase_86 AC 63 ms
23,228 KB
testcase_87 AC 75 ms
25,404 KB
testcase_88 AC 63 ms
21,568 KB
testcase_89 AC 77 ms
26,176 KB
testcase_90 AC 80 ms
28,472 KB
testcase_91 AC 82 ms
28,476 KB
testcase_92 AC 78 ms
28,400 KB
testcase_93 AC 81 ms
28,472 KB
testcase_94 AC 79 ms
28,604 KB
testcase_95 AC 78 ms
28,348 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

//fast IO by yosupo
struct Scanner {
    FILE* fp = nullptr;
    char line[(1 << 15) + 1];
    size_t st = 0, ed = 0;
    void reread() {
        memmove(line, line + st, ed - st);
        ed -= st;
        st = 0;
        ed += fread(line + ed, 1, (1 << 15) - ed, fp);
        line[ed] = '\0';
    }
    bool succ() {
        while (true) {
            if (st == ed) {
                reread();
                if (st == ed) return false;
            }
            while (st != ed && isspace(line[st])) st++;
            if (st != ed) break;
        }
        if (ed - st <= 50) reread();
        return true;
    }
    template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
    bool read_single(T& ref) {
        if (!succ()) return false;
        while (true) {
            size_t sz = 0;
            while (st + sz < ed && !isspace(line[st + sz])) sz++;
            ref.append(line + st, sz);
            st += sz;
            if (!sz || st != ed) break;
            reread();            
        }
        return true;
    }
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    bool read_single(T& ref) {
        if (!succ()) return false;
        bool neg = false;
        if (line[st] == '-') {
            neg = true;
            st++;
        }
        ref = T(0);
        while (isdigit(line[st])) {
            ref = 10 * ref + (line[st++] - '0');
        }
        if (neg) ref = -ref;
        return true;
    }
    template <class T> bool read_single(vector<T>& ref) {
        for (auto& d : ref) {
            if (!read_single(d)) return false;
        }
        return true;
    }
    void read() {}
    template <class H, class... T> void read(H& h, T&... t) {
        bool f = read_single(h);
        assert(f);
        read(t...);
    }
    Scanner(FILE* _fp) : fp(_fp) {}
};

struct Printer {
  public:
    template <bool F = false> void write() {}
    template <bool F = false, class H, class... T>
    void write(const H& h, const T&... t) {
        if (F) write_single(' ');
        write_single(h);
        write<true>(t...);
    }
    template <class... T> void writeln(const T&... t) {
        write(t...);
        write_single('\n');
    }

    Printer(FILE* _fp) : fp(_fp) {}
    ~Printer() { flush(); }

  private:
    static constexpr size_t SIZE = 1 << 15;
    FILE* fp;
    char line[SIZE], small[50];
    size_t pos = 0;
    void flush() {
        fwrite(line, 1, pos, fp);
        pos = 0;
    }
    void write_single(const char& val) {
        if (pos == SIZE) flush();
        line[pos++] = val;
    }
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    void write_single(T val) {
        if (pos > (1 << 15) - 50) flush();
        if (val == 0) {
            write_single('0');
            return;
        }
        if (val < 0) {
            write_single('-');
            val = -val;  // todo min
        }
        size_t len = 0;
        while (val) {
            small[len++] = char('0' + (val % 10));
            val /= 10;
        }
        for (size_t i = 0; i < len; i++) {
            line[pos + i] = small[len - 1 - i];
        }
        pos += len;
    }
    void write_single(const string& s) {
        for (char c : s) write_single(c);
    }
    void write_single(const char* s) {
        size_t len = strlen(s);
        for (size_t i = 0; i < len; i++) write_single(s[i]);
    }
    template <class T> void write_single(const vector<T>& val) {
        auto n = val.size();
        for (size_t i = 0; i < n; i++) {
            if (i) write_single(' ');
            write_single(val[i]);
        }
    }
};

Scanner sc(stdin);
Printer pr(stdout);

using ll=long long;
#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
	return os<<vc<t>(all(a));
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

template<class t>
void print(t x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

pi readpi(int off=0){
	int a,b;cin>>a>>b;
	return pi(a+off,b+off);
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

//#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<"\n";
	#else
	cout<<"Yes"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<"\n";
	#else
	cout<<"No"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<"\n";
	#else
	cout<<"Possible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<"\n";
	#else
	cout<<"Impossible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
ll mask(int i){
	return (ll(1)<<i)-1;
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	#ifdef LOCAL
	static mt19937_64 gen;
	#else
	static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
	#endif
	return uniform_int_distribution<ll>(l, r)(gen);
}

template<class t>
void myshuffle(vc<t>&a){
	rep(i,si(a))swap(a[i],a[rand_int(0,i)]);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

vvc<int> readGraph(int n,int m){
	vvc<int> g(n);
	rep(i,m){
		int a,b;
		cin>>a>>b;
		//sc.read(a,b);
		a--;b--;
		g[a].pb(b);
		g[b].pb(a);
	}
	return g;
}

vvc<int> readTree(int n){
	return readGraph(n,n-1);
}

const int vmax=ten(6)+10;
bool pri[vmax];
vi ps;
int sf[vmax]; //smallest factor, sf[1] is undefined(0)
void linear_sieve(){
	rng(i,2,vmax)
		pri[i]=1;
	rng(i,2,vmax){
		if(pri[i]){
			ps.pb(i);
			sf[i]=i;
		}
		for(int j=0;i*ps[j]<vmax;j++){
			pri[i*ps[j]]=0;
			sf[i*ps[j]]=ps[j];
			if(i%ps[j]==0)break;
		}
	}
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	linear_sieve();
	
	int n,m;sc.read(n,m);
	
	vi cnt(n+1),wei(n+1);
	int ans=0;
	rep(i,m){
		int a;sc.read(a);
		cnt[a]+=a;
		ans-=a;
	}
	rep(i,n+1)wei[i]=i;
	for(auto p:ps)if(p<=n){
		for(int i=n/p;i>=1;i--){
			cnt[i]+=cnt[i*p];
			wei[i*p]-=wei[i];
		}
	}
	rng(i,1,n+1){
		ans+=cnt[i]/i*wei[i];
	}
	print(ans);
}
0