oj.uz

답안 #968055

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
968055 2024-04-23T07:27:29 Z vjudge1 Vudu (COCI15_vudu) C++17
126 / 140
 709 ms 58580 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
int n;
unordered_map<int, int> fw;
long long ans;
 
void update(int idx, int val){
    for(; idx <= n; idx+=(idx&-idx)) fw[idx]+=val;
}
 
long long query(int idx){
    long long sum = 0;
    for(; idx; idx-=(idx&-idx)) sum+=fw[idx];
    return sum;
}
 
signed main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n;
    long long qs[n+1], k;
    vector<long long> v;
    memset(qs, 0, sizeof(qs));
    for(int i = 1; i<=n; ++i) cin >> qs[i];
    cin >> k;
    for(int i = 1; i<=n; ++i) qs[i]+=qs[i - 1];
    for(int i = 1; i<=n; ++i) v.push_back(qs[i] - i*k);
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()));
    for(int i = 0; i<=n; ++i){
        int id = lower_bound(v.begin(), v.end(), qs[i] - i*k) - v.begin();
        ans+=query(id+1);
        update(id+1, 1);
    }
    cout << ans;
}

Subtask #1
126.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 860 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 709 ms 57168 KB Output is correct
5 Correct 280 ms 32948 KB Output is correct
6 Runtime error 129 ms 30904 KB Execution killed with signal 11
7 Correct 450 ms 54332 KB Output is correct
8 Correct 422 ms 52132 KB Output is correct
9 Correct 543 ms 58580 KB Output is correct
10 Correct 455 ms 53148 KB Output is correct