結果

問題 No.1262 グラフを作ろう！
ユーザー Kite_kumaKite_kuma
提出日時 2020-10-16 22:57:45
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 338 ms / 3,000 ms
コード長 11,351 bytes
コンパイル時間 2,125 ms
コンパイル使用メモリ 185,008 KB
実行使用メモリ 19,328 KB
最終ジャッジ日時 2024-07-20 23:26:13
合計ジャッジ時間 27,670 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 193 ms
12,416 KB
testcase_01 AC 147 ms
10,240 KB
testcase_02 AC 237 ms
14,592 KB
testcase_03 AC 143 ms
9,728 KB
testcase_04 AC 191 ms
13,272 KB
testcase_05 AC 175 ms
11,776 KB
testcase_06 AC 230 ms
14,976 KB
testcase_07 AC 49 ms
5,888 KB
testcase_08 AC 251 ms
15,416 KB
testcase_09 AC 94 ms
7,680 KB
testcase_10 AC 120 ms
9,088 KB
testcase_11 AC 271 ms
16,492 KB
testcase_12 AC 175 ms
11,520 KB
testcase_13 AC 152 ms
10,120 KB
testcase_14 AC 129 ms
9,728 KB
testcase_15 AC 71 ms
6,912 KB
testcase_16 AC 235 ms
14,904 KB
testcase_17 AC 197 ms
12,984 KB
testcase_18 AC 261 ms
15,884 KB
testcase_19 AC 170 ms
12,120 KB
testcase_20 AC 256 ms
16,128 KB
testcase_21 AC 243 ms
14,716 KB
testcase_22 AC 155 ms
11,388 KB
testcase_23 AC 106 ms
8,264 KB
testcase_24 AC 249 ms
15,488 KB
testcase_25 AC 103 ms
8,576 KB
testcase_26 AC 126 ms
9,728 KB
testcase_27 AC 219 ms
14,080 KB
testcase_28 AC 183 ms
12,484 KB
testcase_29 AC 192 ms
13,184 KB
testcase_30 AC 133 ms
10,112 KB
testcase_31 AC 205 ms
12,792 KB
testcase_32 AC 166 ms
11,264 KB
testcase_33 AC 49 ms
5,888 KB
testcase_34 AC 262 ms
16,384 KB
testcase_35 AC 152 ms
10,368 KB
testcase_36 AC 49 ms
5,888 KB
testcase_37 AC 266 ms
16,072 KB
testcase_38 AC 203 ms
13,304 KB
testcase_39 AC 96 ms
7,808 KB
testcase_40 AC 118 ms
8,960 KB
testcase_41 AC 218 ms
14,048 KB
testcase_42 AC 260 ms
16,008 KB
testcase_43 AC 173 ms
11,932 KB
testcase_44 AC 165 ms
11,396 KB
testcase_45 AC 275 ms
16,724 KB
testcase_46 AC 242 ms
15,744 KB
testcase_47 AC 89 ms
7,680 KB
testcase_48 AC 235 ms
14,896 KB
testcase_49 AC 257 ms
15,524 KB
testcase_50 AC 258 ms
15,980 KB
testcase_51 AC 117 ms
8,960 KB
testcase_52 AC 232 ms
15,044 KB
testcase_53 AC 77 ms
7,296 KB
testcase_54 AC 180 ms
11,736 KB
testcase_55 AC 166 ms
11,348 KB
testcase_56 AC 205 ms
13,684 KB
testcase_57 AC 303 ms
17,920 KB
testcase_58 AC 162 ms
10,880 KB
testcase_59 AC 224 ms
14,148 KB
testcase_60 AC 285 ms
17,024 KB
testcase_61 AC 118 ms
9,208 KB
testcase_62 AC 232 ms
14,464 KB
testcase_63 AC 170 ms
11,136 KB
testcase_64 AC 155 ms
10,880 KB
testcase_65 AC 124 ms
9,600 KB
testcase_66 AC 130 ms
9,728 KB
testcase_67 AC 149 ms
10,832 KB
testcase_68 AC 239 ms
15,576 KB
testcase_69 AC 141 ms
10,428 KB
testcase_70 AC 275 ms
17,024 KB
testcase_71 AC 214 ms
13,824 KB
testcase_72 AC 284 ms
17,088 KB
testcase_73 AC 256 ms
15,508 KB
testcase_74 AC 207 ms
13,160 KB
testcase_75 AC 229 ms
14,440 KB
testcase_76 AC 205 ms
13,428 KB
testcase_77 AC 215 ms
13,696 KB
testcase_78 AC 232 ms
14,720 KB
testcase_79 AC 297 ms
17,664 KB
testcase_80 AC 278 ms
17,136 KB
testcase_81 AC 208 ms
13,440 KB
testcase_82 AC 236 ms
14,700 KB
testcase_83 AC 264 ms
16,460 KB
testcase_84 AC 209 ms
13,696 KB
testcase_85 AC 301 ms
17,792 KB
testcase_86 AC 234 ms
14,412 KB
testcase_87 AC 275 ms
16,512 KB
testcase_88 AC 211 ms
13,312 KB
testcase_89 AC 250 ms
15,644 KB
testcase_90 AC 328 ms
19,328 KB
testcase_91 AC 327 ms
19,200 KB
testcase_92 AC 325 ms
19,168 KB
testcase_93 AC 337 ms
19,184 KB
testcase_94 AC 338 ms
19,328 KB
testcase_95 AC 326 ms
19,328 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/*	author:  Kite_kuma
	created: 2020.10.16 22:40:49 */

