oj.uz

Submission #574513

# Submission time Handle Problem Language Result Execution time Memory
574513 2022-06-08T16:43:54 Z FatihSolak Election (BOI18_election) C++17
100 / 100
 766 ms 56412 KB 
#include <bits/stdc++.h>
#define N 500005
using namespace std;
vector<pair<int,int>> query[N];
int ans[N];
int suf[N];
struct SegTree{
	vector<int> t,lazy;
	int n;
	SegTree(int size){
		n = size;
		t.assign(4*n,1e9);
		lazy.assign(4*n,0);
	}
	void push(int v){
		t[v*2] += lazy[v];
		lazy[v*2] += lazy[v];
		t[v*2+1] += lazy[v];
		lazy[v*2+1] += lazy[v];
		lazy[v] = 0;
	}
	void upd(int v,int tl,int tr,int l,int r,int val){
		if(tr < l || r < tl)
			return;
		if(l <= tl && tr <= r){
			t[v] += val;
			lazy[v] += val;
			return;
		}
		push(v);
		int tm = (tl + tr)/2;
		upd(v*2,tl,tm,l,r,val);
		upd(v*2+1,tm+1,tr,l,r,val);
		t[v] = min(t[v*2],t[v*2+1]);
	}
	int get(int v,int tl,int tr,int l,int r){
		if(tr < l || r < tl)
			return 1e9;
		if(l <= tl && tr <= r)
			return t[v];
		push(v);
		int tm = (tl + tr)/2;
		return min(get(v*2,tl,tm,l,r),get(v*2+1,tm+1,tr,l,r));
	}
	void upd(int l,int r,int val){
		upd(1,1,n,l,r,val);
	}
	int get(int l,int r){
		return get(1,1,n,l,r);
	}
};
struct BIT{
	vector<int> bit;
	int n;
	BIT(int size){
		n = size + 5;
		bit.assign(n,0);
	}
	void upd(int pos,int val){
		for(;pos < n;pos += pos & -pos)
			bit[pos] += val;
	}
	int get(int pos){
		int ret = 0;
		for(;pos > 0;pos -= pos & -pos)
			ret += bit[pos];
		return ret;
	}
	int get(int l,int r){
		return get(r) - get(l-1);
	}
};
void solve(){
	int n,q;
	string s;
	cin >> n >> s >> q;
	s = "." + s;
	for(int i = n;i>=1;i--){
		suf[i] = suf[i+1] + (s[i] =='C'?1:-1);
		//cout << i << " " << suf[i] << endl;	
	}
	for(int i = 1;i<=q;i++){
		int l,r;
		cin >> l >> r;
		query[l].push_back({r,i});
	}
	SegTree t(n);
	BIT bt(n);
	vector<int> nodes;
	for(int i = n;i>=1;i--){
		if(s[i] == 'C'){
			if(nodes.size()){
				bt.upd(nodes.back(),-1);
				t.upd(i+1,nodes.back(),-1);
				nodes.pop_back();
			}
		}
		if(s[i] == 'T'){
			bt.upd(i,1);
			nodes.push_back(i);
		}
		t.upd(i,i,(int) - 1e9 + suf[i] + nodes.size());
		for(auto u:query[i]){
			int tot = bt.get(i,u.first);
			tot += max(0,-(t.get(i,u.first) - suf[u.first+1] - bt.get(u.first+1,n)));
			ans[u.second] = tot;
		}	
		/*
		cout << "i: " << i << endl;	
		for(int j = i;j<=n;j++){
			cout << t.get(j,j) << " ";
		}
		cout << endl;*/
	}
	for(int i = 1;i<=q;i++){
		cout << ans[i] << "\n";
	}
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	#ifdef Local
		freopen("in.txt","r",stdin);
		freopen("out.txt","w",stdout);
	#endif
	int t = 1;
	//cin >> t;
	while(t--){
		solve();
	}
	#ifdef Local
		cout << endl << fixed << setprecision(2) << 1000.0 * clock() / CLOCKS_PER_SEC << " milliseconds.";
	#endif
}

Subtask #1
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12244 KB Output is correct
2 Correct 9 ms 12232 KB Output is correct
3 Correct 8 ms 12212 KB Output is correct
4 Correct 8 ms 12244 KB Output is correct
5 Correct 8 ms 12216 KB Output is correct

Subtask #2
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12244 KB Output is correct
2 Correct 9 ms 12232 KB Output is correct
3 Correct 8 ms 12212 KB Output is correct
4 Correct 8 ms 12244 KB Output is correct
5 Correct 8 ms 12216 KB Output is correct
6 Correct 81 ms 17728 KB Output is correct
7 Correct 89 ms 17332 KB Output is correct
8 Correct 84 ms 17348 KB Output is correct
9 Correct 77 ms 17668 KB Output is correct
10 Correct 87 ms 17716 KB Output is correct
11 Correct 78 ms 17980 KB Output is correct
12 Correct 89 ms 17908 KB Output is correct
13 Correct 94 ms 18096 KB Output is correct
14 Correct 83 ms 17920 KB Output is correct
15 Correct 83 ms 17768 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12244 KB Output is correct
2 Correct 9 ms 12232 KB Output is correct
3 Correct 8 ms 12212 KB Output is correct
4 Correct 8 ms 12244 KB Output is correct
5 Correct 8 ms 12216 KB Output is correct
6 Correct 81 ms 17728 KB Output is correct
7 Correct 89 ms 17332 KB Output is correct
8 Correct 84 ms 17348 KB Output is correct
9 Correct 77 ms 17668 KB Output is correct
10 Correct 87 ms 17716 KB Output is correct
11 Correct 78 ms 17980 KB Output is correct
12 Correct 89 ms 17908 KB Output is correct
13 Correct 94 ms 18096 KB Output is correct
14 Correct 83 ms 17920 KB Output is correct
15 Correct 83 ms 17768 KB Output is correct
16 Correct 766 ms 54316 KB Output is correct
17 Correct 572 ms 50352 KB Output is correct
18 Correct 669 ms 51380 KB Output is correct
19 Correct 629 ms 53020 KB Output is correct
20 Correct 717 ms 53332 KB Output is correct
21 Correct 731 ms 56148 KB Output is correct
22 Correct 765 ms 55320 KB Output is correct
23 Correct 765 ms 56412 KB Output is correct
24 Correct 738 ms 55780 KB Output is correct
25 Correct 722 ms 54564 KB Output is correct