結果

問題 No.1233 割り切れない気持ち
ユーザー hirono999hirono999
提出日時 2020-10-07 22:23:54
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 911 ms / 3,153 ms
コード長 6,414 bytes
コンパイル時間 3,074 ms
コンパイル使用メモリ 225,236 KB
実行使用メモリ 6,400 KB
最終ジャッジ日時 2024-07-20 04:17:00
合計ジャッジ時間 14,335 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 55 ms
5,376 KB
testcase_08 AC 100 ms
5,376 KB
testcase_09 AC 217 ms
5,760 KB
testcase_10 AC 215 ms
5,888 KB
testcase_11 AC 49 ms
5,376 KB
testcase_12 AC 249 ms
6,400 KB
testcase_13 AC 260 ms
6,400 KB
testcase_14 AC 273 ms
6,400 KB
testcase_15 AC 253 ms
6,400 KB
testcase_16 AC 262 ms
6,272 KB
testcase_17 AC 28 ms
6,400 KB
testcase_18 AC 251 ms
6,400 KB
testcase_19 AC 36 ms
6,272 KB
testcase_20 AC 18 ms
6,400 KB
testcase_21 AC 38 ms
6,272 KB
testcase_22 AC 39 ms
6,400 KB
testcase_23 AC 37 ms
6,400 KB
testcase_24 AC 37 ms
6,400 KB
testcase_25 AC 37 ms
6,272 KB
testcase_26 AC 37 ms
6,272 KB
testcase_27 AC 911 ms
6,400 KB
testcase_28 AC 795 ms
6,400 KB
testcase_29 AC 725 ms
6,400 KB
testcase_30 AC 670 ms
6,400 KB
testcase_31 AC 621 ms
6,400 KB
testcase_32 AC 594 ms
6,272 KB
testcase_33 AC 553 ms
6,272 KB
testcase_34 AC 511 ms
6,400 KB
testcase_35 AC 494 ms
6,400 KB
testcase_36 AC 459 ms
6,272 KB
testcase_37 AC 2 ms
5,376 KB
testcase_38 AC 16 ms
6,400 KB
testcase_39 AC 128 ms
6,400 KB
testcase_40 AC 125 ms
6,272 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
constexpr long long INF = 1LL << 60;
double PI = acos(-1.0);
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) sort(ALL(c));for(bool c##p=1;c##p;c##p=next_permutation(ALL(c)))
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define pb push_back
#define to_s to_string
#define len(v) (ll)v.size()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define print(x) cout << (x) << '\n'
#define drop(x) cout << (x) << '\n', exit(0)
#define debug(x) cout << #x << ": " << (x) << '\n'
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> tpl;
typedef vector<ll> vec;
typedef vector<vector<ll>> vec2;
typedef vector<vector<vector<ll>>> vec3;
template<class S, class T> inline bool chmax(S &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class S, class T> inline bool chmin(S &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline ll msb(ll v) { return 1 << (31 - __builtin_clzll(v)); }
inline ll devc(ll x, ll y) { return (x + y - 1) / y; }
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a * (b / gcd(a, b)); }
 
struct IoSetup {
    IoSetup() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(10);
        cerr << fixed << setprecision(10);
    }
} iosetup;
 
template< typename T1, typename T2 >
ostream &operator << (ostream &os, const pair< T1, T2 > &p) {
    os << p.first << " " << p.second;
    return os;
}
 
template< typename T1, typename T2 >
istream &operator >> (istream &is, pair< T1, T2 > &p) {
    is >> p.first >> p.second;
    return is;
}
 
template< typename T1, typename T2, typename T3 >
ostream &operator << (ostream &os, const tuple< T1, T2, T3 > &t) {
    os << get<0>(t) << " " << get<1>(t) << " " << get<2>(t);
    return os;
}
 
template< typename T1, typename T2, typename T3 >
istream &operator >> (istream &is, tuple< T1, T2, T3 > &t) {
    is >> get<0>(t) >> get<1>(t) >> get<2>(t);
    return is;
}
 
template< typename T >
ostream &operator << (ostream &os, const vector< T > &v){
    for (int i = 0; i < (int)v.size(); ++i) {
        os << v[i] << (i + 1 != v.size() ? " " : "");
    }
    return os;
}
 
template< typename T >
istream &operator >>  (istream &is, vector< T > &v){
    for(T &in : v) is >> in;
    return is;
}

template< typename T >
ostream &operator << (ostream &os, const set< T > &st){
    int ct = 0;
    for(auto& s : st) cout << s << (++ct != st.size() ? " " : "");
    return os;
}

template <typename T>
constexpr set<T> &operator|= (set<T> &st1, const set<T> &st2) { 
    for(auto& s : st2) st1.insert(s);
    return st1; 
}

template <typename T>
constexpr set<T> &operator-= (set<T> &st1, const set<T> &st2) {
    for(auto& s : st2) if(st1.count(s)) st1.erase(s);
    return st1;
}

template <typename T>
constexpr set<T> &operator&= (set<T> &st1, const set<T> &st2) {
    auto itr = st1.begin();
    while(itr != st1.end()){
        if(!st2.count(*itr)) itr = st1.erase(itr);
        else ++itr;
    }
    return st1;
}

template <typename T>
constexpr set<T> operator| (const set<T> &st1, const set<T> &st2) {
    set<T> res = st1;
    res |= st2;
    return res;
}

template <typename T>
constexpr set<T> operator- (const set<T> &st1, const set<T> &st2) {
    set<T> res = st1;
    res -= st2;
    return res;
}

template <typename T>
constexpr set<T> operator& (const set<T> &st1, const set<T> &st2) {
    set<T> res = st1;
    res &= st2;
    return res;
}

/*---------------------------------    Tools    ------------------------------------------*/
template< typename T >
vector<T> cumsum(const vector<T> &X){
    vector<T> res(X.size() + 1, 0);
    for(int i = 0; i < X.size(); ++i) res[i + 1] += res[i] + X[i];
    return res;
}
 
template< typename S, typename T, typename F>
pair<T, T> bisearch(S left, T right, F f) {
    while(abs(right - left) > 1){
        T mid = (right + left) / 2;
        if(f(mid)) right = mid;
        else left = mid;
    }
    return {left, right};
}
 
template< typename S, typename T, typename F>
double trisearch(S left, T right, F f, int maxLoop = 90){
    double low = left, high = right;
    while(maxLoop--){
        double mid_left = high / 3 + low * 2 / 3;
        double mid_right = high * 2 / 3 + low / 3;
        if(f(mid_left) >= f(mid_right)) low = mid_left;
        else high = mid_right;
    }
    return (low + high) * 0.5;
}

template< typename F >
ll ternarySearch(ll L, ll R, F f) { //[L, R)
    ll lo = L - 1, hi = R - 1;
    while (lo + 1 != hi) {
        ll mi = (lo + hi) / 2;
        if (f(mi) <= f(mi + 1)) hi = mi;
        else lo = mi;
    }
    return hi;
}

template< typename T >
class BinaryIndexedTree{
    private:
        vector<T> array;

    public:
        // Constructer
        BinaryIndexedTree(long long sz){
            array.assign(++sz, 0LL);
        }

        // Culuclate sum in the inclusive range [0,k]
        T sum(long long k) {
            T ret = 0;
            for (++k; k > 0; k -= k & -k) ret += array[k];
            return (ret);
        }

        // Add x to k th element
        void add(long long k, T x){
            for (++k; k < array.size(); k += k & -k) array[k] += x;
        }
};

//#include <atcoder/all>
//using namespace atcoder;
constexpr long long MOD = 1000000007;
/*------------------------------- Main Code Here -----------------------------------------*/
 
int main()
{
    ll N;
    cin >> N;
    vec A(N);
    cin >> A;
    sort(ALL(A));

    vec cum = cumsum(A);

    ll ans = 0;
    ll mx = *max_element(ALL(A));
    rep(i, N){
        if(A[i] == 1) continue;
        //A[i]未満のindex
        ll x = lower_bound(ALL(A), A[i]) - A.begin();
        ans += cum[x];

        //A[i]より大きいindex
        ll y = upper_bound(ALL(A), A[i]) - A.begin();

        ans += cum[N] - cum[y];

        for(ll k = 1; k <= 1e5; ++k){
            if(k * A[i] > mx) break;
            ll S = k == 1 ? A[i] + 1 : k * A[i];
            ll y = A.end() - lower_bound(ALL(A), S);
            ans -= y * A[i];
        }
    }
    print(ans);

    return 0;
}
0