oj.uz

Submission #711491

# Submission time Handle Problem Language Result Execution time Memory
711491 2023-03-17T05:48:56 Z devvops Izbori (COCI22_izbori) C++17
25 / 110
 2617 ms 5184 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, bruh = 500;

ll a[N], tree[N], n, k;
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++){
   		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 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 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 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 73 ms 412 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 40 ms 340 KB Output is correct
10 Correct 38 ms 340 KB Output is correct
11 Correct 37 ms 340 KB Output is correct
12 Correct 41 ms 344 KB Output is correct
13 Correct 37 ms 340 KB Output is correct
14 Correct 39 ms 340 KB Output is correct
15 Correct 39 ms 340 KB Output is correct
16 Correct 43 ms 340 KB Output is correct
17 Correct 17 ms 1928 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1739 ms 4424 KB Output is correct
2 Correct 2220 ms 5024 KB Output is correct
3 Correct 1275 ms 3528 KB Output is correct
4 Correct 2390 ms 4968 KB Output is correct
5 Correct 2488 ms 5100 KB Output is correct
6 Incorrect 2617 ms 5184 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 73 ms 412 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 40 ms 340 KB Output is correct
10 Correct 38 ms 340 KB Output is correct
11 Correct 37 ms 340 KB Output is correct
12 Correct 41 ms 344 KB Output is correct
13 Correct 37 ms 340 KB Output is correct
14 Correct 39 ms 340 KB Output is correct
15 Correct 39 ms 340 KB Output is correct
16 Correct 43 ms 340 KB Output is correct
17 Correct 17 ms 1928 KB Output is correct
18 Correct 1739 ms 4424 KB Output is correct
19 Correct 2220 ms 5024 KB Output is correct
20 Correct 1275 ms 3528 KB Output is correct
21 Correct 2390 ms 4968 KB Output is correct
22 Correct 2488 ms 5100 KB Output is correct
23 Incorrect 2617 ms 5184 KB Output isn't correct
24 Halted 0 ms 0 KB -