// #ifdef LOCAL
// #define _GLIBCXX_DEBUG
// #endif
#include <bits/stdc++.h>
using namespace std;

#pragma region aliases

#define rep(i, n) for(long long i = 0; i < (n); i++)
#define rrep(i, n) for(long long i = (n)-1; i > -1; i--)
#define Rep(i, m, n) for(long long i = (m); i < (n); i++)
#define rRep(i, m, n) for(long long i = (n)-1; i >= (m); i--)
#define REP(i, m, n, p) for(long long i = m; i < n; i += p)
#define foa(s, v) for(auto &s : v)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define bcnt(n) __builtin_popcountll(n)
#define endk endl
#define ednl endl
#define enld endl

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using vb = vector<bool>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using mll = map<long long, long long>;
using pll = pair<long long, long long>;
using qll = queue<long long>;
using sll = set<long long>;
using vpll = vector<pair<long long, long long>>;
template <class T = ll>
using V = vector<T>;
template <class T = ll>
using VV = V<V<T>>;
template <class T = ll>
using VVV = V<V<V<T>>>;
//昇順pq(小さい方から取り出す)
template <class T = ll>
using pqup = priority_queue<T, vector<T>, greater<T>>;
//降順pq(大きい方から取り出す)
template <class T = ll>
using pqdn = priority_queue<T>;

#pragma endregion

#pragma region constants

long long const limLL = 9223372036854775807;  // POW(2,63)-1 ~ 9.22e18
long long const dekai = 3e16;
const long double pi = acos(-1);
const char dl = '\n';
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};

const int mod = 1000000007;
// const int mod = 998244353;

#pragma endregion

#pragma region basic_procedure

template <class T>
inline bool isin(T x, T lef, T rig) {
	return ((lef <= x) && (x < rig));
}

