oj.uz

Submission #367809

# Submission time Handle Problem Language Result Execution time Memory
367809 2021-02-18T12:34:56 Z YJU Street Lamps (APIO19_street_lamps) C++14
100 / 100
 2997 ms 49716 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector,Ofast")
using namespace std;
typedef int ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=3e5+5;
const ld pi=acos(-1);
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()
 
char c;
ll n,q,x,y,state[N],ans[N],ty[N];
string s;
vector<pair<pll,pll> > ioi;
set<ll> location;
 
ll find_R(ll idx){
	return *location.lwb(idx)-1;
}
 
ll find_L(ll idx){
	return *prev(location.lwb(idx+1))+1;
}
 
void upd(ll idx){
	state[idx]^=1;
	if(state[idx]==0){
		location.insert(idx);
	}else{
		location.erase(idx);
	}
}

ll bit[N];

void add(ll idx,ll d){
	if(!d)return ;
	for(int i=idx;i<N;i+=(i&-i)){
		bit[i]+=d;
	}
}

ll query(ll idx){
	ll tmp=0;
	for(int i=idx;i>0;i-=(i&-i)){
		tmp+=bit[i];
	}
	return tmp;
}

void CDQ(ll l,ll r){
	if(l==r-1)return ;
	ll mid=(l+r)>>1;
	CDQ(l,mid);CDQ(mid,r);
	ll iter=l;
	for(int i=mid;i<r;i++){
		while(iter<mid&&ioi[iter].X.Y<=ioi[i].X.Y)add(ioi[iter].Y.X,ioi[iter].X.X*ioi[iter].Y.Y),iter++;
		if(ioi[i].Y.Y==0){
			ans[ioi[i].X.X]+=query(ioi[i].Y.X);
		}
	}
	while(iter>l)iter--,add(ioi[iter].Y.X,-ioi[iter].X.X*ioi[iter].Y.Y);
	
	sort(ioi.begin()+l,ioi.begin()+r,[](pair<pll,pll> A,pair<pll,pll> B){
		return (A.X.Y<B.X.Y);
	});
}
 
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n>>q;
	REP(i,n+2)location.insert(i);
	REP1(i,n){
		cin>>c;
		if(c=='1')upd(i);
	}
	REP1(i,q){
		cin>>s;
		if(s[0]=='q'){
			ty[i]=2;
			cin>>x>>y;
			--y;
			///cout<<"query "<<i<<" "<<x<<" "<<y<<" "<<find_R(1,1,n+1,x)<<"\n";
			if(find_R(x)>=y){ans[i]+=i;}
			ioi.pb(mp(mp(i,x),mp(y,0)));
		}else{
			ty[i]=1;
			cin>>x;
			ll L=find_L(x-1),R=find_R(x+1);
			//cout<<x<<" "<<L<<" "<<R<<"\n";
			if(state[x]==0){
				//[L,x] [x,R]-=i;
				ioi.pb(mp(mp(i,L),mp(x,-1)));
				ioi.pb(mp(mp(i,L),mp(R+1,1)));
				ioi.pb(mp(mp(i,x+1),mp(x,1)));
				ioi.pb(mp(mp(i,x+1),mp(R+1,-1)));
			}else{
				//[L,x] [x,R] +=i ;
				ioi.pb(mp(mp(i,L),mp(x,1)));
				ioi.pb(mp(mp(i,L),mp(R+1,-1)));
				ioi.pb(mp(mp(i,x+1),mp(x,-1)));
				ioi.pb(mp(mp(i,x+1),mp(R+1,1)));
			}
			upd(x);
		}
	}
	sort(ioi.begin(),ioi.end());
	CDQ(0,SZ(ioi));
	/*
	REP(i,SZ(ioi)){
		if(ioi[i].Y.Y==0){
			REP(j,i){
				if(ioi[j].Y.Y!=0&&ioi[j].X.Y<=ioi[i].X.Y&&ioi[j].Y.X<=ioi[i].Y.X){
					ans[ioi[i].X.X]+=(ioi[j].X.X*ioi[j].Y.Y);
				}
			}
		}
	}
	*/
	REP1(i,q){
		if(ty[i]==2)cout<<ans[i]<<"\n";
	}
	return 0;
}

Compilation message

street_lamps.cpp:11:18: warning: overflow in conversion from 'long long int' to 'll' {aka 'int'} changes value from '1152921504606846976' to '0' [-Woverflow]
   11 | const ll INF=(1LL<<60);
      |              ~~~~^~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1276 ms 18512 KB Output is correct
2 Correct 1369 ms 18508 KB Output is correct
3 Correct 1610 ms 18764 KB Output is correct
4 Correct 1990 ms 33864 KB Output is correct
5 Correct 1710 ms 33992 KB Output is correct
6 Correct 2145 ms 32712 KB Output is correct
7 Correct 897 ms 24020 KB Output is correct
8 Correct 684 ms 24684 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 620 KB Output is correct
2 Correct 4 ms 620 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2914 ms 49648 KB Output is correct
6 Correct 2381 ms 34084 KB Output is correct
7 Correct 1688 ms 33252 KB Output is correct
8 Correct 689 ms 24684 KB Output is correct
9 Correct 240 ms 7132 KB Output is correct
10 Correct 273 ms 10720 KB Output is correct
11 Correct 270 ms 10712 KB Output is correct
12 Correct 888 ms 24024 KB Output is correct
13 Correct 705 ms 24684 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 5 ms 620 KB Output is correct
4 Correct 5 ms 620 KB Output is correct
5 Correct 929 ms 25000 KB Output is correct
6 Correct 1457 ms 33276 KB Output is correct
7 Correct 2106 ms 32668 KB Output is correct
8 Correct 2997 ms 49716 KB Output is correct
9 Correct 1798 ms 17484 KB Output is correct
10 Correct 2064 ms 34364 KB Output is correct
11 Correct 1780 ms 17484 KB Output is correct
12 Correct 2086 ms 34364 KB Output is correct
13 Correct 1782 ms 17492 KB Output is correct
14 Correct 2133 ms 34364 KB Output is correct
15 Correct 868 ms 23916 KB Output is correct
16 Correct 701 ms 24660 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1276 ms 18512 KB Output is correct
9 Correct 1369 ms 18508 KB Output is correct
10 Correct 1610 ms 18764 KB Output is correct
11 Correct 1990 ms 33864 KB Output is correct
12 Correct 1710 ms 33992 KB Output is correct
13 Correct 2145 ms 32712 KB Output is correct
14 Correct 897 ms 24020 KB Output is correct
15 Correct 684 ms 24684 KB Output is correct
16 Correct 5 ms 620 KB Output is correct
17 Correct 4 ms 620 KB Output is correct
18 Correct 3 ms 492 KB Output is correct
19 Correct 2 ms 364 KB Output is correct
20 Correct 2914 ms 49648 KB Output is correct
21 Correct 2381 ms 34084 KB Output is correct
22 Correct 1688 ms 33252 KB Output is correct
23 Correct 689 ms 24684 KB Output is correct
24 Correct 240 ms 7132 KB Output is correct
25 Correct 273 ms 10720 KB Output is correct
26 Correct 270 ms 10712 KB Output is correct
27 Correct 888 ms 24024 KB Output is correct
28 Correct 705 ms 24684 KB Output is correct
29 Correct 2 ms 512 KB Output is correct
30 Correct 3 ms 492 KB Output is correct
31 Correct 5 ms 620 KB Output is correct
32 Correct 5 ms 620 KB Output is correct
33 Correct 929 ms 25000 KB Output is correct
34 Correct 1457 ms 33276 KB Output is correct
35 Correct 2106 ms 32668 KB Output is correct
36 Correct 2997 ms 49716 KB Output is correct
37 Correct 1798 ms 17484 KB Output is correct
38 Correct 2064 ms 34364 KB Output is correct
39 Correct 1780 ms 17484 KB Output is correct
40 Correct 2086 ms 34364 KB Output is correct
41 Correct 1782 ms 17492 KB Output is correct
42 Correct 2133 ms 34364 KB Output is correct
43 Correct 868 ms 23916 KB Output is correct
44 Correct 701 ms 24660 KB Output is correct
45 Correct 743 ms 10448 KB Output is correct
46 Correct 794 ms 10244 KB Output is correct
47 Correct 1182 ms 15884 KB Output is correct
48 Correct 1997 ms 33096 KB Output is correct
49 Correct 340 ms 10716 KB Output is correct
50 Correct 318 ms 10716 KB Output is correct
51 Correct 343 ms 10712 KB Output is correct
52 Correct 309 ms 10588 KB Output is correct
53 Correct 306 ms 10456 KB Output is correct
54 Correct 316 ms 10840 KB Output is correct