Submission #697050

#	Time	Username	Problem	Language	Result	Execution time	Memory
697050		baojiaopisu	Izbori (COCI22_izbori)	C++14	110 / 110	1073 ms	5144 KiB

Main

#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 (stderr)

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 / 10
• Subtask 2: 15 / 15
• Subtask 3: 15 / 15
• Subtask 4: 70 / 70