結果

問題 No.728 ギブ and テイク
ユーザー Pachicobue
提出日時 2018-08-24 11:20:53
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 232 ms / 3,000 ms
コード長 2,877 bytes
コンパイル時間 2,318 ms
コンパイル使用メモリ 204,816 KB
最終ジャッジ日時 2025-01-06 12:30:04
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:58:87: warning: narrowing conversion of ‘(((long long unsigned int)A.std::vector<long long int>::operator[](i)) - ((long long unsigned int)L))’ from ‘long long unsigned int’ to ‘long long int’ [-Wnarrowing]
   58 |     for (std::size_t i = 0, L; i < N; i++) { std::cin >> L >> R[i], X.push_back({A[i] - L, {false, i}}); }

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#define show(x) std::cerr << #x << " = " << x << std::endl
using ll = long long;
using ull = unsigned long long;
constexpr std::size_t PC(const ull v)
{
    ull count = (v & 0x5555555555555555ULL) + ((v >> 1) & 0x5555555555555555ULL);
    count = (count & 0x3333333333333333ULL) + ((count >> 2) & 0x3333333333333333ULL);
    count = (count & 0x0f0f0f0f0f0f0f0fULL) + ((count >> 4) & 0x0f0f0f0f0f0f0f0fULL);
    count = (count & 0x00ff00ff00ff00ffULL) + ((count >> 8) & 0x00ff00ff00ff00ffULL);
    count = (count & 0x0000ffff0000ffffULL) + ((count >> 16) & 0x0000ffff0000ffffULL);
    return static_cast<std::size_t>((count & 0x00000000ffffffffULL) + ((count >> 32) & 0x00000000ffffffffULL));
}
constexpr std::size_t LG(ull v) { return v == 0 ? 0 : (v--, v |= (v >> 1), v |= (v >> 2), v |= (v >> 4), v |= (v >> 8), v |= (v >> 16), v |= (v >> 32
    ), PC(v)); }
constexpr ull SZ(const ull v) { return 1ULL << LG(v); }
struct Sum
{
    using T = ll;
    T operator()(const T& a, const T& b) const { return a + b; }
    static T inv(const T& a) { return -a; }
    static constexpr T id() { return 0; }
};
template <typename Base>
class BinaryIndexedTree
{
public:
    using T = typename Base::T;
    using AbelGroup = Base;
    BinaryIndexedTree(const std::size_t n) : data_num(n), size(SZ(n)), value(size + 1, Base::id()) {}
    T accumulate(const std::size_t a) const  // [0,a]
    {
        T sum = Base::id();
        for (std::size_t ind = a + 1; ind != 0; ind &= ind - 1) { sum = op(sum, value[ind]); }
        return sum;
    }
    T accumulate(const std::size_t l, const std::size_t r) const { return op(accumulate(r - 1), Base::inv(l == 0 ? Base::id() : accumulate(l - 1))); }
    void add(const std::size_t a, const T& val)
    {
        for (std::size_t ind = a + 1; ind <= size; ind += ind & (-ind)) { value[ind] = op(value[ind], val); }
    }
private:
    const std::size_t data_num, size;
    const Base op{};
    std::vector<T> value;
};
int main()
{
    std::cin.tie(0);
    std::ios::sync_with_stdio(false);
    std::size_t N;
    std::cin >> N;
    std::vector<ll> A(N), R(N);
    using P = std::pair<ll, std::pair<bool, std::size_t>>;  // (座標,(Aiの値か,添字))
    std::vector<P> X;
    for (std::size_t i = 0; i < N; i++) { std::cin >> A[i], X.push_back({A[i], {true, i}}); }
    for (std::size_t i = 0, L; i < N; i++) { std::cin >> L >> R[i], X.push_back({A[i] - L, {false, i}}); }
    std::sort(X.begin(), X.end());
    BinaryIndexedTree<Sum> bit(N);
    ll ans = 0;
    for (const auto p : X) {
        const std::size_t i = p.second.second;
        if (p.second.first) {
            const std::size_t k = std::upper_bound(A.begin(), A.end(), p.first + R[i]) - A.begin();
            ans += bit.accumulate(i + 1, k);
        } else {
            bit.add(i, 1);
        }
    }
    std::cout << ans << std::endl;
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0