template <class T>
inline bool chmin(T &a, T b) {
	if(a > b) {
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b) {
	if(a < b) {
		a = b;
		return true;
	}
	return false;
}

void Yes(bool f = 1) { cout << (f ? "Yes" : "No") << "\n"; }
void No() { cout << "No\n"; }
void YES(bool f = 1) { cout << (f ? "YES" : "NO") << "\n"; }
void NO() { cout << "NO\n"; }
template <class T>
void drop(T answer) {
	cout << answer << "\n";
	exit(0);
}
void err() {
	cout << -1 << "\n";
	exit(0);
}

template <class T>
void vout(vector<T> &v, bool tate = 0) {
	if(v.size() > 0) {
		for(auto it = v.begin(); it < v.end(); it++) {
			cout << *it;
			if(it != v.end() - 1) {
				if(tate)
					cout << endl;
				else
					cout << " ";
			}
		}
	}
	cout << endl;
}

template <class T>
void add(vector<T> &v, T val) {	 //ベクトルの各要素に加算
	for(auto &a : v) a += val;
	return;
}

// vectorの中身を数える map<要素,個数>を返す
template <class T>
map<T, long long> cntv(vector<T> v) {
	map<T, long long> m;
	for(auto &g : v) {
		if(m.count(g))
			m[g]++;
		else
			m[g] = 1;
	}
	return m;
}

//配列圧縮
//{1,36,1,3,8,-2,-92}を
//{2, 5,2,3,4, 1,  0}にする
template <class T>
vector<int> press(vector<T> &v) {
	int n = v.size();
	vector<int> w(n);
	map<T, int> m;
	for(T &p : v) m[p] = 0;
	int i = 0;
	for(auto &p : m) {
		p.second = i;
		i++;
	}
	for(int i = 0; i < n; i++) w.at(i) = m[v.at(i)];
	return w;
}

// 切り上げ除算
template <class T>
T dup(T a, T b) {
	assert(b != 0);
	T x = abs(a);
	T y = abs(b);
	T z = (x + y - 1) / y;
	if((a < 0 && b > 0) || (a > 0 && b < 0))
		return -z;
	else if(a == 0)
		return 0;
	else
		return z;
}

long long POW(long long a, long long n) {
	long long res = 1;
	while(n > 0) {
		if(n & 1) res = res * a;
		a = a * a;
		n >>= 1;
	}
	return res;
}

template <class T>
T greatest_lower_multiple(T x, T d) {
	if(d == 0) return 0;
	if(d < 0) d *= -1;
	T y = x % d;
	if(y < 0) y += d;
	return x - y;
}

template <class T>
T least_upper_multiple(T x, T d) {
	return -greatest_lower_multiple(-x, d);
}

long long modpow(long long a, long long n, long long mod) {	 // a^n mod
	assert(n >= 0);
	if(mod == 1) return 0LL;
	long long res = 1;
	while(n > 0) {
		if(n & 1) res = res * a % mod;
		a = a * a % mod;
		n >>= 1;
	}
	return res;
}

// a * x % mod == __gcd(a,mod)なるxを返す
// a が modの倍数でないことが条件
long long modinv(long long a, long long mod) {
	long long b = mod, u = 1, v = 0;
	while(b) {
		long long t = a / b;
		a -= t * b;
		swap(a, b);
		u -= t * v;
		swap(u, v);
	}
	u %= mod;
	if(u < 0) u += mod;
	return u;
}

vvll comb(100, vll(100, -1));
long long com(long long n, long long k) {  //普通の二項計数(overflowに注意)
	assert(n < 100 && k < 100);
	if(n < k || k < 0 || n < 0) return 0;
	if(comb[n][k] != -1) return comb[n][k];
	ll res;
	if(n - k < k)
		res = com(n, n - k);
	else if(k == 0)
		res = 1;
	else
		res = com(n - 1, k - 1) + com(n - 1, k);
	comb[n][k] = res;
	return res;
}

// nCk modを求める
const int MAX = 5100000;
// この値は求める二項計数の値に応じて変える
// MAX=3*10^7のとき1900msほど、ほぼ比例
// MAX=5*10^6程度ならそれほど気にしなくてよい(300ms程)
long long fac[MAX], finv[MAX], inv[MAX];

void cominit() {
	// テーブルを作る前処理
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for(int i = 2; i < MAX; i++) {
		fac[i] = fac[i - 1] * i % mod;
		inv[i] = mod - inv[mod % i] * (mod / i) % mod;
		finv[i] = finv[i - 1] * inv[i] % mod;
	}
}
long long commod(long long n, long long k) {  // 二項係数
	if(n < k) return 0;
	if(n < 0 || k < 0) return 0;
	return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
long long pmod(long long n, long long k) {	// 順列
	if(n < k) return 0;
	if(n < 0 || k < 0) return 0;
	return fac[n] * finv[n - k] % mod;
}
// n個の区別しないボールを区別するk個の箱に入れる方法の総数
long long hmod(long long n, long long k) {	// 重複組み合わせ
	return commod(n + k - 1, n);
}
#pragma endregion

#pragma region input
#define VEC(type, name, size) \
	vector<type> name(size);  \
	INPUT(name)
#define VVEC(type, name, h, w)                     \
	vector<vector<type>> name(h, vector<type>(w)); \
	INPUT(name)
#define INT(...)     \
	int __VA_ARGS__; \
	INPUT(__VA_ARGS__)
#define LL(...)            \
	long long __VA_ARGS__; \
	INPUT(__VA_ARGS__)
#define STR(...)        \
	string __VA_ARGS__; \
	INPUT(__VA_ARGS__)
#define CHAR(...)     \
	char __VA_ARGS__; \
	INPUT(__VA_ARGS__)
#define DOUBLE(...)     \
	double __VA_ARGS__; \
	INPUT(__VA_ARGS__)
#define LD(...)              \
	long double __VA_ARGS__; \
	INPUT(__VA_ARGS__)

template <class T>
void scan(T &a) {
	cin >> a;
}
template <class T>
void scan(vector<T> &a) {
	for(auto &i : a) scan(i);
}
template <class T, class L>
void scan(pair<T, L> &p) {
	scan(p.first);
	scan(p.second);
}
void INPUT() {}
template <class Head, class... Tail>
void INPUT(Head &head, Tail &... tail) {
	scan(head);
	INPUT(tail...);
}
template <class T>
inline void print(T x) {
	cout << x << '\n';
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
	is >> p.first >> p.second;
	return is;
}
#pragma endregion

#pragma region debug

#pragma region output
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
	os << p.first << " " << p.second;
	return os;
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
	for(int i = 0; i < (int)v.size(); i++) {
		if(i) os << " ";
		os << v[i];
	}
	return os;
}
#pragma endregion

#pragma region view

template <typename T>
void view(const T e) {
	std::cerr << e;
}

template <typename T, typename U>
void view(const std::pair<T, U> &p) {
	std::cerr << "(";
	view(p.first);
	cerr << ", ";
	view(p.second);
	cerr << ")";
}

template <typename T>
void view(const std::set<T> &s) {
	if(s.empty()) {
		cerr << "{ }";
		return;
	}
	std::cerr << "{ ";
	for(auto &t : s) {
		view(t);
		std::cerr << ", ";
	}
	std::cerr << "\b\b }";
}

template <typename T>
void view(const std::vector<T> &v) {
	if(v.empty()) {
		cerr << "{ }";
		return;
	}
	std::cerr << "{ ";
	for(const auto &e : v) {
		view(e);
		std::cerr << ", ";
	}
	std::cerr << "\b\b }";
}

template <typename T>
void view(const std::vector<std::vector<T>> &vv) {
	std::cerr << "{\n";
	for(const auto &v : vv) {
		std::cerr << "\t";
		view(v);
		std::cerr << "\n";
	}
	std::cerr << "}";
}

template <typename T, typename U>
void view(const std::vector<std::pair<T, U>> &v) {
	std::cerr << "{\n";
	for(const auto &c : v) {
		std::cerr << "\t(";
		view(c.first);
		cerr << ", ";
		view(c.second);
		cerr << ")\n";
	}
	std::cerr << "}";
}

template <typename T, typename U>
void view(const std::map<T, U> &m) {
	std::cerr << "{\n";
	for(const auto &t : m) {
		std::cerr << "\t[";
		view(t.first);
		cerr << "] : ";
		view(t.second);
		cerr << "\n";
	}
	std::cerr << "}";
}

#pragma endregion

// when debugging : g++ foo.cpp -DLOCAL
#ifdef LOCAL
void debug_out() {}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
	view(H);
	cerr << ", ";
	debug_out(T...);
}
#define debug(...)                                           \
	do {                                                     \
		cerr << __LINE__ << " [" << #__VA_ARGS__ << "] : ["; \
		debug_out(__VA_ARGS__);                              \
		cerr << "\b\b]\n";                                   \
	} while(0)
