QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#86282#4000. Dynamic ReachabilityBirdRE 2456ms16252kbC++142.6kb2023-03-09 16:57:502023-03-09 16:57:51

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-03-09 16:57:51]
  • 评测
  • 测评结果:RE
  • 用时:2456ms
  • 内存:16252kb
  • [2023-03-09 16:57:50]
  • 提交

answer

#include<bits/stdc++.h>
#include<queue>
#include<bitset>
#define N 50000
#define M 100000
using namespace std;
const int B=512;
int n,m,q,head[N+5],u[M+5],v[M+5],Head[N+5];
bool col[M+5],vise[M+5];
struct edge {int to,nxt;} e[M+5],E[M+5];
struct ask
{
	int opt,k,u,v;
	inline void read()
	{
		scanf("%d",&opt);
		if(opt==1) scanf("%d",&k);
		else scanf("%d %d",&u,&v);
	}
}a[M+5];
namespace tarjan
{
	int dfn[N+5],low[N+5],tot,cur[N+5],cnt,st[N+5],top;
	bool vis[N+5];
	#define y e[i].to
	inline void dfs(int x)
	{
		dfn[x]=low[x]=++tot,vis[st[++top]=x]=1;
		for(int i=head[x];i;i=e[i].nxt) if(!vise[i] && col[i])
		{
			if(!dfn[y]) dfs(y),low[x]=min(low[x],low[y]);
			else if(vis[y]) low[x]=min(low[x],dfn[y]);
		}
		if(low[x]==dfn[x]) for(st[top+1]=0,++cnt;st[top+1]!=x;--top)
			cur[st[top]]=cnt,vis[st[top]]=0;
	}
	inline void solve()
	{
		memset(dfn+1,0,n<<2),tot=0,cnt=0;
		for(int i=1;i<=n;++i) if(!dfn[i]) dfs(i);
		memset(Head+1,0,cnt<<2);
		for(int i=1;i<=m;++i) if(!vise[i] && col[i] && cur[u[i]]!=cur[v[i]])
			E[i]={cur[v[i]],Head[cur[u[i]]]},Head[cur[u[i]]]=i;
	}
	#undef y
}
using tarjan::cnt;
using tarjan::cur;
bitset<B*2> dis[N+5],nowe[B*2],now,temp;
int p[B*2],id[N+5],tot;
queue<int> que;
inline void add(int x) {if(!~id[x]) p[id[x]=tot++]=x;}
inline void get_dis()
{
	for(int x=1;x<=cnt;++x)
	{
		dis[x].reset();if(~id[x]) dis[x].set(id[x]);
		for(int i=Head[x];i;i=E[i].nxt) dis[x]|=dis[E[i].to];
	}
}
int main()
{
	scanf("%d %d %d",&n,&m,&q);
	for(int i=1;i<=m;++i)
	{
		scanf("%d %d",u+i,v+i),col[i]=1;
		e[i]={v[i],head[u[i]]},head[u[i]]=i;
	}
	for(int i=1;i<=q;++i) a[i].read();
	for(int t=1;t<=q;t+=B)
	{
		for(int i=t;i<min(q+1,t+B);++i)
			if(a[i].opt==1) vise[a[i].k]=1;
		tarjan::solve(),tot=0;
		memset(id+1,-1,cnt<<2);
		assert(cnt==n);
		for(int i=t;i<min(q+1,t+B);++i)
			if(a[i].opt==1) add(cur[u[a[i].k]]),add(cur[v[a[i].k]]);
			else add(cur[a[i].u]),add(cur[a[i].v]);
		get_dis();
		for(int i=t;i<min(q+1,t+B);++i) if(a[i].opt==1)
			a[i].u=id[cur[u[a[i].k]]],a[i].v=id[cur[v[a[i].k]]];
		for(int i=t;i<min(q+1,t+B);++i)
			if(a[i].opt==1) vise[a[i].k]=0,col[a[i].k]^=1;
			else
			{
				for(int x=0;x<tot;++x) nowe[x]=dis[p[x]];
				for(int j=t;j<min(q+1,t+B);++j) if(a[j].opt==1 && col[a[j].k]) nowe[a[j].u].set(a[j].v);
				now.set(),que.push(id[cur[a[i].u]]),now.reset(que.front());
				while(!que.empty())
				{
					int x=que.front();que.pop(),temp=nowe[x]&now;
					for(int y=temp._Find_first();y<tot;y=temp._Find_next(y))
						que.push(y),now.reset(y);
				}
				puts(now[id[cur[a[i].v]]]?"NO":"YES");
			}
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3644kb

input:

5 6 7
1 2
1 3
2 4
3 4
3 5
4 5
2 1 5
2 2 3
1 3
1 4
2 1 4
1 3
2 1 5

output:

YES
NO
NO
YES

result:

ok 4 lines

Test #2:

score: 0
Accepted
time: 1364ms
memory: 15200kb

input:

50000 100000 100000
36671 44121
25592 44321
13226 46463
13060 25694
14021 20087
22881 38333
34655 47774
22868 26462
31154 48710
27491 32365
5874 47497
17622 28600
1886 14193
22315 23656
14973 22704
1335 25384
22612 34915
2852 48213
23334 25519
24342 28784
6238 36125
14598 39494
33069 34250
2123 3059...

output:

NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
...

result:

ok 50000 lines

Test #3:

score: 0
Accepted
time: 1397ms
memory: 15276kb

input:

50000 100000 100000
27059 36120
32335 41190
9436 29046
36520 44281
25005 39115
37096 43321
11891 38873
10439 31878
19154 25918
26756 44170
9594 16092
9920 23747
17107 35055
31401 35308
17102 35604
18635 26767
27925 29726
7012 14266
973 21483
622 41029
25685 31856
36951 46699
18103 46885
9911 18465
2...

output:

NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
...

result:

ok 50000 lines

Test #4:

score: 0
Accepted
time: 1745ms
memory: 15264kb

input:

50000 100000 100000
7 14
14 21
21 28
28 35
35 42
42 49
49 56
56 63
63 70
70 77
77 84
84 91
91 98
98 105
105 112
112 119
119 126
126 133
133 140
140 147
147 154
154 161
161 168
168 175
175 182
182 189
189 196
196 203
203 210
210 217
217 224
224 231
231 238
238 245
245 252
252 259
259 266
266 273
273 ...

output:

NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
YES
NO
NO
NO
YES
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
N...

result:

ok 100000 lines

Test #5:

score: 0
Accepted
time: 1368ms
memory: 15268kb

input:

50000 100000 100000
233 466
466 699
699 932
932 1165
1165 1398
1398 1631
1631 1864
1864 2097
2097 2330
2330 2563
2563 2796
2796 3029
3029 3262
3262 3495
3495 3728
3728 3961
3961 4194
4194 4427
4427 4660
4660 4893
4893 5126
5126 5359
5359 5592
5592 5825
5825 6058
6058 6291
6291 6524
6524 6757
6757 69...

output:

NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
...

result:

ok 50000 lines

Test #6:

score: 0
Accepted
time: 1449ms
memory: 15352kb

input:

50000 100000 100000
13 26
26 39
39 52
52 65
65 78
78 91
91 104
104 117
117 130
130 143
143 156
156 169
169 182
182 195
195 208
208 221
221 234
234 247
247 260
260 273
273 286
286 299
299 312
312 325
325 338
338 351
351 364
364 377
377 390
390 403
403 416
416 429
429 442
442 455
455 468
468 481
481 4...

output:

NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
YES
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
...

result:

ok 50000 lines

Test #7:

score: 0
Accepted
time: 1449ms
memory: 15288kb

input:

50000 100000 100000
4 8
8 12
12 16
16 20
20 24
24 28
28 32
32 36
36 40
40 44
44 48
48 52
52 56
56 60
60 64
64 68
68 72
72 76
76 80
80 84
84 88
88 92
92 96
96 100
100 104
104 108
108 112
112 116
116 120
120 124
124 128
128 132
132 136
136 140
140 144
144 148
148 152
152 156
156 160
160 164
164 168
16...

output:

YES
YES
NO
NO
NO
NO
NO
YES
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
YES
NO
NO
NO
NO
YES
YES
NO
NO
YES
NO
NO
NO
NO
NO
YES
YES
NO
YES
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
YES
NO
NO
NO
NO
YES
NO
YES
YES
NO
NO
YES
NO
YES
YES
NO
NO
YES
NO
NO
YES
NO
NO
NO
NO
NO
N...

result:

ok 50000 lines

Test #8:

score: 0
Accepted
time: 1462ms
memory: 15228kb

input:

50000 100000 100000
2 4
4 6
6 8
8 10
10 12
12 14
14 16
16 18
18 20
20 22
22 24
24 26
26 28
28 30
30 32
32 34
34 36
36 38
38 40
40 42
42 44
44 46
46 48
48 50
50 52
52 54
54 56
56 58
58 60
60 62
62 64
64 66
66 68
68 70
70 72
72 74
74 76
76 78
78 80
80 82
82 84
84 86
86 88
88 90
90 92
92 94
94 96
96 98...

output:

NO
NO
NO
NO
NO
NO
YES
YES
YES
YES
NO
YES
YES
YES
NO
NO
YES
YES
NO
NO
NO
NO
YES
NO
YES
YES
NO
YES
NO
YES
YES
NO
NO
YES
YES
YES
NO
YES
YES
NO
NO
YES
YES
YES
NO
NO
YES
NO
YES
NO
NO
NO
YES
YES
YES
NO
YES
NO
NO
YES
YES
YES
YES
YES
YES
NO
NO
YES
NO
NO
YES
NO
YES
YES
NO
NO
NO
NO
YES
NO
NO
NO
YES
YES
NO
YES...

result:

ok 50000 lines

Test #9:

score: 0
Accepted
time: 1312ms
memory: 15276kb

input:

50000 100000 100000
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
10 11
11 12
12 13
13 14
14 15
15 16
16 17
17 18
18 19
19 20
20 21
21 22
22 23
23 24
24 25
25 26
26 27
27 28
28 29
29 30
30 31
31 32
32 33
33 34
34 35
35 36
36 37
37 38
38 39
39 40
40 41
41 42
42 43
43 44
44 45
45 46
46 47
47 48
48 49
49 50
50 ...

output:

YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
...

result:

ok 50000 lines

Test #10:

score: 0
Accepted
time: 1210ms
memory: 15268kb

input:

50000 100000 100000
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
10 11
11 12
12 13
13 14
14 15
15 16
16 17
17 18
18 19
19 20
20 21
21 22
22 23
23 24
24 25
25 26
26 27
27 28
28 29
29 30
30 31
31 32
32 33
33 34
34 35
35 36
36 37
37 38
38 39
39 40
40 41
41 42
42 43
43 44
44 45
45 46
46 47
47 48
48 49
49 50
50 ...

output:

YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
NO
YES
YES
YES
YES
YES
YES
YES
YES
NO
NO
YES
YES
YES
YES
YES
NO
YES
YES
YES
YES
YES
YES
YES
YES
NO
NO
NO
YES
YES
NO
YES
YES
YES
YES
NO
YES
YES
YES
YES
YES
YES
YES
YES
NO
YES
YES
YES
YES
YES
YE...

result:

ok 50000 lines

Test #11:

score: 0
Accepted
time: 1326ms
memory: 15268kb

input:

50000 100000 100000
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
10 11
11 12
12 13
13 14
14 15
15 16
16 17
17 18
18 19
19 20
20 21
21 22
22 23
23 24
24 25
25 26
26 27
27 28
28 29
29 30
30 31
31 32
32 33
33 34
34 35
35 36
36 37
37 38
38 39
39 40
40 41
41 42
42 43
43 44
44 45
45 46
46 47
47 48
48 49
49 50
50 ...

output:

YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
NO
NO
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
NO
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
NO
YES
YES
YES
NO
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
Y...

result:

ok 50000 lines

Test #12:

score: 0
Accepted
time: 1322ms
memory: 15296kb

input:

50000 100000 100000
1 2
2 3
3 4
4 5
6 7
7 8
8 9
9 10
10 11
12 13
13 14
14 15
15 16
16 17
18 19
19 20
20 21
21 22
22 23
24 25
25 26
26 27
27 28
28 29
30 31
31 32
32 33
33 34
34 35
36 37
37 38
38 39
39 40
40 41
42 43
43 44
44 45
45 46
46 47
48 49
49 50
50 51
51 52
52 53
54 55
55 56
56 57
57 58
58 59
6...

output:

YES
NO
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
N...

result:

ok 50000 lines

Test #13:

score: 0
Accepted
time: 972ms
memory: 16196kb

input:

50000 100000 100000
12500 12501
12501 12502
12502 12503
12503 12504
12504 12505
12505 12506
12506 12507
12507 12508
12508 12509
12509 12510
12510 12511
12511 12512
12512 12513
12513 12514
12514 12515
12515 12516
12516 12517
12517 12518
12518 12519
12519 12520
12520 12521
12521 12522
12522 12523
1252...

output:

NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES...

result:

ok 50000 lines

Test #14:

score: 0
Accepted
time: 971ms
memory: 16252kb

input:

50000 100000 100000
12500 12501
12501 12502
12502 12503
12503 12504
12504 12505
12505 12506
12506 12507
12507 12508
12508 12509
12509 12510
12510 12511
12511 12512
12512 12513
12513 12514
12514 12515
12515 12516
12516 12517
12517 12518
12518 12519
12519 12520
12520 12521
12521 12522
12522 12523
1252...

output:

NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES...

result:

ok 50000 lines

Test #15:

score: 0
Accepted
time: 939ms
memory: 16208kb

input:

50000 100000 100000
12500 12501
12501 12502
12502 12503
12503 12504
12504 12505
12505 12506
12506 12507
12507 12508
12508 12509
12509 12510
12510 12511
12511 12512
12512 12513
12513 12514
12514 12515
12515 12516
12516 12517
12517 12518
12518 12519
12519 12520
12520 12521
12521 12522
12522 12523
1252...

output:

NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
N...

result:

ok 50000 lines

Test #16:

score: 0
Accepted
time: 909ms
memory: 16236kb

input:

50000 100000 100000
12500 12501
12501 12502
12502 12503
12503 12504
12504 12505
12505 12506
12506 12507
12507 12508
12508 12509
12509 12510
12510 12511
12511 12512
12512 12513
12513 12514
12514 12515
12515 12516
12516 12517
12517 12518
12518 12519
12519 12520
12520 12521
12521 12522
12522 12523
1252...

output:

NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
N...

result:

ok 50000 lines

Test #17:

score: 0
Accepted
time: 1318ms
memory: 15176kb

input:

50000 100000 100000
24500 24501
24501 24502
24502 24503
24503 24504
24504 24505
24505 24506
24506 24507
24507 24508
24508 24509
24509 24510
24510 24511
24511 24512
24512 24513
24513 24514
24514 24515
24515 24516
24516 24517
24517 24518
24518 24519
24519 24520
24520 24521
24521 24522
24522 24523
2452...

output:

NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES...

result:

ok 98000 lines

Test #18:

score: 0
Accepted
time: 2456ms
memory: 15224kb

input:

50000 100000 100000
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
10 11
11 12
12 13
13 14
14 15
15 16
16 17
17 18
18 19
19 20
20 21
21 22
22 23
23 24
24 25
25 26
26 27
27 28
28 29
29 30
30 31
31 32
32 33
33 34
34 35
35 36
36 37
37 38
38 39
39 40
40 41
41 42
42 43
43 44
44 45
45 46
46 47
47 48
48 49
49 50
50 ...

output:

YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
...

result:

ok 100000 lines

Test #19:

score: 0
Accepted
time: 2050ms
memory: 15216kb

input:

50000 100000 100000
2 4
4 6
6 8
8 10
10 12
12 14
14 16
16 18
18 20
20 22
22 24
24 26
26 28
28 30
30 32
32 34
34 36
36 38
38 40
40 42
42 44
44 46
46 48
48 50
50 52
52 54
54 56
56 58
58 60
60 62
62 64
64 66
66 68
68 70
70 72
72 74
74 76
76 78
78 80
80 82
82 84
84 86
86 88
88 90
90 92
92 94
94 96
96 98...

output:

NO
YES
YES
YES
NO
NO
YES
YES
YES
NO
YES
YES
NO
YES
YES
NO
YES
NO
NO
NO
NO
NO
YES
YES
NO
YES
NO
YES
YES
YES
NO
NO
YES
NO
NO
NO
YES
YES
YES
YES
NO
YES
NO
NO
YES
YES
YES
NO
NO
YES
YES
YES
YES
NO
YES
YES
NO
NO
YES
YES
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
YES
NO
NO
YES
YES
NO
NO
YES
NO
NO
...

result:

ok 100000 lines

Test #20:

score: 0
Accepted
time: 1961ms
memory: 15164kb

input:

50000 100000 100000
3 6
6 9
9 12
12 15
15 18
18 21
21 24
24 27
27 30
30 33
33 36
36 39
39 42
42 45
45 48
48 51
51 54
54 57
57 60
60 63
63 66
66 69
69 72
72 75
75 78
78 81
81 84
84 87
87 90
90 93
93 96
96 99
99 102
102 105
105 108
108 111
111 114
114 117
117 120
120 123
123 126
126 129
129 132
132 13...

output:

YES
NO
NO
NO
YES
NO
YES
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
NO
NO
YES
NO
NO
YES
NO
YES
NO
NO
NO
NO
NO
NO
YES
YES
NO
YES
YES
NO
NO
YES
NO
YES
NO
YES
NO
NO
NO
NO
YES
NO
NO
YES
NO
YES
YES
YES
YES
NO
NO
NO
NO
YES
YES
NO
NO
NO
YES
NO
NO
NO
YES
YES
NO
NO
NO
YES
NO
NO
NO
NO
YES
NO
NO
NO...

result:

ok 100000 lines

Test #21:

score: -100
Dangerous Syscalls

input:

5000 10000 10000
4103 3044
1509 4745
3287 2269
1227 1146
3580 1636
4103 1040
1747 4633
1572 1188
4212 2110
633 4726
1390 511
3571 20
3491 1138
332 4118
3445 1002
3848 4285
2373 4520
2276 2638
4003 4209
1647 3074
372 374
4317 202
3969 2571
1459 3606
2006 1859
1985 1755
4443 3420
449 3964
539 2829
347...

output:


result: