oj.uz

Submission #696666

# Submission time Handle Problem Language Result Execution time Memory
696666 2023-02-07T03:24:04 Z SanguineChameleon Izbori (COCI22_izbori) C++17
110 / 110
 160 ms 11576 KB 
// BEGIN BOILERPLATE CODE
 
#include <bits/stdc++.h>
using namespace std;
 
#ifdef KAMIRULEZ
	const bool kami_loc = true;
	const long long kami_seed = 69420;
#else
	const bool kami_loc = false;
	const long long kami_seed = chrono::steady_clock::now().time_since_epoch().count();
#endif
 
const string kami_fi = "kamirulez.inp";
const string kami_fo = "kamirulez.out";
mt19937_64 kami_gen(kami_seed);
 
long long rand_range(long long rmin, long long rmax) {
	uniform_int_distribution<long long> rdist(rmin, rmax);
	return rdist(kami_gen);
}
 
long double rand_real(long double rmin, long double rmax) {
	uniform_real_distribution<long double> rdist(rmin, rmax);
	return rdist(kami_gen);
}
 
void file_io(string fi, string fo) {
	if (fi != "" && (!kami_loc || fi == kami_fi)) {
		freopen(fi.c_str(), "r", stdin);
	}
	if (fo != "" && (!kami_loc || fo == kami_fo)) {
		freopen(fo.c_str(), "w", stdout);
	}
}
 
void set_up() {
	if (kami_loc) {
		file_io(kami_fi, kami_fo);
	}
	ios_base::sync_with_stdio(0);
	cin.tie(0);
}
 
void just_do_it();
 
void just_exec_it() {
	if (kami_loc) {
		auto pstart = chrono::steady_clock::now();
		just_do_it();
		auto pend = chrono::steady_clock::now();
		long long ptime = chrono::duration_cast<chrono::milliseconds>(pend - pstart).count();
		string bar(50, '=');
		cout << '\n' << bar << '\n';
		cout << "Time: " << ptime << " ms" << '\n';
	}
	else {
		just_do_it();
	}
}
 
int main() {
	set_up();
	just_exec_it();
	return 0;
}
 
// END BOILERPLATE CODE
 
// BEGIN MAIN CODE
 
const int ms = 2e5 + 20;
const int block = 450;
int a[ms];
pair<int, int> p[ms];
vector<int> pos[ms];
int b[ms];
int cnt[ms * 2];
int n;
long long res;
 
void solve1(int C) {
	for (int i = 1; i <= n; i++) {
		b[i] = -1;
	}
	for (auto x: pos[C]) {
		b[x] = 1;
	}
	for (int i = -n; i <= n; i++) {
		cnt[i + ms] = 0;
	}
	long long tot = 0;
	int S = 0;
	cnt[ms] = 1;
	for (int i = 1; i <= n; i++) {
		if (b[i] == 1) {
			tot += cnt[S + ms];
			S++;
		}
		else {
			S--;
			tot -= cnt[S + ms];
		}
		cnt[S + ms]++;
		res += tot;
	}
}
 
void solve2(int C) {
	pos[C].push_back(n + 1);
	int sz = (int)pos[C].size() - 2;
	for (int i = 1; i <= sz; i++) {
		for (int j = i; j <= sz; j++) {
			int k = j - i + 1;
			int rem = (k - 1) - (pos[C][j] - pos[C][i] + 1 - k);
			if (rem < 0) {
				continue;
			}
			int lt = pos[C][i] - pos[C][i - 1] - 1;
			int rt = pos[C][j + 1] - pos[C][j] - 1;
			if (lt + rt <= rem) {
				res += 1LL * (lt + 1) * (rt + 1);
			}
			else if (rem <= rt) {
				int X = max(0, rem - lt + 1);
				int Y = rem + 1;
				res += 1LL * (X + Y) * (Y - X + 1) / 2;
			}
			else {
				int X = max(0, rem - lt + 1);
				int Y = rt + 1;
				res += 1LL * (X + Y) * (Y - X + 1) / 2;
				res += 1LL * (rt + 1) * (rem - rt);
			}
		}
	}
}
 
void just_do_it() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		p[i] = {a[i], i};
	}
	sort(p + 1, p + n + 1);
	int m = 0;
	for (int i = 1; i <= n; i++) {
		if (p[i].first != p[i - 1].first) {
			m++;
			pos[m].push_back(0);
		}
		a[p[i].second] = m;
	}
	for (int i = 1; i <= n; i++) {
		pos[a[i]].push_back(i);
	}
	for (int i = 1; i <= m; i++) {
		if ((int)pos[i].size() > block) {
			solve1(i);
		}
		else {
			solve2(i);
		}
	}
	cout << res;
}
 
// END MAIN CODE

Compilation message

Main.cpp: In function 'void file_io(std::string, std::string)':
Main.cpp:30:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |   freopen(fi.c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:33:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |   freopen(fo.c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 5040 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 5040 KB Output is correct
7 Correct 4 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 4 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 8932 KB Output is correct
2 Correct 28 ms 9996 KB Output is correct
3 Correct 18 ms 7832 KB Output is correct
4 Correct 38 ms 10068 KB Output is correct
5 Correct 33 ms 10532 KB Output is correct
6 Correct 32 ms 10688 KB Output is correct
7 Correct 30 ms 10696 KB Output is correct
8 Correct 33 ms 10696 KB Output is correct
9 Correct 31 ms 10688 KB Output is correct
10 Correct 34 ms 10668 KB Output is correct
11 Correct 20 ms 10576 KB Output is correct

Subtask #4
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 5040 KB Output is correct
7 Correct 4 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 4 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 23 ms 8932 KB Output is correct
19 Correct 28 ms 9996 KB Output is correct
20 Correct 18 ms 7832 KB Output is correct
21 Correct 38 ms 10068 KB Output is correct
22 Correct 33 ms 10532 KB Output is correct
23 Correct 32 ms 10688 KB Output is correct
24 Correct 30 ms 10696 KB Output is correct
25 Correct 33 ms 10696 KB Output is correct
26 Correct 31 ms 10688 KB Output is correct
27 Correct 34 ms 10668 KB Output is correct
28 Correct 20 ms 10576 KB Output is correct
29 Correct 36 ms 10576 KB Output is correct
30 Correct 12 ms 6484 KB Output is correct
31 Correct 25 ms 7924 KB Output is correct
32 Correct 84 ms 11576 KB Output is correct
33 Correct 25 ms 8140 KB Output is correct
34 Correct 28 ms 8172 KB Output is correct
35 Correct 17 ms 7200 KB Output is correct
36 Correct 11 ms 6356 KB Output is correct
37 Correct 13 ms 6632 KB Output is correct
38 Correct 37 ms 10668 KB Output is correct
39 Correct 38 ms 10552 KB Output is correct
40 Correct 37 ms 10648 KB Output is correct
41 Correct 37 ms 10540 KB Output is correct
42 Correct 37 ms 10868 KB Output is correct
43 Correct 48 ms 10988 KB Output is correct
44 Correct 49 ms 10864 KB Output is correct
45 Correct 47 ms 10928 KB Output is correct
46 Correct 48 ms 10888 KB Output is correct
47 Correct 48 ms 10936 KB Output is correct
48 Correct 107 ms 10752 KB Output is correct
49 Correct 107 ms 10776 KB Output is correct
50 Correct 64 ms 11160 KB Output is correct
51 Correct 65 ms 11152 KB Output is correct
52 Correct 160 ms 10572 KB Output is correct
53 Correct 147 ms 10532 KB Output is correct
54 Correct 105 ms 10632 KB Output is correct