oj.uz

Submission #834383

# Submission time Handle Problem Language Result Execution time Memory
834383 2023-08-22T13:53:02 Z Antekb Street Lamps (APIO19_street_lamps) C++17
100 / 100
 729 ms 195140 KB 
#include<bits/stdc++.h>
#define st first
#define nd second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
#define pp pop_back
#define mp make_pair
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using vi = vector<int>;
using vii = vector<pii>;
void debug(){cerr<<"\n";}
template<typename H, typename... T>
void debug(H h, T... t){
	cerr<<h;
	if(sizeof...(t)){
		cerr<<", ";
	}
	debug(t...);
}
#define deb(x...) cerr<<#x<<" = ";debug(x);

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const int N=1<<19;
vi todo[N];
int pref[N+N], suf[N+N], L[N+N], R[N+N], siz[N+N], M[N], tim[N+N];
int male[N];
int ans[N], typ[N];
vector<pair<pii, pii> > U[N];
vector<pair<int, pii> > Q[N];
void upd(int v){
	int l=v+v, r=v+v+1;
	if(pref[l]==siz[l])pref[v]=pref[r]+siz[l];
	else pref[v]=pref[l];
	if(suf[r]==siz[r])suf[v]=suf[l]+siz[r];
	else suf[v]=suf[r];
}
int tab[N+N];
void add(int v, int c){
	for(v+=N; v>0; v>>=1){
		tab[v]+=c;
	}
}
int sum(int l, int r){
	int res=0;
	for(l+=N, r+=N; l<r; l>>=1, r>>=1){
		if(l&1)res+=tab[l++];
		if(r&1)res+=tab[--r];
	}
	return res;
}
void solve(vector<pair<pii, pii> > &V, int l, int r, vector<pair<int, pii> > q,
	vector<pair<pii, pii> > U){
	if(l+1==r){
		for(auto i:q){
			for(int k=l; k<r; k++){
				auto j=V[k];
				if(j.st.st<=i.st && j.nd.st>=i.nd.st && j.nd.nd>=i.nd.nd){
					ans[i.st]+=j.st.nd;
				}
			}
		}
		return;
	}
	/*deb(l, r);
	for(int j=l; j<r; j++){
		auto i=V[j];
		deb(i.st.st,i.st.nd,i.nd.st,i.nd.nd);
	}
	deb("b");
	for(int j=0; j<U.size(); j++){
		auto i=U[j];
		deb(i.st.st,i.st.nd,i.nd.st,i.nd.nd);
	}*/
	assert(U.size()==r-l);
	if(l==r || !q.size())return;
	int m=(l+r)/2;
	int t=V[m].st.st;
	//deb(m, t);
	vector<pair<int, pii> > QL, QR;
	for(auto &i:q){
		if(i.st<t)QL.pb(i);
		else QR.pb(i);
	}
	vector<pair<pii, pii> > UL, UR;
	for(auto i:U){
		if(i.nd.st<t)UL.pb(i);
		else UR.pb(i);
	}
			int wsk=0;
			for(auto i:QR){
				while(wsk<UL.size() && UL[wsk].st.st>=i.nd.st){
					add(UL[wsk].st.nd, UL[wsk].nd.nd);
					wsk++;
				}
				ans[i.st]+=sum(i.nd.nd, N);
			}
			wsk=0;
			for(auto i:QR){
				while(wsk<UL.size() && UL[wsk].st.st>=i.nd.st){
					add(UL[wsk].st.nd, -UL[wsk].nd.nd);
					wsk++;
				}
			}
	solve(V, l, m, QL, UL);
	solve(V, m, r, QR, UR);

}
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n, q;
	cin>>n>>q;
	string s;
	cin>>s;
	for(int i=0; i<n; i++){
		siz[N+i]=1;
		L[N+i]=i;
		R[N+i]=i+1;
		suf[N+i]=pref[N+i]=(s[i]-'0');
	}
	for(int i=N-1; i; i--){
		siz[i]=siz[i+i]+siz[i+i+1];
		L[i]=L[i+i];
		M[i]=R[i+i];
		if(R[i+i+1]==0)R[i]=R[i+i];
		else R[i]=R[i+i+1];
		upd(i);
	}
	for(int qq=1; qq<=q; qq++){
		cin>>s;
		if(s[0]=='q'){
			//deb(qq);
			typ[qq]=1;
			int a, b;
			cin>>a>>b;
			a--;
			b--;
			if(a==b-1){
				//deb(a, suf[N+a], tim[N+a]);
				ans[qq]=male[a]+suf[N+a]*(qq-tim[N+a]);
				continue;
			}
			//[a, b)
			int v=1;
			while(v<N){
				int m=M[v];
				if(m>=b)v=v+v;
				else if(m<=a)v=v+v+1;
				else{
					int x=m-a, y=b-m;
					//deb(v, L[v], R[v], suf[v+v], pref[v+v+1], qq-tim[v]);deb(x, y);
					if(suf[v+v]>=x && pref[v+v+1]>=y){
						ans[qq]+=qq-tim[v];
					}
					Q[v].eb(qq, mp(x, y));
					break;
				}
			}

		}
		else{
			int v;
			cin>>v;
			v--;
			if(suf[N+v]){
				male[v]+=qq-tim[N+v];
			}
			v+=N;
			tim[v]=qq;
			for(int vv=v/2; vv; vv/=2){
				U[vv].eb(mp(qq, qq-tim[vv]), mp(suf[vv+vv], pref[vv+vv+1]));
			}
			suf[v]^=1;
			pref[v]^=1;
			for(v/=2; v; v/=2){
				//deb(v, L[v], R[v], suf[v+v], pref[v+v+1], qq-tim[v]);
				tim[v]=qq;
				upd(v);
			}
		}
	}
	for(int v=1; v<N; v++){
		if(Q[v].size()){
			vector<pair<pii, pii> > UU=U[v];
			for(auto &i:UU){
				swap(i.st, i.nd);
			}
			sort(all(UU));
			reverse(all(UU));
			sort(all(Q[v]), [](pair<int,pii> a, pair<int, pii> b)
				{return a.nd>b.nd;});
			for(auto i:UU){
				//deb(i.st.st, i.st.nd, i.nd.st,i.nd.nd);
			}
			for(auto i:Q[v]){
				//deb(i.st, i.nd.st,i.nd.nd);
			}
			/*int wsk=0;
			for(auto i:Q[v]){
				while(wsk<UU.size() && UU[wsk].st.st>=i.nd.st){
					add(UU[wsk].st.nd, UU[wsk].nd.nd);
					wsk++;
				}
				ans[i.st]+=sum(i.nd.nd, N);
			}
			wsk=0;
			for(auto i:Q[v]){
				while(wsk<UU.size() && UU[wsk].st.st>=i.nd.st){
					add(UU[wsk].st.nd, -UU[wsk].nd.nd);
					wsk++;
				}
			}*/
			solve(U[v], 0, U[v].size(), Q[v], UU);
		}
		else{
			for(auto i:Q[v]){
				for(auto j:U[v]){
					if(j.st.st<=i.st && j.nd.st>=i.nd.st && j.nd.nd>=i.nd.nd){
						ans[i.st]+=j.st.nd;
					}
				}
			}
		}
	}
	for(int i=1; i<=q; i++){
		if(typ[i])cout<<ans[i]<<"\n";
	}
}

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from street_lamps.cpp:1:
street_lamps.cpp: In function 'void solve(std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >&, int, int, std::vector<std::pair<int, std::pair<int, int> > >, std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >)':
street_lamps.cpp:77:17: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   77 |  assert(U.size()==r-l);
      |         ~~~~~~~~^~~~~
