Submission #124579

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
124579	2019-07-03T14:21:33 Z	TadijaSebez	Street Lamps (APIO19_street_lamps)	C++11	100 / 100	4354 ms	199424 KB

street_lamps

#include <bits/stdc++.h>
using namespace std;
const int N=300050;
const int M=18*18*N;
int state[N];
struct Seg
{
	int l,r,tme;
	Seg(){}
	Seg(int a, int b, int c):l(a),r(b),tme(c){}
	bool operator < (Seg b) const { return l<b.l;}
};
set<Seg> all;
Seg Get(int x)
{
	auto it=all.lower_bound(Seg(x+1,0,0));
	it--;
	return *it;
}
int root[N],ls[M],rs[M],tsz,sum[M];
void Set(int &c, int ss, int se, int qs, int qe, int x)
{
	if(qs>qe || qs>se || ss>qe) return;
	if(!c) c=++tsz;
	if(qs<=ss && qe>=se){ sum[c]+=x;return;}
	int mid=ss+se>>1;
	Set(ls[c],ss,mid,qs,qe,x);
	Set(rs[c],mid+1,se,qs,qe,x);
}
int Get(int c, int ss, int se, int qi)
{
	if(ss==se) return sum[c];
	int mid=ss+se>>1;
	if(qi<=mid) return sum[c]+Get(ls[c],ss,mid,qi);
	else return sum[c]+Get(rs[c],mid+1,se,qi);
}
void Set(int qi, int l, int r, int x)
{
	for(int i=qi;i<N;i+=i&-i) Set(root[i],1,N,l,r,x);
}
void Set(int l, int r, int x)
{
	Set(l,l,r,x);
	Set(r+1,l,r,-x);
}
int Get(int x, int y)
{
	int ans=0;
	for(int i=x;i;i-=i&-i) ans+=Get(root[i],1,N,y);
	return ans;
}
void Set(Seg sg, int tme)
{
	Set(sg.l,sg.r,tme-sg.tme);
}
void Update(int x, int tme)
{
	if(state[x])
	{
		Seg tmp=Get(x);
		Set(tmp,tme);
		all.erase(tmp);
		all.insert(Seg(tmp.l,x,tme));
		all.insert(Seg(x+1,tmp.r,tme));
	}
	else
	{
		Seg L=Get(x),R=Get(x+1);
		Set(L,tme);
		Set(R,tme);
		all.erase(L);
		all.erase(R);
		all.insert(Seg(L.l,R.r,tme));
	}
	state[x]^=1;
}
char s[N];
int main()
{
	int n,q;
	scanf("%i %i",&n,&q);
	scanf("%s",s+1);
	for(int i=1;i<=n;i++) state[i]=s[i]=='1';
	for(int i=1,j=1;i<=n+1;i=j+1)
	{
		for(j=i;j<=n && state[j];j++);
		all.insert(Seg(i,j,0));
	}
	char t[10];
	for(int i=1;i<=q;i++)
	{
		scanf("%s",t);
		if(t[0]=='t')
		{
			int x;
			scanf("%i",&x);
			Update(x,i);
		}
		else
		{
			int a,b;
			scanf("%i %i",&a,&b);
			int ans=Get(a,b);
			Seg tmp=Get(a);
			if(tmp.r>=b) ans+=i-tmp.tme;
			printf("%i\n",ans);
		}
	}
	return 0;
}

Compilation message

street_lamps.cpp: In function 'void Set(int&, int, int, int, int, int)':
street_lamps.cpp:26:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=ss+se>>1;
          ~~^~~
street_lamps.cpp: In function 'int Get(int, int, int, int)':
street_lamps.cpp:33:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=ss+se>>1;
          ~~^~~
street_lamps.cpp: In function 'int main()':
street_lamps.cpp:81:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i",&n,&q);
  ~~~~~^~~~~~~~~~~~~~~
street_lamps.cpp:82:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",s+1);
  ~~~~~^~~~~~~~~~
street_lamps.cpp:92:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s",t);
   ~~~~~^~~~~~~~
street_lamps.cpp:96:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%i",&x);
    ~~~~~^~~~~~~~~
street_lamps.cpp:102:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%i %i",&a,&b);
    ~~~~~^~~~~~~~~~~~~~~

Subtask #1

20.0 / 20.0

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

Subtask #2

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1246 ms	1688 KB	Output is correct
2	Correct	1260 ms	5324 KB	Output is correct
3	Correct	1439 ms	9608 KB	Output is correct
4	Correct	2236 ms	121952 KB	Output is correct
5	Correct	2407 ms	133188 KB	Output is correct
6	Correct	2496 ms	128704 KB	Output is correct
7	Correct	709 ms	27396 KB	Output is correct
8	Correct	306 ms	9720 KB	Output is correct

