Submission #1203322

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