street_lamps.cpp:94:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |     while(wsk<UL.size() && UL[wsk].st.st>=i.nd.st){
      |           ~~~^~~~~~~~~~
street_lamps.cpp:102:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |     while(wsk<UL.size() && UL[wsk].st.st>=i.nd.st){
      |           ~~~^~~~~~~~~~
street_lamps.cpp: In function 'int main()':
street_lamps.cpp:195:13: warning: variable 'i' set but not used [-Wunused-but-set-variable]
  195 |    for(auto i:UU){
      |             ^
street_lamps.cpp:198:13: warning: variable 'i' set but not used [-Wunused-but-set-variable]
  198 |    for(auto i:Q[v]){
      |             ^

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 49748 KB Output is correct
2 Correct 28 ms 49716 KB Output is correct
3 Correct 28 ms 49752 KB Output is correct
4 Correct 28 ms 49708 KB Output is correct
5 Correct 28 ms 49664 KB Output is correct
6 Correct 27 ms 49600 KB Output is correct
7 Correct 27 ms 49548 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 268 ms 100832 KB Output is correct
2 Correct 224 ms 100136 KB Output is correct
3 Correct 158 ms 102180 KB Output is correct
4 Correct 349 ms 123564 KB Output is correct
5 Correct 323 ms 106864 KB Output is correct
6 Correct 352 ms 135832 KB Output is correct
7 Correct 98 ms 58752 KB Output is correct
8 Correct 98 ms 60140 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 50132 KB Output is correct
2 Correct 29 ms 50020 KB Output is correct
3 Correct 31 ms 49912 KB Output is correct
4 Correct 27 ms 49652 KB Output is correct
5 Correct 609 ms 180048 KB Output is correct
6 Correct 729 ms 162816 KB Output is correct
7 Correct 633 ms 126480 KB Output is correct
8 Correct 135 ms 70392 KB Output is correct
9 Correct 109 ms 62816 KB Output is correct
10 Correct 125 ms 63900 KB Output is correct
11 Correct 116 ms 64652 KB Output is correct
12 Correct 127 ms 68040 KB Output is correct
13 Correct 150 ms 70348 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 49812 KB Output is correct
2 Correct 27 ms 50068 KB Output is correct
3 Correct 33 ms 50148 KB Output is correct
4 Correct 29 ms 50176 KB Output is correct
5 Correct 433 ms 100544 KB Output is correct
6 Correct 631 ms 142444 KB Output is correct
7 Correct 674 ms 170964 KB Output is correct
8 Correct 666 ms 195140 KB Output is correct
9 Correct 548 ms 164324 KB Output is correct
10 Correct 723 ms 169960 KB Output is correct
11 Correct 545 ms 164420 KB Output is correct
12 Correct 713 ms 170024 KB Output is correct
13 Correct 556 ms 164780 KB Output is correct
14 Correct 706 ms 170156 KB Output is correct
15 Correct 132 ms 62196 KB Output is correct
16 Correct 134 ms 64428 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 49748 KB Output is correct
2 Correct 28 ms 49716 KB Output is correct
3 Correct 28 ms 49752 KB Output is correct
4 Correct 28 ms 49708 KB Output is correct
5 Correct 28 ms 49664 KB Output is correct
6 Correct 27 ms 49600 KB Output is correct
7 Correct 27 ms 49548 KB Output is correct
8 Correct 268 ms 100832 KB Output is correct
9 Correct 224 ms 100136 KB Output is correct
10 Correct 158 ms 102180 KB Output is correct
11 Correct 349 ms 123564 KB Output is correct
12 Correct 323 ms 106864 KB Output is correct
13 Correct 352 ms 135832 KB Output is correct
14 Correct 98 ms 58752 KB Output is correct
15 Correct 98 ms 60140 KB Output is correct
16 Correct 28 ms 50132 KB Output is correct
17 Correct 29 ms 50020 KB Output is correct
18 Correct 31 ms 49912 KB Output is correct
19 Correct 27 ms 49652 KB Output is correct
20 Correct 609 ms 180048 KB Output is correct
21 Correct 729 ms 162816 KB Output is correct
22 Correct 633 ms 126480 KB Output is correct
23 Correct 135 ms 70392 KB Output is correct
24 Correct 109 ms 62816 KB Output is correct
25 Correct 125 ms 63900 KB Output is correct
26 Correct 116 ms 64652 KB Output is correct
27 Correct 127 ms 68040 KB Output is correct
28 Correct 150 ms 70348 KB Output is correct
29 Correct 29 ms 49812 KB Output is correct
30 Correct 27 ms 50068 KB Output is correct
31 Correct 33 ms 50148 KB Output is correct
32 Correct 29 ms 50176 KB Output is correct
33 Correct 433 ms 100544 KB Output is correct
34 Correct 631 ms 142444 KB Output is correct
35 Correct 674 ms 170964 KB Output is correct
36 Correct 666 ms 195140 KB Output is correct
37 Correct 548 ms 164324 KB Output is correct
38 Correct 723 ms 169960 KB Output is correct
39 Correct 545 ms 164420 KB Output is correct
40 Correct 713 ms 170024 KB Output is correct
41 Correct 556 ms 164780 KB Output is correct
42 Correct 706 ms 170156 KB Output is correct
43 Correct 132 ms 62196 KB Output is correct
44 Correct 134 ms 64428 KB Output is correct
45 Correct 528 ms 94968 KB Output is correct
46 Correct 529 ms 96424 KB Output is correct
47 Correct 425 ms 108072 KB Output is correct
48 Correct 696 ms 143560 KB Output is correct
49 Correct 141 ms 66952 KB Output is correct
50 Correct 135 ms 65764 KB Output is correct
51 Correct 129 ms 67052 KB Output is correct
52 Correct 112 ms 67116 KB Output is correct
53 Correct 109 ms 67056 KB Output is correct
54 Correct 116 ms 67184 KB Output is correct