제출 #526755

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
526755		beepbeepsheep	Izbori (COCI22_izbori)	C++17	25 / 110	70 ms	588 KiB

Main

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

#define ll long long
#define ii pair<ll,ll>
#define endl '\n'
const ll inf=1e15;
const ll mod=1e9+7;
const ll maxn=2000+5;

ll arr[maxn];
vector<ll> v;
ll fen[2*maxn];
void upd(ll pos){
    while (pos<2*maxn){
        fen[pos]++;
        pos+=(pos&-pos);
    }
}
ll query(ll pos){
    ll ans=0;
    while (pos){
        ans+=fen[pos];
        pos-=(pos&-pos);
    }
    return ans;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n;
    cin>>n;
    for (int i=0;i<n;i++){
        cin>>arr[i];
        v.emplace_back(arr[i]);
    }
    sort(v.begin(),v.end());
    for (int i=0;i<n;i++){
        arr[i]=lower_bound(v.begin(),v.end(),arr[i])-v.begin();
    }
    ll ans=0;
    for (int i=0;i<=n;i++){
        ll tot=0;
        memset(fen,0,sizeof(fen));
        upd(2001);
        for (int j=0;j<n;j++){
            if (arr[j]==i){
                tot++;
            }else{
                tot--;
            }
            upd(tot+2001);
            ans+=query(tot+2000);
        }
    }
    cout<<ans;
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 70