oj.uz

답안 #968012

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
968012 2024-04-23T06:54:55 Z jadai007 Vudu (COCI15_vudu) C++14
126 / 140
 270 ms 44936 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
int n, arr[1000100] , fw[2200100];
long long qs[1000100], k;
vector<long long> v;
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;
    for(int i = 1; i<=n; ++i) cin >> arr[i];
    cin >> k;
    for(int i = 1; i<=n; ++i) qs[i] = qs[i - 1] + arr[i];
    for(int i = 0; i<=n; ++i) v.push_back(qs[i] - i*k);
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()));
    //update(1, 1);
    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 2 ms 2652 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 270 ms 26164 KB Output is correct
5 Correct 132 ms 17096 KB Output is correct
6 Runtime error 148 ms 44936 KB Execution killed with signal 11
7 Correct 214 ms 25272 KB Output is correct
8 Correct 188 ms 22372 KB Output is correct
9 Correct 245 ms 26720 KB Output is correct
10 Correct 210 ms 25144 KB Output is correct