oj.uz

답안 #762753

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
762753 2023-06-21T17:26:16 Z ETheBest3 Vudu (COCI15_vudu) C++14
126 / 140
 783 ms 65536 KB 
#include<bits/stdc++.h>
#define endl "\n"
#define lli int
using namespace std;
const lli MAXN=1000005;
lli N, a[MAXN], P, tree[MAXN];
long long pref[MAXN], ss[MAXN], ans;
unordered_map<long long, lli> m;
void update(lli i, lli d){
    while(i<=N+1){
        tree[i]+=d;
        i+=i&(-i);
    }
    return;
}
lli query(lli i){
    lli otg=0;
    while(i>0){
        otg+=tree[i];
        i-=i&(-i);
    }
    return otg;
}
int main() {
    ios_base::sync_with_stdio(0);
    cout.tie(0);
    cin.tie(0);
    cin>>N;
    for(lli i=1; i<=N; i++){
        cin>>a[i];
    }
    cin>>P;
    for(lli i=1; i<=N; i++){
        a[i]-=P;
        pref[i]=pref[i-1]+a[i];
        ss[i]=pref[i];
    }
    sort(ss, ss+N+1);
    lli k=1;
    for(lli i=0; i<=N; i++){
        if(i!=0 and ss[i]==ss[i-1])continue;
        m[ss[i]]=k;
        k++;
    }
    update(m[0], 1);
    for(lli i=1; i<=N; i++){
        ans+=query(m[pref[i]]);
        update(m[pref[i]], 1);
    }
    cout<<ans<<endl;
    return 0;
}

Subtask #1
126.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 783 ms 64476 KB Output is correct
5 Correct 387 ms 35924 KB Output is correct
6 Correct 683 ms 58488 KB Output is correct
7 Correct 682 ms 60428 KB Output is correct
8 Correct 583 ms 54660 KB Output is correct
9 Runtime error 627 ms 65536 KB Execution killed with signal 9
10 Correct 665 ms 59148 KB Output is correct