Subtask #3

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	1144 KB	Output is correct
2	Correct	10 ms	1016 KB	Output is correct
3	Correct	7 ms	888 KB	Output is correct
4	Correct	3 ms	376 KB	Output is correct
5	Correct	4354 ms	199424 KB	Output is correct
6	Correct	3338 ms	171496 KB	Output is correct
7	Correct	2341 ms	132652 KB	Output is correct
8	Correct	307 ms	9848 KB	Output is correct
9	Correct	123 ms	4148 KB	Output is correct
10	Correct	134 ms	4392 KB	Output is correct
11	Correct	138 ms	4572 KB	Output is correct
12	Correct	702 ms	27172 KB	Output is correct
13	Correct	308 ms	9848 KB	Output is correct

Subtask #4

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	504 KB	Output is correct
2	Correct	5 ms	760 KB	Output is correct
3	Correct	8 ms	976 KB	Output is correct
4	Correct	10 ms	992 KB	Output is correct
5	Correct	715 ms	25568 KB	Output is correct
6	Correct	1625 ms	101880 KB	Output is correct
7	Correct	2386 ms	128196 KB	Output is correct
8	Correct	3408 ms	146212 KB	Output is correct
9	Correct	1661 ms	4512 KB	Output is correct
10	Correct	2241 ms	3628 KB	Output is correct
11	Correct	1661 ms	4600 KB	Output is correct
12	Correct	2298 ms	3508 KB	Output is correct
13	Correct	1666 ms	4572 KB	Output is correct
14	Correct	2249 ms	3504 KB	Output is correct
15	Correct	696 ms	27284 KB	Output is correct
16	Correct	303 ms	9848 KB	Output is correct

Subtask #5

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	3 ms	504 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	380 KB	Output is correct
8	Correct	1246 ms	1688 KB	Output is correct
9	Correct	1260 ms	5324 KB	Output is correct
10	Correct	1439 ms	9608 KB	Output is correct
11	Correct	2236 ms	121952 KB	Output is correct
12	Correct	2407 ms	133188 KB	Output is correct
13	Correct	2496 ms	128704 KB	Output is correct
14	Correct	709 ms	27396 KB	Output is correct
15	Correct	306 ms	9720 KB	Output is correct
16	Correct	12 ms	1144 KB	Output is correct
17	Correct	10 ms	1016 KB	Output is correct
18	Correct	7 ms	888 KB	Output is correct
19	Correct	3 ms	376 KB	Output is correct
20	Correct	4354 ms	199424 KB	Output is correct
21	Correct	3338 ms	171496 KB	Output is correct
22	Correct	2341 ms	132652 KB	Output is correct
23	Correct	307 ms	9848 KB	Output is correct
24	Correct	123 ms	4148 KB	Output is correct
25	Correct	134 ms	4392 KB	Output is correct
26	Correct	138 ms	4572 KB	Output is correct
27	Correct	702 ms	27172 KB	Output is correct
28	Correct	308 ms	9848 KB	Output is correct
29	Correct	3 ms	504 KB	Output is correct
30	Correct	5 ms	760 KB	Output is correct
31	Correct	8 ms	976 KB	Output is correct
32	Correct	10 ms	992 KB	Output is correct
33	Correct	715 ms	25568 KB	Output is correct
34	Correct	1625 ms	101880 KB	Output is correct
35	Correct	2386 ms	128196 KB	Output is correct
36	Correct	3408 ms	146212 KB	Output is correct
37	Correct	1661 ms	4512 KB	Output is correct
38	Correct	2241 ms	3628 KB	Output is correct
39	Correct	1661 ms	4600 KB	Output is correct
40	Correct	2298 ms	3508 KB	Output is correct
41	Correct	1666 ms	4572 KB	Output is correct
42	Correct	2249 ms	3504 KB	Output is correct
43	Correct	696 ms	27284 KB	Output is correct
44	Correct	303 ms	9848 KB	Output is correct
45	Correct	869 ms	2980 KB	Output is correct
46	Correct	831 ms	3032 KB	Output is correct
47	Correct	1336 ms	53188 KB	Output is correct
48	Correct	2136 ms	121568 KB	Output is correct
49	Correct	154 ms	4600 KB	Output is correct
50	Correct	151 ms	4600 KB	Output is correct
51	Correct	156 ms	4728 KB	Output is correct
52	Correct	172 ms	4984 KB	Output is correct
53	Correct	174 ms	5144 KB	Output is correct
54	Correct	173 ms	4940 KB	Output is correct