結果
問題 | No.1262 グラフを作ろう! |
ユーザー | haruki_K |
提出日時 | 2020-10-17 01:31:58 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 343 ms / 3,000 ms |
コード長 | 4,646 bytes |
コンパイル時間 | 2,710 ms |
コンパイル使用メモリ | 203,572 KB |
実行使用メモリ | 26,648 KB |
最終ジャッジ日時 | 2023-09-28 07:11:45 |
合計ジャッジ時間 | 26,033 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 175 ms
17,068 KB |
testcase_01 | AC | 130 ms
13,508 KB |
testcase_02 | AC | 210 ms
19,912 KB |
testcase_03 | AC | 132 ms
13,660 KB |
testcase_04 | AC | 162 ms
15,912 KB |
testcase_05 | AC | 153 ms
15,088 KB |
testcase_06 | AC | 221 ms
18,004 KB |
testcase_07 | AC | 37 ms
6,412 KB |
testcase_08 | AC | 222 ms
20,432 KB |
testcase_09 | AC | 86 ms
10,316 KB |
testcase_10 | AC | 104 ms
11,640 KB |
testcase_11 | AC | 241 ms
21,888 KB |
testcase_12 | AC | 156 ms
15,728 KB |
testcase_13 | AC | 138 ms
14,172 KB |
testcase_14 | AC | 108 ms
12,108 KB |
testcase_15 | AC | 64 ms
9,016 KB |
testcase_16 | AC | 219 ms
19,644 KB |
testcase_17 | AC | 174 ms
17,024 KB |
testcase_18 | AC | 239 ms
21,520 KB |
testcase_19 | AC | 142 ms
14,656 KB |
testcase_20 | AC | 244 ms
20,640 KB |
testcase_21 | AC | 218 ms
20,460 KB |
testcase_22 | AC | 126 ms
13,332 KB |
testcase_23 | AC | 95 ms
10,924 KB |
testcase_24 | AC | 214 ms
20,172 KB |
testcase_25 | AC | 83 ms
9,892 KB |
testcase_26 | AC | 104 ms
11,624 KB |
testcase_27 | AC | 186 ms
18,068 KB |
testcase_28 | AC | 160 ms
15,756 KB |
testcase_29 | AC | 159 ms
16,476 KB |
testcase_30 | AC | 112 ms
12,340 KB |
testcase_31 | AC | 181 ms
17,820 KB |
testcase_32 | AC | 139 ms
14,720 KB |
testcase_33 | AC | 43 ms
6,800 KB |
testcase_34 | AC | 227 ms
21,052 KB |
testcase_35 | AC | 136 ms
14,244 KB |
testcase_36 | AC | 44 ms
6,948 KB |
testcase_37 | AC | 247 ms
22,200 KB |
testcase_38 | AC | 175 ms
17,148 KB |
testcase_39 | AC | 86 ms
10,292 KB |
testcase_40 | AC | 103 ms
11,596 KB |
testcase_41 | AC | 186 ms
17,612 KB |
testcase_42 | AC | 237 ms
21,332 KB |
testcase_43 | AC | 145 ms
14,912 KB |
testcase_44 | AC | 143 ms
14,656 KB |
testcase_45 | AC | 246 ms
22,164 KB |
testcase_46 | AC | 213 ms
19,544 KB |
testcase_47 | AC | 82 ms
10,236 KB |
testcase_48 | AC | 206 ms
19,796 KB |
testcase_49 | AC | 230 ms
21,428 KB |
testcase_50 | AC | 245 ms
21,428 KB |
testcase_51 | AC | 107 ms
11,956 KB |
testcase_52 | AC | 239 ms
18,872 KB |
testcase_53 | AC | 63 ms
8,392 KB |
testcase_54 | AC | 165 ms
16,232 KB |
testcase_55 | AC | 150 ms
15,108 KB |
testcase_56 | AC | 180 ms
17,084 KB |
testcase_57 | AC | 282 ms
24,680 KB |
testcase_58 | AC | 146 ms
14,724 KB |
testcase_59 | AC | 222 ms
17,688 KB |
testcase_60 | AC | 275 ms
23,220 KB |
testcase_61 | AC | 102 ms
11,600 KB |
testcase_62 | AC | 207 ms
19,644 KB |
testcase_63 | AC | 155 ms
15,756 KB |
testcase_64 | AC | 136 ms
14,200 KB |
testcase_65 | AC | 101 ms
11,424 KB |
testcase_66 | AC | 111 ms
12,092 KB |
testcase_67 | AC | 128 ms
13,476 KB |
testcase_68 | AC | 215 ms
19,272 KB |
testcase_69 | AC | 122 ms
12,936 KB |
testcase_70 | AC | 251 ms
22,476 KB |
testcase_71 | AC | 188 ms
18,080 KB |
testcase_72 | AC | 278 ms
22,900 KB |
testcase_73 | AC | 243 ms
21,588 KB |
testcase_74 | AC | 189 ms
18,280 KB |
testcase_75 | AC | 211 ms
19,336 KB |
testcase_76 | AC | 183 ms
17,584 KB |
testcase_77 | AC | 198 ms
18,668 KB |
testcase_78 | AC | 214 ms
19,532 KB |
testcase_79 | AC | 277 ms
24,148 KB |
testcase_80 | AC | 262 ms
22,488 KB |
testcase_81 | AC | 184 ms
18,280 KB |
testcase_82 | AC | 209 ms
20,512 KB |
testcase_83 | AC | 244 ms
21,364 KB |
testcase_84 | AC | 184 ms
18,156 KB |
testcase_85 | AC | 269 ms
24,724 KB |
testcase_86 | AC | 200 ms
19,704 KB |
testcase_87 | AC | 248 ms
22,564 KB |
testcase_88 | AC | 182 ms
18,348 KB |
testcase_89 | AC | 230 ms
20,712 KB |
testcase_90 | AC | 323 ms
26,460 KB |
testcase_91 | AC | 343 ms
26,452 KB |
testcase_92 | AC | 330 ms
26,468 KB |
testcase_93 | AC | 318 ms
26,648 KB |
testcase_94 | AC | 312 ms
26,580 KB |
testcase_95 | AC | 303 ms
26,452 KB |
ソースコード
// >>> TEMPLATES #include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using i32 = int32_t; using i64 = int64_t; using u32 = uint32_t; using u64 = uint64_t; #define int ll #define double ld #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define rep1(i,n) for (int i = 1; i <= (int)(n); i++) #define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--) #define rep1R(i,n) for (int i = (int)(n); i >= 1; i--) #define loop(i,a,B) for (int i = a; i B; i++) #define loopR(i,a,B) for (int i = a; i B; i--) #define all(x) begin(x), end(x) #define allR(x) rbegin(x), rend(x) #define pb push_back #define eb emplace_back #define mp make_pair #define fst first #define snd second template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1; auto constexpr INF32 = inf<int32_t>; auto constexpr INF64 = inf<int64_t>; auto constexpr INF = inf<int>; #ifdef LOCAL #include "debug.hpp" #else #define dump(...) (void)(0) #define say(x) (void)(0) #define debug if (0) #endif template <class T> using pque_max = priority_queue<T>; template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >; template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type> ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; } template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type> istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; } template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; } template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; } struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup; template <class F> struct FixPoint : private F { constexpr FixPoint(F&& f) : F(forward<F>(f)) {} template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); } }; struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } }; #define MFP MakeFixPoint()| #define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__) template <class T, size_t d> struct vec_impl { using type = vector<typename vec_impl<T,d-1>::type>; template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); } }; template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } }; template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type; template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); } template <class T> void quit(T const& x) { cout << x << endl; exit(0); } template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; } template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; } template <class It> constexpr auto sumof(It b, It e) { using S = typename iterator_traits<It>::value_type; using T = conditional_t<is_signed_v<S>,i64,u64>; return accumulate(b,e,T{}); } template <class T> int sz(T const& x) { return x.size(); } template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(v.begin(), v.end(), x)-v.begin(); } template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(v.begin(), v.end(), x)-v.begin(); } const int dx[] = { 1,0,-1,0 }; const int dy[] = { 0,1,0,-1 }; constexpr int popcnt(ll x) { return __builtin_popcountll(x); } template <class Int> Int rand(Int a, Int b) { // [a,b] static mt19937_64 mt{random_device{}()}; return uniform_int_distribution<Int>(a,b)(mt); } i64 irand(i64 a, i64 b) { return rand<i64>(a,b); } u64 urand(u64 a, u64 b) { return rand<u64>(a,b); } // <<< int32_t main() { int n,m; cin >> n >> m; vector<int> a(m); cin >> a; vector<int> v(n+1); rep (i,m) v[a[i]]++; vector<int> w(n+1); rep1 (x,n) { for (int y = x; y <= n; y += x) { w[x] += y/x * v[y]; } } for (int x = n; x >= 1; x--) { for (int y = 2*x; y <= n; y += x) { w[x] -= w[y]; } } int ans = 0; rep1 (x,n) ans += x*w[x]; ans -= sumof(all(a)); cout << ans << endl; }