oj.uz

Submission #697050

# Submission time Handle Problem Language Result Execution time Memory
697050 2023-02-08T03:55:48 Z baojiaopisu Izbori (COCI22_izbori) C++14
110 / 110
 1073 ms 5144 KB 
#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y> 
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 1e6 + 10;

int a[N], cnt[N], cc[N];
bool ok[N];

void BaoJiaoPisu() {
	int n; cin >> n;

	vector<int> val;
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
		val.pb(a[i]);
	}

	sort(all(val)); val.resize(unique(all(val)) - val.begin());

	for(int i = 1; i <= n; i++) {
		a[i] = lower_bound(all(val), a[i]) - val.begin() + 1;
		++cc[a[i]];
	}

	int S = sqrt(n);
	for(int i = 1; i <= n; i++) {
		ok[i] = (cc[i] <= S);
	}

	ll ans = 0;
	for(int i = 1; i <= n; i++) {
		int r = min(n, i + 2 * S - 1), d = 0;
		for(int j = i; j <= r; j++) {
			int x = a[j];
			if(ok[x]) {
				++cnt[x];
				maximize(d, cnt[x]);
			}			

			if(d * 2 > j - i + 1) ++ans;
		}

		for(int j = i; j <= r; j++) {
			int x = a[j];
			if(ok[x]) --cnt[x];
		}
	}

	for(int i = 1; i <= n; i++) {
		if(cc[i] > S) {
			for(int j = 0; j <= 2 * n; j++) cnt[j] = 0;
			int curr = n;
			++cnt[curr];
			int r = 0;
			for(int j = 1; j <= n; j++) {
				if(a[j] == i) {
					r += cnt[curr];
					++curr;
				} else {
					r -= cnt[curr - 1];
					--curr;
				}
				++cnt[curr];
				ans += r;
			}
		}
	}

	cout << ans;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int tc = 1, ddd = 0;
    // cin >> tc;
    while(tc--) {
        //ddd++;
        //cout << "Case #" << ddd << ": ";
        BaoJiaoPisu();
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:142:17: warning: unused variable 'ddd' [-Wunused-variable]
  142 |     int tc = 1, ddd = 0;
      |                 ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 372 KB Output is correct
13 Correct 1 ms 388 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 2924 KB Output is correct
2 Correct 290 ms 3620 KB Output is correct
3 Correct 130 ms 2332 KB Output is correct
4 Correct 308 ms 3844 KB Output is correct
5 Correct 329 ms 3912 KB Output is correct
6 Correct 351 ms 4168 KB Output is correct
7 Correct 350 ms 4168 KB Output is correct
8 Correct 353 ms 4164 KB Output is correct
9 Correct 360 ms 4296 KB Output is correct
10 Correct 358 ms 4164 KB Output is correct
11 Correct 357 ms 4164 KB Output is correct

Subtask #4
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 372 KB Output is correct
13 Correct 1 ms 388 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 195 ms 2924 KB Output is correct
19 Correct 290 ms 3620 KB Output is correct
20 Correct 130 ms 2332 KB Output is correct
21 Correct 308 ms 3844 KB Output is correct
22 Correct 329 ms 3912 KB Output is correct
23 Correct 351 ms 4168 KB Output is correct
24 Correct 350 ms 4168 KB Output is correct
25 Correct 353 ms 4164 KB Output is correct
26 Correct 360 ms 4296 KB Output is correct
27 Correct 358 ms 4164 KB Output is correct
28 Correct 357 ms 4164 KB Output is correct
29 Correct 360 ms 5052 KB Output is correct
30 Correct 100 ms 1224 KB Output is correct
31 Correct 283 ms 2060 KB Output is correct
32 Correct 1073 ms 4156 KB Output is correct
33 Correct 315 ms 2156 KB Output is correct
34 Correct 331 ms 2216 KB Output is correct
35 Correct 180 ms 1616 KB Output is correct
36 Correct 82 ms 1112 KB Output is correct
37 Correct 109 ms 1320 KB Output is correct
38 Correct 365 ms 4160 KB Output is correct
39 Correct 365 ms 4200 KB Output is correct
40 Correct 360 ms 4100 KB Output is correct
41 Correct 358 ms 4168 KB Output is correct
42 Correct 355 ms 4168 KB Output is correct
43 Correct 368 ms 4968 KB Output is correct
44 Correct 376 ms 4988 KB Output is correct
45 Correct 373 ms 5144 KB Output is correct
46 Correct 370 ms 4996 KB Output is correct
47 Correct 376 ms 5048 KB Output is correct
48 Correct 423 ms 4388 KB Output is correct
49 Correct 433 ms 4468 KB Output is correct
50 Correct 385 ms 4344 KB Output is correct
51 Correct 401 ms 4428 KB Output is correct
52 Correct 468 ms 4424 KB Output is correct
53 Correct 485 ms 4512 KB Output is correct
54 Correct 417 ms 4472 KB Output is correct