# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
526761 | beepbeepsheep | Izbori (COCI22_izbori) | C++17 | 3042 ms | 6688 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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=2e5+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.push_back(arr[i]);
}
sort(v.begin(),v.end());
vector<ll> newv;
for (auto u:v){
if (newv.empty()) newv.push_back(u);
else if (newv.back()!=u) newv.push_back(u);
}
for (int i=0;i<n;i++){
arr[i]=lower_bound(newv.begin(),newv.end(),arr[i])-newv.begin();
}
ll ans=0;
for (int i=0;i<newv.size();i++){
ll tot=0;
memset(fen,0,sizeof(fen));
upd(2e5+1);
for (int j=0;j<n;j++){
if (arr[j]==i){
tot++;
}else{
tot--;
}
upd(tot+2e5+1);
ans+=query(tot+2e5);
}
}
cout<<ans;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |