oj.uz

Submission #834387

# Submission time Handle Problem Language Result Execution time Memory
834387 2023-08-22T13:54:31 Z Antekb Street Lamps (APIO19_street_lamps) C++17
100 / 100
 787 ms 195004 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+20>=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() && U[v].size()>=20){
			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 25 ms 49748 KB Output is correct
2 Correct 27 ms 49720 KB Output is correct
3 Correct 26 ms 49748 KB Output is correct
4 Correct 32 ms 49712 KB Output is correct
5 Correct 28 ms 49712 KB Output is correct
6 Correct 32 ms 49584 KB Output is correct
7 Correct 25 ms 49516 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 257 ms 100900 KB Output is correct
2 Correct 205 ms 100016 KB Output is correct
3 Correct 185 ms 102200 KB Output is correct
4 Correct 346 ms 123600 KB Output is correct
5 Correct 308 ms 106828 KB Output is correct
6 Correct 415 ms 135796 KB Output is correct
7 Correct 99 ms 58828 KB Output is correct
8 Correct 110 ms 60232 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 50116 KB Output is correct
2 Correct 26 ms 50124 KB Output is correct
3 Correct 27 ms 49984 KB Output is correct
4 Correct 26 ms 49660 KB Output is correct
5 Correct 649 ms 180000 KB Output is correct
6 Correct 649 ms 162836 KB Output is correct
7 Correct 518 ms 121064 KB Output is correct
8 Correct 108 ms 64080 KB Output is correct
9 Correct 97 ms 59388 KB Output is correct
10 Correct 105 ms 60080 KB Output is correct
11 Correct 104 ms 59376 KB Output is correct
12 Correct 101 ms 61508 KB Output is correct
13 Correct 107 ms 64032 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 49748 KB Output is correct
2 Correct 27 ms 50004 KB Output is correct
3 Correct 28 ms 50140 KB Output is correct
4 Correct 30 ms 50036 KB Output is correct
5 Correct 323 ms 87232 KB Output is correct
6 Correct 585 ms 132992 KB Output is correct
7 Correct 646 ms 165460 KB Output is correct
8 Correct 714 ms 195004 KB Output is correct
9 Correct 569 ms 160824 KB Output is correct
10 Correct 787 ms 170108 KB Output is correct
11 Correct 536 ms 160868 KB Output is correct
12 Correct 716 ms 169940 KB Output is correct
13 Correct 541 ms 160652 KB Output is correct
14 Correct 695 ms 170000 KB Output is correct
15 Correct 101 ms 61648 KB Output is correct
16 Correct 107 ms 64076 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 49748 KB Output is correct
2 Correct 27 ms 49720 KB Output is correct
3 Correct 26 ms 49748 KB Output is correct
4 Correct 32 ms 49712 KB Output is correct
5 Correct 28 ms 49712 KB Output is correct
6 Correct 32 ms 49584 KB Output is correct
7 Correct 25 ms 49516 KB Output is correct
8 Correct 257 ms 100900 KB Output is correct
9 Correct 205 ms 100016 KB Output is correct
10 Correct 185 ms 102200 KB Output is correct
11 Correct 346 ms 123600 KB Output is correct
12 Correct 308 ms 106828 KB Output is correct
13 Correct 415 ms 135796 KB Output is correct
14 Correct 99 ms 58828 KB Output is correct
15 Correct 110 ms 60232 KB Output is correct
16 Correct 27 ms 50116 KB Output is correct
17 Correct 26 ms 50124 KB Output is correct
18 Correct 27 ms 49984 KB Output is correct
19 Correct 26 ms 49660 KB Output is correct
20 Correct 649 ms 180000 KB Output is correct
21 Correct 649 ms 162836 KB Output is correct
22 Correct 518 ms 121064 KB Output is correct
23 Correct 108 ms 64080 KB Output is correct
24 Correct 97 ms 59388 KB Output is correct
25 Correct 105 ms 60080 KB Output is correct
26 Correct 104 ms 59376 KB Output is correct
27 Correct 101 ms 61508 KB Output is correct
28 Correct 107 ms 64032 KB Output is correct
29 Correct 26 ms 49748 KB Output is correct
30 Correct 27 ms 50004 KB Output is correct
31 Correct 28 ms 50140 KB Output is correct
32 Correct 30 ms 50036 KB Output is correct
33 Correct 323 ms 87232 KB Output is correct
34 Correct 585 ms 132992 KB Output is correct
35 Correct 646 ms 165460 KB Output is correct
36 Correct 714 ms 195004 KB Output is correct
37 Correct 569 ms 160824 KB Output is correct
38 Correct 787 ms 170108 KB Output is correct
39 Correct 536 ms 160868 KB Output is correct
40 Correct 716 ms 169940 KB Output is correct
41 Correct 541 ms 160652 KB Output is correct
42 Correct 695 ms 170000 KB Output is correct
43 Correct 101 ms 61648 KB Output is correct
44 Correct 107 ms 64076 KB Output is correct
45 Correct 457 ms 93044 KB Output is correct
46 Correct 460 ms 94224 KB Output is correct
47 Correct 344 ms 104776 KB Output is correct
48 Correct 584 ms 138352 KB Output is correct
49 Correct 110 ms 62740 KB Output is correct
50 Correct 113 ms 61108 KB Output is correct
51 Correct 104 ms 61996 KB Output is correct
52 Correct 97 ms 57012 KB Output is correct
53 Correct 90 ms 56952 KB Output is correct
54 Correct 109 ms 56960 KB Output is correct