結果

問題 No.1262 グラフを作ろう！
ユーザー heno239heno239
提出日時 2022-09-24 20:05:45
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 205 ms / 3,000 ms
コード長 6,144 bytes
コンパイル時間 1,901 ms
コンパイル使用メモリ 153,544 KB
実行使用メモリ 41,092 KB
最終ジャッジ日時 2024-06-01 22:00:59
合計ジャッジ時間 24,288 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 191 ms
40,584 KB
testcase_01 AC 166 ms
39,508 KB
testcase_02 AC 189 ms
40,564 KB
testcase_03 AC 197 ms
41,028 KB
testcase_04 AC 112 ms
37,268 KB
testcase_05 AC 149 ms
38,800 KB
testcase_06 AC 113 ms
37,260 KB
testcase_07 AC 120 ms
37,548 KB
testcase_08 AC 160 ms
39,276 KB
testcase_09 AC 165 ms
39,712 KB
testcase_10 AC 152 ms
38,840 KB
testcase_11 AC 160 ms
39,292 KB
testcase_12 AC 192 ms
40,420 KB
testcase_13 AC 196 ms
40,700 KB
testcase_14 AC 142 ms
38,656 KB
testcase_15 AC 155 ms
39,316 KB
testcase_16 AC 165 ms
39,460 KB
testcase_17 AC 165 ms
39,352 KB
testcase_18 AC 193 ms
40,532 KB
testcase_19 AC 117 ms
37,528 KB
testcase_20 AC 132 ms
38,252 KB
testcase_21 AC 200 ms
40,900 KB
testcase_22 AC 113 ms
37,260 KB
testcase_23 AC 169 ms
39,272 KB
testcase_24 AC 165 ms
39,436 KB
testcase_25 AC 118 ms
37,492 KB
testcase_26 AC 124 ms
37,720 KB
testcase_27 AC 143 ms
38,500 KB
testcase_28 AC 137 ms
38,304 KB
testcase_29 AC 126 ms
37,892 KB
testcase_30 AC 134 ms
38,280 KB
testcase_31 AC 200 ms
40,884 KB
testcase_32 AC 161 ms
39,124 KB
testcase_33 AC 134 ms
38,268 KB
testcase_34 AC 146 ms
38,736 KB
testcase_35 AC 192 ms
40,396 KB
testcase_36 AC 142 ms
38,520 KB
testcase_37 AC 195 ms
40,800 KB
testcase_38 AC 153 ms
38,964 KB
testcase_39 AC 161 ms
39,348 KB
testcase_40 AC 151 ms
39,032 KB
testcase_41 AC 132 ms
38,016 KB
testcase_42 AC 182 ms
40,088 KB
testcase_43 AC 144 ms
38,652 KB
testcase_44 AC 154 ms
38,888 KB
testcase_45 AC 170 ms
39,704 KB
testcase_46 AC 123 ms
37,752 KB
testcase_47 AC 175 ms
40,108 KB
testcase_48 AC 170 ms
39,548 KB
testcase_49 AC 190 ms
40,796 KB
testcase_50 AC 176 ms
39,924 KB
testcase_51 AC 175 ms
39,924 KB
testcase_52 AC 127 ms
37,936 KB
testcase_53 AC 122 ms
37,744 KB
testcase_54 AC 195 ms
40,948 KB
testcase_55 AC 170 ms
39,648 KB
testcase_56 AC 132 ms
38,064 KB
testcase_57 AC 197 ms
40,900 KB
testcase_58 AC 190 ms
40,560 KB
testcase_59 AC 130 ms
38,036 KB
testcase_60 AC 193 ms
40,640 KB
testcase_61 AC 143 ms
38,572 KB
testcase_62 AC 183 ms
40,424 KB
testcase_63 AC 194 ms
41,020 KB
testcase_64 AC 162 ms
39,420 KB
testcase_65 AC 118 ms
37,696 KB
testcase_66 AC 143 ms
38,692 KB
testcase_67 AC 132 ms
37,956 KB
testcase_68 AC 117 ms
37,464 KB
testcase_69 AC 133 ms
38,208 KB
testcase_70 AC 165 ms
39,488 KB
testcase_71 AC 160 ms
39,440 KB
testcase_72 AC 175 ms
40,024 KB
testcase_73 AC 199 ms
41,044 KB
testcase_74 AC 186 ms
40,736 KB
testcase_75 AC 177 ms
39,980 KB
testcase_76 AC 163 ms
39,480 KB
testcase_77 AC 182 ms
40,424 KB
testcase_78 AC 166 ms
39,784 KB
testcase_79 AC 188 ms
40,520 KB
testcase_80 AC 161 ms
39,432 KB
testcase_81 AC 187 ms
40,364 KB
testcase_82 AC 203 ms
41,016 KB
testcase_83 AC 161 ms
39,308 KB
testcase_84 AC 163 ms
39,448 KB
testcase_85 AC 194 ms
40,764 KB
testcase_86 AC 182 ms
40,144 KB
testcase_87 AC 195 ms
40,576 KB
testcase_88 AC 184 ms
40,292 KB
testcase_89 AC 156 ms
39,340 KB
testcase_90 AC 199 ms
41,048 KB
testcase_91 AC 202 ms
41,032 KB
testcase_92 AC 200 ms
41,092 KB
testcase_93 AC 205 ms
40,996 KB
testcase_94 AC 200 ms
41,016 KB
testcase_95 AC 195 ms
41,040 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#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>
#include<chrono>
using namespace std;

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

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#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;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.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 -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)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)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
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];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
using ld = long double;
//typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };
//-----------------------------------------

const int mn = 1 << 20;
bool isp[mn];
int meb[mn];
void init() {
	fill(meb + 1, meb + mn, 1);
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		meb[i] *= -1;
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
			meb[j] *= -1;
			if ((j / i) % i == 0)meb[j] = 0;
		}
	}
}
template<typename T>
vector<T> gcdconv(vector<T>& v) {
	//assert(v.size()==mn)
	vector<T> res(v.size());
	rep1(i, res.size() - 1) {
		T val = 0;
		for (int j = 1; j * i < res.size(); j++) {
			if (meb[j] == 0)continue;
			val += (T)meb[j] * v[j * i];
		}
		res[i] = val;
	}
	return res;
}
void solve() {
	int n, m; cin >> n >> m;
	vector<int> a(m);
	rep(i, m)cin >> a[i];
	vector<int> cnt(mn);
	rep(i, m)cnt[a[i]]++;
	vector<ll> ori(mn);
	rep1(i, mn - 1) {
		for (int j = i; j < mn; j += i) {
			ori[i] += (ll)cnt[j] * (j / i);
		}
	}
	vector<ll> z = gcdconv(ori);
	ll ans = 0;
	rep1(i, mn - 1) {
		ans += z[i] * i;
	}
	rep(i, m)ans -= a[i];
	cout << ans << "\n";
}

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