# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
290879 | crossing0ver | W (RMI18_w) | C++17 | 72 ms | 5496 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 pii pair<int,int>
#define vi vector<int>
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
int cnt[1000005],arr[300005];
main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i< n; i++) {
cin >> arr[i];
cnt[arr[i]]++;
}
sort(arr,arr+n);
reverse(arr,arr+n);
if (arr[n-1] == arr[0]) {
cout << 0;
return 0;
}
for (int i = 1; i < n; i++) {
if (arr[i] != arr[i-1]) {
ll left = i;
ll right = n - left;
if (left < 3 || right < 2) {
cout << 0;
return 0;
}
ll ans = 0;
for (int i = 1; i <= left - 2; i++)
ans += (left - i - 1);
ans *= right - 1;
cout << ans;
return 0;
}
}
int a[2] = {};
int c= 0;
ll ans = 1;
for (int i = 1; i <= 1000000; i++) {
if (cnt[i]) {
c++;
ans*=(cnt[i] - 1);
}
}
cout << ans*(c/2);
}
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... |