Submission #1203323

#TimeUsernameProblemLanguageResultExecution timeMemory
1203323HanksburgerMountains (NOI20_mountains)C++20
100 / 100
780 ms42684 KiB
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define pii pair<int, int>
using namespace std;
using namespace __gnu_pbds;
tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> t;
int a[300005], l[300005], n, c;
map<int, int> m;
signed main()
{
    cin >> n;
    for (int i=0; i<n; i++)
    {
        cin >> a[i];
        m[a[i]]++;
        l[i]=t.order_of_key({a[i], 0});
        t.insert({a[i], m[a[i]]});
    }
    t.clear();
    m.clear();
    for (int i=n-1; i>=0; i--)
    {
        m[a[i]]++;
        c+=l[i]*t.order_of_key({a[i], 0});
        t.insert({a[i], m[a[i]]});
    }
    cout << c;
}
#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...