oj.uz

Submission #893537

# Submission time Handle Problem Language Result Execution time Memory
893537 2023-12-27T06:35:55 Z vjudge1 Izbori (COCI22_izbori) C++17
40 / 110
 3000 ms 18000 KB 
#include <bits/stdc++.h>
#define pb push_back
#define pf push_front
using namespace std;
#define F first
#define S second
typedef long long ll;
#define pii pair <int, int>
#define pll pair <ll, ll>
typedef long double ld;
const ll N = 2 * 1e5 + 10;
const ll mod = 1e9 + 7;

ll um(ll a, ll b){
	return ((1LL * a * b) % mod + mod) % mod;
}
ll subr(ll a, ll b){
	return ((1LL * a - b) % mod + mod) % mod;
}
ll binpow(ll x, ll step){
	ll res = 1LL;
	while(step){
		if(step & 1) res = um(res, x);
		x = um(x, x);
		step /= 2;
	}
	return res;
}
struct segtree {
	ll sz;
	vector <ll> tree;
	void init(ll n){
		sz = 1;
		while(sz < n) sz *= 2;
		tree.assign(2 * sz - 1, 0LL);
	}
	void upd(ll i, ll v, ll x, ll lx, ll rx){
		if(rx - lx == 1){
			tree[x] += v;
			return;
		}
		ll mid = (rx + lx) / 2;
		if(i < mid) upd(i, v, 2 * x + 1, lx, mid);
		else upd(i, v, 2 * x + 2, mid, rx);
		tree[x] = max(tree[2 * x + 1], tree[2 * x + 2]);
	}
	void upd(ll i, ll v){
		upd(i, v, 0, 0, sz);
	}
};
ll arr[N], b[N];
ll ans, n, sz;
void overall(){
	segtree obj;
  	obj.init(sz);
  	for(ll i = 0; i < n; i++){
  		for(ll j = i; j < n; j++){
  			obj.upd(arr[j], 1);
  			if(obj.tree[0] > (j - i + 1) / 2) ans++;
  		}
  		for(ll j = i; j < n; j++){
  			obj.upd(arr[j], -1);
  		}
  	}
}
void subtask3(){
	map <ll, ll> mp;
	ll cur = 0, act = 0;
	ans = (1LL * (n * (n + 1))) / 2LL;
	for(ll i = 0; i < n; i++){
		if(arr[i] == 0) cur--;
		else cur++;
		mp[cur]++;
	}
	cur = 0;
	for(ll i = 0; i < n; i++){
		ans -= mp[act];
		if(arr[i] == 0){
			cur--;
			act--;
		}
		else{
			cur++;
			act++;
		}
		mp[cur]--;
	}
}
int main() {
	ios::sync_with_stdio(false);
  	cin.tie(NULL);
  	cin >> n;
  	for(ll i = 0; i < n; i++){
  		cin >> arr[i];
  		b[i] = arr[i];
  	}
  	sort(b, b + n);
  	sz = unique(b, b + n) - b;
  	for(ll i = 0; i < n; i++){
  		arr[i] = lower_bound(b, b + sz, arr[i]) - b;
  	}
  	if(sz <= 2){
  		subtask3();
  	} else overall();
  	cout << ans;
  return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 21 ms 2552 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 33 ms 2396 KB Output is correct
10 Correct 33 ms 2396 KB Output is correct
11 Correct 32 ms 2396 KB Output is correct
12 Correct 32 ms 2536 KB Output is correct
13 Correct 32 ms 2396 KB Output is correct
14 Correct 32 ms 2396 KB Output is correct
15 Correct 32 ms 2396 KB Output is correct
16 Correct 33 ms 2396 KB Output is correct
17 Correct 1 ms 2648 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 3124 KB Output is correct
2 Correct 20 ms 3420 KB Output is correct
3 Correct 11 ms 2652 KB Output is correct
4 Correct 20 ms 3672 KB Output is correct
5 Correct 20 ms 3416 KB Output is correct
6 Correct 23 ms 3420 KB Output is correct
7 Correct 23 ms 3420 KB Output is correct
8 Correct 22 ms 3652 KB Output is correct
9 Correct 22 ms 3416 KB Output is correct
10 Correct 21 ms 3420 KB Output is correct
11 Correct 76 ms 15956 KB Output is correct

Subtask #4
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 21 ms 2552 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 33 ms 2396 KB Output is correct
10 Correct 33 ms 2396 KB Output is correct
11 Correct 32 ms 2396 KB Output is correct
12 Correct 32 ms 2536 KB Output is correct
13 Correct 32 ms 2396 KB Output is correct
14 Correct 32 ms 2396 KB Output is correct
15 Correct 32 ms 2396 KB Output is correct
16 Correct 33 ms 2396 KB Output is correct
17 Correct 1 ms 2648 KB Output is correct
18 Correct 18 ms 3124 KB Output is correct
19 Correct 20 ms 3420 KB Output is correct
20 Correct 11 ms 2652 KB Output is correct
21 Correct 20 ms 3672 KB Output is correct
22 Correct 20 ms 3416 KB Output is correct
23 Correct 23 ms 3420 KB Output is correct
24 Correct 23 ms 3420 KB Output is correct
25 Correct 22 ms 3652 KB Output is correct
26 Correct 22 ms 3416 KB Output is correct
27 Correct 21 ms 3420 KB Output is correct
28 Correct 76 ms 15956 KB Output is correct
29 Correct 82 ms 18000 KB Output is correct
30 Execution timed out 3045 ms 3928 KB Time limit exceeded
31 Halted 0 ms 0 KB -