結果

問題 No.1233 割り切れない気持ち
ユーザー hitonanodehitonanode
提出日時 2020-09-18 23:07:53
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,012 bytes
コンパイル時間 2,236 ms
コンパイル使用メモリ 207,916 KB
実行使用メモリ 7,424 KB
最終ジャッジ日時 2024-06-22 17:18:34
合計ジャッジ時間 54,165 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,179 ms
6,816 KB
testcase_01 AC 1,182 ms
6,816 KB
testcase_02 AC 1,179 ms
6,940 KB
testcase_03 AC 1,180 ms
6,940 KB
testcase_04 AC 1,180 ms
6,944 KB
testcase_05 AC 1,178 ms
6,940 KB
testcase_06 AC 1,177 ms
6,940 KB
testcase_07 AC 1,184 ms
6,940 KB
testcase_08 AC 1,188 ms
6,940 KB
testcase_09 AC 1,195 ms
7,168 KB
testcase_10 WA -
testcase_11 AC 1,184 ms
6,944 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 AC 1,190 ms
7,352 KB
testcase_18 WA -
testcase_19 AC 1,203 ms
7,168 KB
testcase_20 AC 1,192 ms
7,296 KB
testcase_21 AC 1,197 ms
7,296 KB
testcase_22 AC 1,195 ms
7,296 KB
testcase_23 AC 1,195 ms
7,296 KB
testcase_24 AC 1,193 ms
7,296 KB
testcase_25 AC 1,196 ms
7,272 KB
testcase_26 AC 1,194 ms
7,168 KB
testcase_27 AC 1,200 ms
7,316 KB
testcase_28 AC 1,196 ms
7,136 KB
testcase_29 AC 1,196 ms
7,296 KB
testcase_30 AC 1,196 ms
7,296 KB
testcase_31 AC 1,196 ms
7,124 KB
testcase_32 AC 1,198 ms
7,296 KB
testcase_33 AC 1,198 ms
7,368 KB
testcase_34 AC 1,196 ms
7,268 KB
testcase_35 AC 1,196 ms
7,196 KB
testcase_36 AC 1,197 ms
7,296 KB
testcase_37 AC 1,177 ms
6,944 KB
testcase_38 AC 1,193 ms
7,284 KB
testcase_39 WA -
testcase_40 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template <typename V, typename T> void ndfill(V &x, const T &val) { x = val; }
template <typename V, typename T> void ndfill(vector<V> &vec, const T &val) { for (auto &v : vec) ndfill(v, val); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> srtunq(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl
#else
#define dbg(x)
#endif

constexpr lint B = 405;

int main()
{
    lint N;
    cin >> N;
    assert(N >= 1 and N <= 200000);
    vector<int> A(N);
    cin >> A;
    assert(*min_element(ALL(A)) >= 1);
    assert(*max_element(ALL(A)) <= 200000);

    vector<__int128> cnt(210000);
    for (auto a : A) cnt[a]++;

    __int128 Atot = accumulate(ALL(A), 0LL);
    __int128 ret = 0;

    for (lint i = 1; i < B; i++)
    {
        ret += cnt[i] * (Atot - cnt[i] * i);
        for (int j = i + 1; j < cnt.size(); j++)
        {
            ret -= cnt[i] * cnt[j] * (j / i * i);
        }
    }
    __int128 tmp = 0;
    vector<int> heads;
    for (lint i = B; i < lint(cnt.size()); i++)
    {
        tmp += cnt[i] * (i / B);
        if (i % B == 0) heads.emplace_back(i);
    }
    for (lint i = B; i < lint(cnt.size()); i++)
    {
        REP(k, heads.size())
        {
            int md = (i - heads[k] % i) % i;
            while (md and heads[k] < int(cnt.size()))
            {
                tmp -= cnt[heads[k]];
                heads[k]++;
                md--;
            }
        }
        while (heads.size() and heads.back() >= int(cnt.size())) heads.pop_back();

        ret += cnt[i] * (Atot - cnt[i] * i) - cnt[i] * (tmp - cnt[i]) * i;
    }
    dbg(heads.size());
    cout << lint(ret) << '\n';
}
0