답안 #1018751

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1018751	2024-07-10T09:19:51 Z	vjudge1	Izbori (COCI22_izbori)	C++17	25 / 110	3000 ms	3844 KB

Main

#include <bits/stdc++.h>
#define fast cin.tie(0)->sync_with_stdio(0);
#define int long long
#define inf ((int)1e18)
using namespace std;

int32_t main(){
	fast
	int n;
	cin >> n;
	vector <int> arr(n);
	for(int i = 0; i < n; i++) {
		cin >> arr[i];
	}
	auto compress = [&](vector <int> &a) {
		vector <pair<int, int> > v(a.size());
		for(int i = 0; i < n; i++) {
			v[i] = {a[i], i};
		}
		sort(v.begin(), v.end());
		for(int i = 0, prev = 0; i < n; i++) {
			if(i and v[i].first != v[i - 1].first) prev = i;
			a[v[i].second] = prev;
		}
	};
	compress(arr);
	int ans = 0;
	for(int l = 0; l < n; l++) {
		vector <int> cnt(n);
		int mx = 0;
		for(int r = l; r < n; r++) {
			cnt[arr[r]]++;
			mx = max(mx, cnt[arr[r]]);
			if(mx > (r - l + 1) / 2) ans++;
		}
	}
	cout << ans << "\n";
}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct

Subtask #2

15.0 / 15.0

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

Subtask #3

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	3030 ms	3844 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	4 ms	348 KB	Output is correct
10	Correct	5 ms	348 KB	Output is correct
11	Correct	4 ms	348 KB	Output is correct
12	Correct	3 ms	496 KB	Output is correct
13	Correct	4 ms	348 KB	Output is correct
14	Correct	3 ms	348 KB	Output is correct
15	Correct	5 ms	348 KB	Output is correct
16	Correct	4 ms	348 KB	Output is correct
17	Correct	3 ms	348 KB	Output is correct
18	Execution timed out	3030 ms	3844 KB	Time limit exceeded
19	Halted	0 ms	0 KB	-