Submission #1191292

#TimeUsernameProblemLanguageResultExecution timeMemory
1191292oguzhan09Mountains (NOI20_mountains)C++20
66 / 100
2093 ms2760 KiB
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
    int n;
    cin>>n;
    vector<ll>l(n);
    ll enb=0;
    ll say=0;
    for(int i=0;i<n;i++){
        cin>>l[i];
        enb=max(enb,l[i]);
    }
    if(is_sorted(l.begin(),l.end())){
        cout<<0<<endl;
        return 0;
    }
    if(enb==1){
        bool seen=false;
        for(int i=0;i<n;i++){
            if(l[i]==0){
                int one_cnt=0;
                for(int j=i+1;j<n;j++){
                    if(l[j]==1) one_cnt++;
                    if(l[j]==0) say+=one_cnt;

                }
            }
        }
        cout<<say<<endl;
        return 0;
    }

    for(int i=1;i<n-1;i++){
        ll sol_say=0,sag_say=0;
        for(int j=0;j<i;j++){
            if(l[j]<l[i]) sol_say++;
        }
        for(int j=i+1;j<n;j++){
            if(l[j]<l[i]) sag_say++;
        }

        say+=sol_say*sag_say;
    }

    cout<<say<<endl;

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...