oj.uz

Submission #711484

# Submission time Handle Problem Language Result Execution time Memory
711484 2023-03-17T05:33:17 Z devvops Izbori (COCI22_izbori) C++17
25 / 110
 3000 ms 4684 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
using namespace std;
#define pb push_back
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define all(x) x.begin(), x.end() 
#define speed ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
const int mod = (int) 1e9 + 7;
const int N = (int) 2e5 + 100;
const int bruh = 450;

ll a[N], tree[N], n, k;
unordered_map<int, int> cnt;

void upd(int idx){
	for(int i = idx; i < N; i += i & -i){
		tree[i] += 1;
	}
}

ll get(int x){
	ll ans = 0;
	for (int i = x; i > 0; i -= i & -i) {
         ans += tree[i];
    }
    return ans;
}

signed main(){
   	speed;
   	cin >> n;
   	for(int i = 1; i <= n; i++){
   		cin >> a[i];
   		cnt[a[i]]++;
   	} 
   	ll ans = 0;
   	for(auto i : cnt){
   		if(i.S > bruh){
   			memset(tree, 0, sizeof(tree));
	   		vector<int> v;
	   		for(int j = 1; j <= n; j++){
	   			if(a[j] == i.F) v.pb(1);
	   			else v.pb(-1);
	   		}
	   		int s = 0;
	   		upd(n + 1);
	   		for(int j = 0; j < n; j++){
	   			s += v[j];
	   			if(s < 0){
	   				upd(abs(s));
	   				ans += get(n) - get(abs(s));
	   			}
	   			else{
	   				upd(s + (n + 1));
	   				ans += get(n) - get(0);
	   				ans += get(n + s) - get(n);
	   			}
	   		}
   		}
   	}
   	for(int i = 1; i <= n; i++){
   		unordered_map<int, int> cnt1;
   		int lst = -1, lstA = -1;
   		for(int j = i; j <= n; j++){
   			if((j - i + 1) > 2 * bruh) break;
   			if(a[j] == lstA) lst++;
   			++cnt1[a[j]];
   			int sz = (j - i) + 1;
   			if(lst > (sz / 2) && cnt[lstA] <= bruh) ans++;
   			else if(cnt1[a[j]] > (sz / 2) && cnt[a[j]] <= bruh){
   				ans++;
   				lst = cnt1[a[j]];
   				lstA = a[j];
   			}
   		}
   	}
   	cout << ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 45 ms 340 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 36 ms 344 KB Output is correct
10 Correct 36 ms 356 KB Output is correct
11 Correct 36 ms 356 KB Output is correct
12 Correct 36 ms 340 KB Output is correct
13 Correct 37 ms 356 KB Output is correct
14 Correct 37 ms 352 KB Output is correct
15 Correct 38 ms 340 KB Output is correct
16 Correct 38 ms 340 KB Output is correct
17 Correct 46 ms 1944 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3065 ms 4684 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 45 ms 340 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 36 ms 344 KB Output is correct
10 Correct 36 ms 356 KB Output is correct
11 Correct 36 ms 356 KB Output is correct
12 Correct 36 ms 340 KB Output is correct
13 Correct 37 ms 356 KB Output is correct
14 Correct 37 ms 352 KB Output is correct
15 Correct 38 ms 340 KB Output is correct
16 Correct 38 ms 340 KB Output is correct
17 Correct 46 ms 1944 KB Output is correct
18 Execution timed out 3065 ms 4684 KB Time limit exceeded
19 Halted 0 ms 0 KB -