oj.uz

Submission #527945

# Submission time Handle Problem Language Result Execution time Memory
527945 2022-02-18T20:13:56 Z 1ne Izbori (COCI22_izbori) C++14
25 / 110
 870 ms 5924 KB 
#include<iostream>
#include<algorithm>
#include<functional>
#include<numeric>
#include<vector>
#include<utility>
#include<map>
#include<set>
using namespace std;
long long merge(int left, int mid, int right, vector<int64_t>& arr) {
	vector<int64_t>temp;
	int i = left, j = mid + 1;
	long long ans = 0;
	while (i <= mid && j <= right) {
		if (arr[i] <= arr[j]) {
			temp.push_back(arr[i]);
			++i;
		}
		else {
			temp.push_back(arr[j]);
			++j;
		}
	}
	while (i <= mid) {
		temp.push_back(arr[i]);
		++i;
	}
	while (j <= right) {
		temp.push_back(arr[j]);
		++j;
	}
	for (auto x : temp) {
		arr[left] = x;
		++left;
	}
	return ans;
}
long long mergesort(int left, int right, vector<int64_t>& arr) {
	int mid = (left + right) >> 1;
	if (left >= right)return 0;
	long long ans = 0;
	ans += mergesort(left, mid, arr);
	ans += mergesort(mid + 1, right, arr);
	ans += merge(left, mid, right, arr);
	return ans;
}
int main() {
	int n;cin >> n;
	vector<int>arr(n);
	bool ok = true;
	for (int i = 0;i < n;++i) {
		cin >> arr[i];
		if (arr[i] > 2)ok = false;
		arr[i]--;
	}
	if (ok) {
		vector<vector<int64_t>>freq(2, vector<int64_t>(n, 0));
		for (int i = 0;i < n;++i) {
			freq[arr[i]][i]++;
			if (i == 0)continue;
			freq[0][i] += freq[0][i-1];
			freq[1][i] += freq[1][i-1];
		}
		int64_t ans = mergesort(0, n - 1, freq[0]) + mergesort(0, n - 1, freq[1]);
		cout << ans << '\n';
		return 0;
	}
	int64_t ans = n;
	arr.push_back(-1);
	for (int i = 2;i <= n;++i) {
		map<int, int>freq;
		multiset < pair<int, int>, greater<pair<int, int>>>mp;
		for (int j = 0;j < i;++j) {
			freq[arr[j]]++;
		}
		for (auto x : freq) {
			mp.insert({ x.second,x.first });
		}
		for (int j = 0;j <= n - i;++j) {
			auto x = *mp.begin();
			if (x.first > i / 2) {
				ans++;
			}
			mp.erase({ freq[arr[j]],arr[j] });
			freq[arr[j]]--;
			mp.insert({ freq[arr[j]],arr[j] });
			freq[arr[j + i]]++;
			mp.insert({ freq[arr[j + i]],arr[j + i] });
		}
	}
	cout << ans << '\n';

}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 15 ms 300 KB Output is correct
4 Correct 18 ms 204 KB Output is correct
5 Correct 16 ms 204 KB Output is correct
6 Correct 7 ms 204 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 15 ms 300 KB Output is correct
4 Correct 18 ms 204 KB Output is correct
5 Correct 16 ms 204 KB Output is correct
6 Correct 7 ms 204 KB Output is correct
7 Correct 399 ms 368 KB Output is correct
8 Correct 4 ms 204 KB Output is correct
9 Correct 836 ms 360 KB Output is correct
10 Correct 826 ms 368 KB Output is correct
11 Correct 831 ms 364 KB Output is correct
12 Correct 841 ms 364 KB Output is correct
13 Correct 841 ms 372 KB Output is correct
14 Correct 860 ms 368 KB Output is correct
15 Correct 833 ms 360 KB Output is correct
16 Correct 870 ms 368 KB Output is correct
17 Correct 314 ms 372 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 59 ms 5924 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 15 ms 300 KB Output is correct
4 Correct 18 ms 204 KB Output is correct
5 Correct 16 ms 204 KB Output is correct
6 Correct 7 ms 204 KB Output is correct
7 Correct 399 ms 368 KB Output is correct
8 Correct 4 ms 204 KB Output is correct
9 Correct 836 ms 360 KB Output is correct
10 Correct 826 ms 368 KB Output is correct
11 Correct 831 ms 364 KB Output is correct
12 Correct 841 ms 364 KB Output is correct
13 Correct 841 ms 372 KB Output is correct
14 Correct 860 ms 368 KB Output is correct
15 Correct 833 ms 360 KB Output is correct
16 Correct 870 ms 368 KB Output is correct
17 Correct 314 ms 372 KB Output is correct
18 Incorrect 59 ms 5924 KB Output isn't correct
19 Halted 0 ms 0 KB -