# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
494494 | ammar2000 | Mountains (NOI20_mountains) | C++17 | 2087 ms | 8992 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>
#define ll long long
#define pb push_back
#define F first
#define S second
#define coy cout<<"YES\n"
#define con cout<<"NO\n"
#define co1 cout<<"-1\n"
using namespace std;
const int SI=3e5+7;
ll INF=8e18+7;
int MOD=1e9+7;
ll n,a[SI],masr[SI],an[SI],ans;
map <ll,ll> mp;
int main()
{
cin>>n;
bool fl=0;
for (int i=0;i<n;i++)
{cin>>a[i];
if (i&&a[i]<a[i-1])
fl=1;}
if (fl==0)
{
cout << 0;
return 0;
}
if (n>10010)
{for (int i=0;i<n;i++)
{
for (int t=0;t<a[i];t++)
an[i]+=mp[t];
mp[a[i]]++;
}
mp.clear();
for (int i=n-1;i>=0;i--)
{
for (int t=0;t<a[i];t++)
masr[i]+=mp[t];
mp[a[i]]++;
}
for (int i=0;i<n;i++)
ans+=masr[i]*an[i];
cout <<ans ;}
else
{
for (int i=1;i<n-1;i++)
{
ll f,s;
f=s=0;
for (int r=0;r<i;r++)
f+=(a[i]>a[r]);
for(int r=i+1;r<n;r++)
s+=(a[i]>a[r]);
ans+=f*s;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |