提出 #74605560


ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

struct FenwickTree {

    vector<vector<int>> bit;  // binary indexed tree
    int n;

    FenwickTree(int n) {
        this->n = n;
        bit.assign(n, {});
    }

    FenwickTree(vector<vector<long long>> const &a) : FenwickTree(a.size()) {
        for (size_t i = 0; i < a.size(); i++){
            add(i, a[i]);
        }
        for(int i = 0; i < bit.size(); i++){
            sort(bit[i].begin(),bit[i].end());
        }
    }

    int sum(int r, int t) {
        int ret = 0;
        for (; r >= 0; r = (r & (r + 1)) - 1){
            int l = -1;
            int ri = bit[r].size();
            while(ri-l > 1){
                //find first value >= T
                long long m = (l+ri)/2;
                if(bit[r][m] >= t) ri = m;
                else l = m;
            }
            ret += bit[r].size()-ri;
        }
        return ret;
    }

    int sum(int l, int r, int t) {
        return sum(r,t) - sum(l - 1,t);
    }

    void add(int idx, vector<long long> delta) {
        for (; idx < n; idx = idx | (idx + 1)){
            for(int i = 0; i < delta.size(); i++){
                bit[idx].push_back(delta[i]);
            }
        }
    }
};

int main(){
    ios_base::sync_with_stdio(false), cin.tie(nullptr);
    long long n,m,q,k; cin >> n >> m >> q >> k;
    long long ans = 0;
    vector<vector<long long>> A(n+1);
    for(int i = 0; i < m; i++){
        long long s,d; cin >> s >> d;
        A[s].push_back(d);
    }
    FenwickTree ft(A);

    for(int i = 0; i < q; i++){
        long long l,r,t; cin >> l >> r >> t;
        long long amt = ft.sum(l,r,t);
        cout << max(amt-k,0LL) << endl;
    }
}

提出情報

提出日時
問題 E - 図書館の蔵書検索
ユーザ tompan
言語 C++23 (GCC 15.2.0)
得点 466
コード長 1752 Byte
結果 AC
実行時間 265 ms
メモリ 16952 KiB

コンパイルエラー

