#568280 (C++17) No.1262 グラフを作ろう！

提出ソース

結果

問題	No.1262 グラフを作ろう！
ユーザー	haruki_K
提出日時	2020-10-17 01:31:58
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	377 ms / 3,000 ms
コード長	4,646 bytes
コンパイル時間	2,299 ms
コンパイル使用メモリ	207,176 KB
実行使用メモリ	26,752 KB
最終ジャッジ日時	2024-07-21 01:38:48
合計ジャッジ時間	27,996 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	167 ms 17,188 KB
testcase_01	AC	124 ms 13,680 KB
testcase_02	AC	210 ms 20,048 KB
testcase_03	AC	128 ms 13,856 KB
testcase_04	AC	172 ms 16,060 KB
testcase_05	AC	147 ms 15,232 KB
testcase_06	AC	245 ms 18,260 KB
testcase_07	AC	38 ms 6,528 KB
testcase_08	AC	268 ms 20,388 KB
testcase_09	AC	83 ms 10,380 KB
testcase_10	AC	103 ms 11,776 KB
testcase_11	AC	303 ms 21,760 KB
testcase_12	AC	155 ms 15,928 KB
testcase_13	AC	136 ms 14,364 KB
testcase_14	AC	111 ms 12,228 KB
testcase_15	AC	61 ms 8,832 KB
testcase_16	AC	249 ms 19,840 KB
testcase_17	AC	180 ms 17,032 KB
testcase_18	AC	251 ms 21,760 KB
testcase_19	AC	165 ms 14,848 KB
testcase_20	AC	292 ms 20,668 KB
testcase_21	AC	216 ms 20,608 KB
testcase_22	AC	138 ms 13,540 KB
testcase_23	AC	91 ms 11,008 KB
testcase_24	AC	235 ms 20,428 KB
testcase_25	AC	84 ms 10,100 KB
testcase_26	AC	108 ms 11,904 KB
testcase_27	AC	214 ms 18,048 KB
testcase_28	AC	165 ms 15,744 KB
testcase_29	AC	204 ms 16,256 KB
testcase_30	AC	113 ms 12,436 KB
testcase_31	AC	228 ms 18,056 KB
testcase_32	AC	143 ms 14,848 KB
testcase_33	AC	42 ms 7,040 KB
testcase_34	AC	307 ms 21,248 KB
testcase_35	AC	135 ms 14,464 KB
testcase_36	AC	43 ms 7,040 KB
testcase_37	AC	266 ms 22,272 KB
testcase_38	AC	184 ms 17,304 KB
testcase_39	AC	84 ms 10,296 KB
testcase_40	AC	103 ms 11,520 KB
testcase_41	AC	232 ms 17,812 KB
testcase_42	AC	283 ms 21,632 KB
testcase_43	AC	154 ms 15,104 KB
testcase_44	AC	141 ms 14,820 KB
testcase_45	AC	348 ms 22,352 KB
testcase_46	AC	297 ms 19,712 KB
testcase_47	AC	78 ms 10,504 KB
testcase_48	AC	224 ms 19,868 KB
testcase_49	AC	244 ms 21,600 KB
testcase_50	AC	266 ms 21,504 KB
testcase_51	AC	104 ms 12,092 KB
testcase_52	AC	253 ms 18,944 KB
testcase_53	AC	63 ms 8,448 KB
testcase_54	AC	161 ms 16,588 KB
testcase_55	AC	148 ms 15,104 KB
testcase_56	AC	199 ms 17,176 KB
testcase_57	AC	307 ms 24,704 KB
testcase_58	AC	149 ms 14,944 KB
testcase_59	AC	223 ms 17,920 KB
testcase_60	AC	314 ms 23,364 KB
testcase_61	AC	102 ms 11,620 KB
testcase_62	AC	220 ms 19,796 KB
testcase_63	AC	152 ms 15,744 KB
testcase_64	AC	134 ms 14,208 KB
testcase_65	AC	111 ms 11,648 KB
testcase_66	AC	114 ms 12,416 KB
testcase_67	AC	141 ms 13,444 KB
testcase_68	AC	304 ms 19,452 KB
testcase_69	AC	125 ms 13,000 KB
testcase_70	AC	318 ms 22,488 KB
testcase_71	AC	205 ms 18,304 KB
testcase_72	AC	323 ms 23,040 KB
testcase_73	AC	245 ms 21,760 KB
testcase_74	AC	183 ms 18,296 KB
testcase_75	AC	233 ms 19,456 KB
testcase_76	AC	192 ms 17,784 KB
testcase_77	AC	200 ms 18,816 KB
testcase_78	AC	228 ms 19,796 KB
testcase_79	AC	351 ms 24,260 KB
testcase_80	AC	349 ms 22,656 KB
testcase_81	AC	195 ms 18,484 KB
testcase_82	AC	219 ms 20,480 KB
testcase_83	AC	313 ms 21,652 KB
testcase_84	AC	199 ms 18,048 KB
testcase_85	AC	319 ms 24,704 KB
testcase_86	AC	206 ms 19,712 KB
testcase_87	AC	268 ms 22,852 KB
testcase_88	AC	187 ms 18,504 KB
testcase_89	AC	265 ms 20,736 KB
testcase_90	AC	377 ms 26,540 KB
testcase_91	AC	333 ms 26,624 KB
testcase_92	AC	368 ms 26,496 KB
testcase_93	AC	358 ms 26,496 KB
testcase_94	AC	374 ms 26,752 KB
testcase_95	AC	375 ms 26,624 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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


}

yukicoder

結果

テストケース

ソースコード