oj.uz

답안 #866244

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
866244 2023-10-25T15:56:06 Z TAhmed33 Izbori (COCI22_izbori) C++
40 / 110
 372 ms 15576 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize ("Ofast")
#pragma GCC target ("popcnt")
typedef long long ll;
inline ll trig (ll x) { return ((x * (x + 1)) >> 1); }
inline ll get2 (ll a, ll b, ll c) {
	a = min(a, c); b = min(b, c);
	c = min(c, a + b);
	return (c - b) * (b + 1) + (c + 1) * (a - c + b + 1) - trig(a) + trig(c - b - 1);
}
const int MAXN = 2e5 + 25;
int arr[MAXN], n;
vector <int> occ[MAXN];
vector <int> d;
int a[2 * MAXN + 25];
ll solve1 (int x) {
	memset(a, 0, sizeof(a));
	ll ret = 0; int cur = 0; int sum = 0; a[MAXN] = 1;
	for (int i = 1; i <= n; i++) {
		if (arr[i] == x) {
			sum++; cur += a[sum - 1 + MAXN];
		} else {
			cur -= a[sum - 1 + MAXN]; sum--;
		}
		ret += cur; a[sum + MAXN]++;
	}
	return ret;
}
array <int, 500> p; 
ll solve2 (int x) {
	for (int i = 0; i < (int)occ[x].size(); i++) p[i] = occ[x][i];
	int u = occ[x].size(); ll ret = u;
	for (int i = 0; i < u - 1; i--) {
		for (int j = i + 1; j < u; j++) {
			ret += get2(p[i] - (i == 0 ? 0 : p[i - 1]), (j == u - 1 ? n + 1 : p[j + 1]) - p[j], 2 * (j - i + 1) - 2 - p[j] + p[i]);
		}
	}
	return ret;
}
int main () {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> arr[i];
		d.push_back(arr[i]);
	}
	sort(d.begin(), d.end()); d.resize(unique(d.begin(), d.end()) - d.begin());
	for (int i = 1; i <= n; i++) arr[i] = lower_bound(d.begin(), d.end(), arr[i]) - d.begin();
	for (int i = 1; i <= n; i++) {
		occ[arr[i]].push_back(i);
	}
	bool flag = 1; for (int i = 1; i <= n; i++) flag |= (arr[i] <= 2);
	if (n >= 1e5 && !flag) return 0;
	ll sum = 0;
	int x = sqrt(n); while (x * x < n) x++; while (x * x > n) x--;
	for (int i = 0; i < n; i++) {
		if (occ[i].empty()) continue;
		if ((int)occ[i].size() > x) sum += solve1(i);
		else {
			sum += solve2(i);
		}
	}
	cout << sum << '\n';
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 1 ms 6580 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 1 ms 6580 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 2 ms 6748 KB Output is correct
10 Correct 2 ms 6748 KB Output is correct
11 Correct 2 ms 6748 KB Output is correct
12 Correct 2 ms 6748 KB Output is correct
13 Correct 2 ms 6748 KB Output is correct
14 Correct 2 ms 6748 KB Output is correct
15 Correct 2 ms 6748 KB Output is correct
16 Correct 3 ms 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 8664 KB Output is correct
2 Correct 23 ms 9432 KB Output is correct
3 Correct 9 ms 8156 KB Output is correct
4 Correct 16 ms 9440 KB Output is correct
5 Correct 17 ms 9432 KB Output is correct
6 Correct 22 ms 9548 KB Output is correct
7 Correct 18 ms 9544 KB Output is correct
8 Correct 17 ms 9684 KB Output is correct
9 Correct 17 ms 9544 KB Output is correct
10 Correct 18 ms 9432 KB Output is correct
11 Correct 14 ms 9484 KB Output is correct

Subtask #4
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 1 ms 6580 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 2 ms 6748 KB Output is correct
10 Correct 2 ms 6748 KB Output is correct
11 Correct 2 ms 6748 KB Output is correct
12 Correct 2 ms 6748 KB Output is correct
13 Correct 2 ms 6748 KB Output is correct
14 Correct 2 ms 6748 KB Output is correct
15 Correct 2 ms 6748 KB Output is correct
16 Correct 3 ms 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 12 ms 8664 KB Output is correct
19 Correct 23 ms 9432 KB Output is correct
20 Correct 9 ms 8156 KB Output is correct
21 Correct 16 ms 9440 KB Output is correct
22 Correct 17 ms 9432 KB Output is correct
23 Correct 22 ms 9548 KB Output is correct
24 Correct 18 ms 9544 KB Output is correct
25 Correct 17 ms 9684 KB Output is correct
26 Correct 17 ms 9544 KB Output is correct
27 Correct 18 ms 9432 KB Output is correct
28 Correct 14 ms 9484 KB Output is correct
29 Correct 20 ms 9564 KB Output is correct
30 Runtime error 372 ms 15576 KB Execution killed with signal 11
31 Halted 0 ms 0 KB -