QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#21828#2831. Game TheoryQyc_AK_NOI2022#WA 215ms12580kbC++142.2kb2022-03-08 16:27:452022-05-08 04:07:36

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2022-05-08 04:07:36]
  • 评测
  • 测评结果:WA
  • 用时:215ms
  • 内存:12580kb
  • [2022-03-08 16:27:45]
  • 提交

answer

#include <cstdio>
using namespace std;
typedef long long ll;
inline int rd(){
	int x=0;
	char c=getchar();
	while(c<'0'||c>'9'){
		if(c==EOF)return -1;
		c=getchar();
	}
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x;
}
const int mod=998244353;
struct node{
	bool tag;
	int hv0,hv1,sum0,sum1;
}t[800010];
int n,q,s[200010];
inline int rdc(){
	char c=getchar();
	while(c<'0'||c>'9')c=getchar();
	return c^48;
}
inline int fx(int x){return x>=mod?x-mod:x;}
inline void refresh(int p){
	t[p].sum0=fx(t[p<<1].sum0+t[p<<1|1].sum0);
	t[p].sum1=fx(t[p<<1].sum1+t[p<<1|1].sum1);
	t[p].hv0=t[p<<1].hv0+t[p<<1|1].hv0;
	t[p].hv1=t[p<<1].hv1+t[p<<1|1].hv1;
}
inline void swp(int &x,int &y){x^=y^=x^=y;}
void build(int l,int r,int p){
	if(l==r){
		t[p]=(node){0,!s[l],s[l],(!s[l])*l,s[l]*l};
		return;
	}
	int mid=l+r>>1;
	t[p].tag=0;
	build(l,mid,p<<1),build(mid+1,r,p<<1|1);
	refresh(p);
}
inline void adt(int p){
	t[p].tag^=1;
	swp(t[p].hv0,t[p].hv1);
	swp(t[p].sum0,t[p].sum1);
}
inline void pushdown(int p){
	if(t[p].tag){
		t[p].tag=0;
		adt(p<<1),adt(p<<1|1);
	}
}
void filp(int l,int r,int p,int b,int e){
	if(b<=l && e>=r)return adt(p);
	pushdown(p);
	int mid=l+r>>1;
	if(b<=mid)filp(l,mid,p<<1,b,e);
	if(e>mid)filp(mid+1,r,p<<1|1,b,e);
	refresh(p);
}
int qus0(int l,int r,int p,int e){
	if(e>=r)return fx(fx(((ll)(e+1)*t[p].hv0+mod-t[p].sum0)%mod<<1)+mod-t[p].hv0);
	pushdown(p);
	int mid=l+r>>1,ans=qus0(l,mid,p<<1,e);
	if(e>mid)ans=fx(ans+qus0(mid+1,r,p<<1|1,e));
	return ans;
}
int qus1(int l,int r,int p,int b){
	if(b<=l)return fx(fx(t[p].sum1+mod-(ll)(b-1)*t[p].hv1%mod<<1)+mod-t[p].hv1);
	pushdown(p);
	int mid=l+r>>1,ans=qus1(mid+1,r,p<<1|1,b);
	if(b<=mid)ans=fx(ans+qus1(l,mid,p<<1,b));
	return ans;
}
inline int qus0(int p){
	if(!p)return 0;
	return qus0(1,n,1,t[1].hv1-1);
}
inline int qus1(int p){
	return qus1(1,n,1,t[1].hv1);
}
int main(){
//	freopen("a.in","r",stdin);
//	freopen("a.out","w",stdout);
	while((n=rd())!=-1){
		q=rd();
		for(int i=1;i<=n;++i)s[i]=rdc();
		build(1,n,1);
		for(int i=1,l,r;i<=q;++i){
			l=rd(),r=rd(),filp(1,n,1,l,r);
			if(!t[1].hv1){puts("0");continue;}
			printf("%d\n",fx(t[1].hv1-1+qus0(t[1].hv1-1)+qus1(t[1].hv1)));
		}
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3652kb

input:

3 2
010
1 2
2 3
5 1
00000
1 5

output:

1
3
5

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 1ms
memory: 3568kb

input:

1 1
0
1 1

output:

1

result:

ok single line: '1'

Test #3:

score: 0
Accepted
time: 18ms
memory: 3568kb

input:

2 2
01
2 2
2 2
2 2
01
1 2
1 2
1 2
1
1 1
1 1
1 2
1
1 1
1 1
2 2
00
1 2
1 2
2 2
11
1 2
1 2
2 2
01
2 2
1 1
2 2
10
2 2
1 2
2 2
01
1 2
1 2
1 2
0
1 1
1 1
2 2
01
1 2
2 2
1 2
0
1 1
1 1
1 2
1
1 1
1 1
2 2
10
1 2
1 1
1 2
0
1 1
1 1
2 2
01
1 2
1 2
2 2
10
1 2
1 1
1 2
0
1 1
1 1
1 2
0
1 1
1 1
1 2
1
1 1
1 1
2 2
10
1 ...

output:

0
3
1
3
0
1
0
1
2
0
0
2
0
1
2
0
1
3
1
0
1
2
1
0
0
1
3
2
1
0
1
3
3
2
1
0
1
0
0
1
0
1
0
2
2
1
0
1
2
1
1
0
2
0
2
3
1
0
0
1
2
0
0
1
0
1
0
1
1
0
1
2
2
0
0
2
0
1
0
1
1
0
1
0
1
0
0
1
0
1
0
1
2
0
3
0
1
0
0
1
1
0
1
0
1
2
0
2
1
0
0
3
1
2
0
1
3
2
1
0
0
1
2
0
2
0
0
1
0
1
1
0
1
0
1
0
1
0
1
2
1
0
3
1
0
3
0
1
0
1
...

result:

ok 200000 lines

Test #4:

score: 0
Accepted
time: 39ms
memory: 1708kb

input:

11 20
00010111000
1 6
1 11
5 6
8 11
1 4
3 8
4 11
1 7
5 9
1 4
6 10
5 6
1 7
5 10
1 10
9 11
6 8
1 4
8 11
1 4
10 20
0101000010
3 4
2 2
4 8
4 6
6 7
3 7
3 3
1 5
1 5
6 8
2 2
2 4
2 6
5 7
1 3
2 5
6 8
7 9
5 8
3 10
4 20
1011
2 4
1 4
1 3
2 3
1 1
2 2
1 2
2 4
1 2
3 4
3 4
3 4
1 4
2 2
1 4
1 3
1 1
1 3
1 3
2 2
4 20
1...

output:

16
55
53
25
13
15
43
52
41
33
34
40
43
45
35
28
25
33
45
37
19
20
35
38
36
41
36
29
36
29
22
31
20
23
28
20
21
10
14
30
2
10
5
7
10
9
7
2
0
10
0
10
2
1
9
6
7
4
7
8
4
9
1
6
8
3
5
7
3
7
6
8
6
9
6
7
2
0
5
3
66
105
83
68
92
137
92
76
85
92
127
120
119
104
124
65
70
88
61
53
40
43
25
21
32
59
67
32
29
50...

result:

ok 200000 lines

Test #5:

score: 0
Accepted
time: 75ms
memory: 1820kb

input:

11 200
11100010010
2 3
3 7
1 7
3 10
1 3
7 11
2 8
4 8
9 10
9 11
2 7
1 4
9 11
6 7
4 4
8 10
2 6
2 3
1 2
5 7
2 7
1 3
3 4
2 10
9 10
6 11
3 11
3 9
9 10
2 6
5 10
1 8
4 9
6 7
8 11
3 9
7 10
1 9
4 5
5 8
5 7
2 7
6 8
10 10
5 10
7 11
1 11
6 10
2 11
1 4
4 8
6 11
7 10
8 10
4 5
7 10
7 8
4 4
1 6
7 11
3 5
4 9
3 9
8 1...

output:

27
22
29
25
30
39
34
17
15
12
18
22
33
35
40
45
54
36
34
37
39
52
54
37
39
33
40
51
37
46
52
24
26
24
16
7
35
30
32
40
39
37
28
15
41
28
39
4
26
54
49
31
39
26
28
44
46
41
35
26
17
31
24
28
30
22
38
13
18
60
38
36
49
41
41
43
27
28
54
41
14
16
7
8
20
22
45
26
27
20
21
12
27
31
28
21
39
37
39
30
31
2...

result:

ok 200000 lines

Test #6:

score: 0
Accepted
time: 103ms
memory: 1824kb

input:

228 2000
111000100100000001001101001100110001011110001110001000101110101100010011011111000001011011000110111010111101011000010010000111111111100011111011011100111010011100111001010011110110011000100100110011111000110001111001010011001010
23 112
24 165
103 162
86 203
99 204
114 217
55 132
168 184
110...

output:

13974
13044
13700
13434
14000
13220
13546
13913
13184
13533
13051
13689
13533
14119
14470
13742
13980
13022
13167
13648
13592
13159
13028
13041
12964
12996
12792
12539
12039
11974
12336
12742
12841
12831
12730
12004
12065
12352
13037
11923
12332
14242
13475
13935
13121
12996
12755
13353
13720
13043
...

result:

ok 200000 lines

Test #7:

score: 0
Accepted
time: 159ms
memory: 3888kb

input:

20000 20000
110010001110111001001001011110011011011011101011010000011100100100110000011111000010010101001001110101010000011010101110001100111010000101000010110100011111001100001110011011001011010000100110010001000101111101001011100110101111110110100001100100110100000100100001011100111011000101111010...

output:

99977542
98746996
98989557
99015753
98938270
98605428
99504163
99699325
101118187
100862580
99993292
99728608
101006398
100940632
100522798
99799311
99585772
100035886
99976445
99131130
99309148
99370536
100535551
99600860
99595679
99735286
99976663
100435885
100334687
100103891
100055339
100160376
...

result:

ok 200000 lines

Test #8:

score: -100
Wrong Answer
time: 215ms
memory: 12580kb

input:

200000 200000
1101110010111101001110011011011100110000111011010010001110010111010000111100010101100111111010010100111110001001011000010110000100111111011110101101011011011101000010000110010011001011101000000100010110001100001010110010011101010100000011101111001110001110110000101101111011111101000101...

output:

420166526
994525462
2814500
397728348
403494915
422905471
723235950
409262363
408088036
-295889957
720956489
717616626
11973234
13511974
21653636
33119640
736604797
742364120
29192352
740020976
30728437
28870157
45189617
398482528
407823237
429675342
20571398
434583691
434481465
18748167
393859277
1...

result:

wrong answer 1st lines differ - expected: '25901941', found: '420166526'