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
using namespace std;
const int MAX_N = 3e5;
int b[MAX_N + 5];
void solve() {
int n, q;
cin >> n >> q;
set<int>s;
for(int i=0; i<n; ++i) {
int x;
cin >> x;
++b[x];
s.insert(x);
}
int L, R;
cin >> L >> R;
ll ans = 0, cnt = 0, cnt2 = 0;
for(auto it = s.begin(); it != s.end(); ++it) {
int cur = *it;
cnt2 += b[cur];
cnt += cnt2;
ans += cnt * b[cur];
}
cout << ans << endl;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int t = 1;
while(t--) solve();
return 0;
}
# | 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... |