Submission #1234183

#	Time	Username	Problem	Language	Result	Execution time	Memory
1234183		thdh__	Izbori (COCI22_izbori)	C++20	0 / 110	275 ms	3516 KiB

Main

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define eb emplace_back
#define pu push
#define ins insert
#define fi first
#define se second
#define all(a) a.begin(),a.end()
#define bruh ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define fu(x,a,b) for (auto x=a;x<=b;x++)
#define fd(x,a,b) for (auto x=a;x>=b;x--)
#define int ll

using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());

/*
Competitive Programming notes that I need to study & fix my dumbass self:

1. Coding:
- Always be sure to check the memory of arrays (maybe use vectors), for loops
- Always try to maximize the memory if possible, even if you are going for subtasks
- Do not exploit #define int long long, it will kill you

2. Stress: 
- Always try generating big testcases and try if they run

3. Time management:
- Don't overcommit or undercommit, always spend a certain amount of time to think a problem, don't just look at it and say I'm fucked
- Do not spend too much time coding brute-force solutions, they should be easily-codable solutions that don't take up too much time

Time management schedule:
Offline / LAH days (4 problems - 3h):
15' thinking of solution / idea
1. no idea: skip
2. yes idea: continue thinking for <= 15'

+ implementing: <= 20'
+ brute-force: <= 5'
+ test generator: <= 5'

I hate offline because I am dumb
*/

typedef pair<int, int> ii;
const int N = 2e5+5;
const int mod = 1e9+7;
const int inf = 1e18;
using cd = complex<double>;
const long double PI = acos(-1);
int power(int a,int b) {ll x = 1;if (a >= mod) a%=mod; while (b) {if (b & 1) x = x*a % mod;a = a*a % mod;b>>=1;}return x;} 

int n, a[N], cnt[N], block;
map<int, int> id;
int tot[N];
int bit[N];

void update(int i, int val) 
{
	for (; i < N; i += i & -i) bit[i] += val;
}

int get(int i) 
{
	int ret = 0;
	for (; i; i -= i & -i) ret += bit[i];
	return ret;
}

void solve()
{
	cin>>n;
	block = sqrt(n);
	vector<int> v;
	for (int i = 1; i <= n; i++) cin>>a[i], v.pb(a[i]);
	sort(all(v)); v.erase(unique(all(v)), v.end());
	for (int i = 0; i < v.size(); i++) id[v[i]] = i+1;
	for (int i = 1; i <= n; i++) 
	{
		a[i] = id[a[i]];
		cnt[a[i]]++;
	}
	int ans = 0;
	for (int i = 1; i <= n; i++) 
	{
		int mx = 0, col = 0;
		for (int j = i; j <= min(n, i + 2 * block - 1); j++) 
		{
			tot[a[j]]++;
			if (tot[a[j]] > mx) mx = tot[a[j]], col = a[j];
			if (2 * mx > (j-i+1) && cnt[col] <= block) ans++;
		}
		for (int j = i; j <= min(n, i + 2 * block - 1); j++) tot[a[j]]--;
	}
	// cout<<ans<<endl;
	for (int c = 1; c <= n; c++) 
	{
		if (cnt[c] > block) 
		{
			int pref = 0;
			update(n+1, 1);
			for (int i = 1; i <= n; i++) 
			{
				pref += (a[i] == c ? 1 : -1);
				ans += get(pref+n);
				update(pref+n+1, 1);
			}
		}
	}
	cout<<ans;
}

/*
Go through the mistakes you usually make and revise your code, for god's sake...
*/

signed main()
{
	bruh
	//freopen("input.inp","r",stdin);
	//freopen("output.inp","w",stdout);
	int t = 1;
	// cin>>t;
	while (t--)
	{
		solve();
		cout<<"\n";
	}
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 70