oj.uz

답안 #967686

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
967686 2024-04-22T15:58:59 Z jadai007 Vudu (COCI15_vudu) C++14
126 / 140
 265 ms 55852 KB 
#include<bits/stdc++.h>
#define int long long

using namespace std;

int n,k,arr[1000010], ans, qs[1000010], fw[1000010];
vector<int> vc;

void update(int idx, int val){
    for(int i = idx; i<=1e6; i+=(i&-i)) fw[i]+=val;
}

int query(int idx){
    int sum = 0;
    for(int i = idx; i>0; i-=(i&-i)) sum+=fw[i];
    return sum;
}

signed main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n;
    for(int i = 1; i<=n; ++i) cin >> arr[i];
    for(int i = 1; i<=n; ++i) qs[i] = qs[i - 1] + arr[i];
    cin >> k;
    for(int i = 0; i<=n; ++i) vc.push_back(qs[i] - k*i);
    sort(vc.begin(), vc.end());
    vc.erase(unique(vc.begin(), vc.end()));
    for(int i = 0; i<=n; ++i){
        int idx = lower_bound(vc.begin(), vc.end(), qs[i] - k*i) - vc.begin();
        ans+=query(idx+1);
        update(idx+1, 1);
    }
    cout << ans;
}

Subtask #1
126.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6744 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 3 ms 6872 KB Output is correct
4 Correct 265 ms 40904 KB Output is correct
5 Correct 137 ms 28856 KB Output is correct
6 Runtime error 134 ms 55852 KB Execution killed with signal 11
7 Correct 224 ms 38148 KB Output is correct
8 Correct 199 ms 36680 KB Output is correct
9 Correct 258 ms 41520 KB Output is correct
10 Correct 224 ms 37288 KB Output is correct