./Main.cpp: In constructor 'FenwickTree::FenwickTree(const std::vector<std::vector<long long int> >&)':
./Main.cpp:18:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |         for(int i = 0; i < bit.size(); i++){
      |                        ~~^~~~~~~~~~~~
./Main.cpp: In member function 'void FenwickTree::add(int, std::vector<long long int>)':
./Main.cpp:45:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |             for(int i = 0; i < delta.size(); i++){
      |                            ~~^~~~~~~~~~~~~~
./Main.cpp: In function 'int main()':
./Main.cpp:55:15: warning: unused variable 'ans' [-Wunused-variable]
   55 |     long long ans = 0;
      |               ^~~

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 466 / 466
結果
AC × 5
AC × 94
セット名 テストケース
Sample sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt
All sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt, in68.txt, in69.txt, in70.txt, in71.txt, in72.txt, in73.txt, in74.txt, in75.txt, in76.txt, in77.txt, in78.txt, in79.txt, in80.txt, in81.txt, in82.txt, in83.txt, in84.txt, in85.txt, in86.txt, in87.txt, in88.txt, in89.txt
ケース名 結果 実行時間 メモリ
in01.txt AC 1 ms 3512 KiB
in02.txt AC 1 ms 3568 KiB
in03.txt AC 1 ms 3516 KiB
in04.txt AC 1 ms 3436 KiB
in05.txt AC 1 ms 3536 KiB
in06.txt AC 1 ms 3528 KiB
in07.txt AC 1 ms 3552 KiB
in08.txt AC 1 ms 3480 KiB
in09.txt AC 1 ms 3512 KiB
in10.txt AC 263 ms 16112 KiB
in11.txt AC 262 ms 16212 KiB
in12.txt AC 264 ms 16108 KiB
in13.txt AC 61 ms 16112 KiB
in14.txt AC 196 ms 15520 KiB
in15.txt AC 262 ms 16120 KiB
in16.txt AC 108 ms 16952 KiB
in17.txt AC 89 ms 16108 KiB
in18.txt AC 117 ms 16124 KiB
in19.txt AC 1 ms 3384 KiB
in20.txt AC 79 ms 14228 KiB
in21.txt AC 166 ms 16272 KiB
in22.txt AC 150 ms 16116 KiB
in23.txt AC 92 ms 16268 KiB
in24.txt AC 94 ms 16120 KiB
in25.txt AC 96 ms 16884 KiB
in26.txt AC 96 ms 16868 KiB
in27.txt AC 158 ms 16152 KiB
in28.txt AC 263 ms 16176 KiB
in29.txt AC 115 ms 16268 KiB
in30.txt AC 77 ms 5776 KiB
in31.txt AC 1 ms 3432 KiB
in32.txt AC 1 ms 3468 KiB
in33.txt AC 1 ms 3616 KiB
in34.txt AC 2 ms 3560 KiB
in35.txt AC 1 ms 3404 KiB
in36.txt AC 1 ms 3656 KiB
in37.txt AC 1 ms 3516 KiB
in38.txt AC 1 ms 3536 KiB
in39.txt AC 1 ms 3640 KiB
in40.txt AC 1 ms 3560 KiB
in41.txt AC 240 ms 16108 KiB
in42.txt AC 230 ms 16108 KiB
in43.txt AC 1 ms 3516 KiB
in44.txt AC 1 ms 3436 KiB
in45.txt AC 1 ms 3512 KiB
in46.txt AC 1 ms 3512 KiB
in47.txt AC 1 ms 3516 KiB
in48.txt AC 1 ms 3468 KiB
in49.txt AC 1 ms 3480 KiB
in50.txt AC 121 ms 16112 KiB
in51.txt AC 177 ms 16112 KiB
in52.txt AC 153 ms 16116 KiB
in53.txt AC 161 ms 16100 KiB
in54.txt AC 254 ms 16880 KiB
in55.txt AC 213 ms 16120 KiB
in56.txt AC 123 ms 13764 KiB
in57.txt AC 118 ms 16112 KiB
in58.txt AC 261 ms 16100 KiB
in59.txt AC 213 ms 16100 KiB
in60.txt AC 251 ms 16876 KiB
in61.txt AC 261 ms 16100 KiB
in62.txt AC 262 ms 16056 KiB
in63.txt AC 265 ms 16152 KiB
in64.txt AC 263 ms 16112 KiB
in65.txt AC 192 ms 16076 KiB
in66.txt AC 260 ms 16112 KiB
in67.txt AC 159 ms 16116 KiB
in68.txt AC 1 ms 3420 KiB
in69.txt AC 1 ms 3512 KiB
in70.txt AC 1 ms 3568 KiB
in71.txt AC 1 ms 3436 KiB
in72.txt AC 1 ms 3468 KiB
in73.txt AC 1 ms 3536 KiB
in74.txt AC 28 ms 16920 KiB
in75.txt AC 27 ms 16920 KiB
in76.txt AC 1 ms 3420 KiB
in77.txt AC 1 ms 3528 KiB
in78.txt AC 1 ms 3512 KiB
in79.txt AC 1 ms 3480 KiB
in80.txt AC 81 ms 16920 KiB
in81.txt AC 79 ms 16884 KiB
in82.txt AC 1 ms 3436 KiB
in83.txt AC 1 ms 3560 KiB
in84.txt AC 1 ms 3512 KiB
in85.txt AC 1 ms 3512 KiB
in86.txt AC 1 ms 3516 KiB
in87.txt AC 1 ms 3480 KiB
in88.txt AC 145 ms 16884 KiB
in89.txt AC 158 ms 16184 KiB
sample01.txt AC 1 ms 3432 KiB
sample02.txt AC 1 ms 3432 KiB
sample03.txt AC 1 ms 3516 KiB
sample04.txt AC 1 ms 3516 KiB
sample05.txt AC 1 ms 3552 KiB