#define dump(x)                                 \
	do {                                        \
		cerr << __LINE__ << " " << #x << " : "; \
		view(x);                                \
		cerr << "\n";                           \
	} while(0)

#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

#pragma endregion

struct Fast_Factorization {
	int n;	//最大のn
	vector<int> v;

	Fast_Factorization(int _n) : n(_n), v(_n + 1) {
		v[0] = v[1] = 1;
		for(int i = 2; i <= n; i++) {
			if(v[i]) continue;
			int k = i;
			while(k <= n) {
				if(!v[k]) v[k] = i;
				k += i;
			}
		}
	}

	vector<int> factor(int num) {  // 素因数分解 vector{素因数、素因数、...}(重複有り)
		vector<int> ret;
		while(num > 1) ret.push_back(v[num]), num /= v[num];
		return ret;
	}

	map<int, int> facmap(int num) {	 //素因数分解 map<素因数,個数>
		map<int, int> ret;
		while(num > 1) {
			int cnt = 0, div = v[num];
			while(num % div == 0) num /= div, cnt++;
			ret[div] = cnt;
		}
		return ret;
	}

	vector<int> primevector() {
		vector<int> ret;
		for(int i = 2; i < n + 1; i++) {
			if(v[i] == i) ret.push_back(i);
		}
		return ret;
	}
};

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	srand((unsigned)time(NULL));

	INT(n, m);
	VEC(int, a, m);

	Fast_Factorization ff(n + 10);

	vector<ll> res(n + 1, 1);

	Rep(now, 1, n + 1) {
		auto v = ff.facmap(now);

		foa(t, v) {
			debug(now, t);
			ll ans = 0;
			// auto i = now;
			int p, num;
			tie(p, num) = t;
			int lar = POW(p, num);
			int l = lar;
			int r = 0;
			for(int j = num; j >= 0; j--) {
				int s = l / lar;
				ans += (s - r) * lar;
				lar /= p;
				r = s;
			}
			debug(t, ans);
			res[now] *= ans;
		}
		res[now] -= now;
	}

	debug(res);

	ll ans = 0;
	foa(t, a) { ans += res[t]; }
	drop(ans);

	return 0;
}
0