QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#99013	#3501. Jail	xiaoyaowudi	66	2241ms	580340kb	C++17	3.9kb	2023-04-21 08:42:49	2023-04-21 08:42:52

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-04-21 08:42:52]
评测

测评结果：66
用时：2241ms
内存：580340kb

查看

[2023-04-21 08:42:49]
提交

answer

#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>
using namespace std;
constexpr int N=120010,M=30000010,MM=10000010;
int hd[M],nxt[M<<1],t[M<<1],cnt,ncnt,d[M],n,m;
void add_edge(int a,int b){/*printf("%d %d\n",a,b);*/nxt[++cnt]=hd[a],t[cnt]=b,hd[a]=cnt,++d[b];}
struct inT{
	int cnt;struct _z{int c[2],id1,id2;}z[MM];
	void init(){cnt=0;}void pu(int v){if(z[v].c[0]) add_edge(z[v].id1,z[z[v].c[0]].id1),add_edge(z[z[v].c[0]].id2,z[v].id2);
		if(z[v].c[1]) add_edge(z[v].id1,z[z[v].c[1]].id1),add_edge(z[z[v].c[1]].id2,z[v].id2);}
	int upd(int u,int cl,int cr,int pos,int val){
		int v=++cnt;z[v]=z[u];z[v].id1=++ncnt,z[v].id2=++ncnt;
		if(cl==cr){add_edge(z[v].id1,val);add_edge(val,z[v].id2);return v;}int mid=(cl+cr)>>1;
		(pos<=mid)?(z[v].c[0]=upd(z[u].c[0],cl,mid,pos,val)):(z[v].c[1]=upd(z[u].c[1],mid+1,cr,pos,val));pu(v);
		return v;
	}
	int del(int u,int cl,int cr,int pos){
		if(cl==cr) return 0;int mid=(cl+cr)>>1;int ls=z[u].c[0],rs=z[u].c[1];
		(pos<=mid)?ls=del(z[u].c[0],cl,mid,pos):rs=del(z[u].c[1],mid+1,cr,pos);if(!ls && !rs) return 0;
		int v=++cnt;z[v].c[0]=ls,z[v].c[1]=rs,z[v].id1=++ncnt,z[v].id2=++ncnt;pu(v);return v;
	}
	int merge(int u,int v,int cl,int cr){
		if(!u || !v) return u|v;if(cl==cr) return u;int mid=(cl+cr)>>1;z[u].id1=++ncnt,z[u].id2=++ncnt;
		z[u].c[0]=merge(z[u].c[0],z[v].c[0],cl,mid);
		z[u].c[1]=merge(z[u].c[1],z[v].c[1],mid+1,cr);pu(u);return u;
	}
	void qry1(int u,int cl,int cr,int ql,int qr,int val){
		if(!u) return;if(cl>=ql && cr<=qr){add_edge(val,z[u].id1);return;}int mid=(cl+cr)>>1;
		if(ql<=mid) qry1(z[u].c[0],cl,mid,ql,qr,val);if(qr>mid) qry1(z[u].c[1],mid+1,cr,ql,qr,val);
	}
	void qry2(int u,int cl,int cr,int ql,int qr,int val){
		if(!u) return;if(cl>=ql && cr<=qr){add_edge(z[u].id2,val);return;}int mid=(cl+cr)>>1;
		if(ql<=mid) qry2(z[u].c[0],cl,mid,ql,qr,val);if(qr>mid) qry2(z[u].c[1],mid+1,cr,ql,qr,val);
	}
}T1;
#define pb emplace_back
int rts[N];int qq[M],ql,qr;bool vis[N];
int siz[N],son[N],top[N],ff[N],dep[N],st[N],ed[N];vector<int> dels[N],es[N];
int lca(int u,int v){while(top[u]!=top[v]){if(dep[top[u]]<dep[top[v]]) swap(u,v);u=ff[top[u]];}return dep[u]<dep[v]?u:v;}
void dfs(int u,int fa){siz[u]=1,son[u]=0,ff[u]=fa,dep[u]=dep[fa]+1;for(int v:es[u]) if(v!=fa) dfs(v,u),siz[u]+=siz[v],(siz[v]>siz[son[u]]?son[u]=v:0);}
void dfs(int u,int fa,int tp){top[u]=tp;if(son[u]) dfs(son[u],u,tp);for(int v:es[u]) if(v!=fa && v!=son[u]) dfs(v,u,v);}
void calc(int u,int fa){for(int v:es[u]) if(v!=fa) calc(v,u),rts[u]=T1.merge(rts[u],rts[v],1,m);
	if(rts[u] && st[u]){
		if(st[u]>1) T1.qry1(rts[u],1,m,1,st[u]-1,st[u]);
		if(st[u]<m) T1.qry1(rts[u],1,m,st[u]+1,m,st[u]);
	}
	if(rts[u] && ed[u]){
		if(ed[u]>1) T1.qry2(rts[u],1,m,1,ed[u]-1,ed[u]);
		if(ed[u]<m) T1.qry2(rts[u],1,m,ed[u]+1,m,ed[u]);
	}
	for(int i:dels[u]) rts[u]=T1.del(rts[u],1,m,i);}
int main(){
	int T;scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		for(int i=1,u,v;i<n;++i) scanf("%d%d",&u,&v),es[u].pb(v),es[v].pb(u);
		dfs(1,0);dfs(1,0,1);
		scanf("%d",&m);ncnt=m;
		for(int i=1,u,v;i<=m;++i){
			scanf("%d%d",&u,&v);int k=lca(u,v);dels[k].pb(i);//printf("%d %d %d\n",u,v,k);
			rts[u]=T1.upd(rts[u],1,m,i,i);
			rts[v]=T1.upd(rts[v],1,m,i,i);
			st[u]=i;ed[v]=i;
		}
		calc(1,0);
		// printf("hey\n");
		qr=1;ql=1;
		for(int i=1;i<=ncnt;++i) if(!d[i]) qq[qr++]=i;
		while(ql<qr){
			int u=qq[ql++];if(u<=m) vis[u]=true;//printf("%d\n",u);
			for(int pp=hd[u],v;pp;pp=nxt[pp]) if(!(--d[v=t[pp]])) qq[qr++]=v;
		}
		bool ok=true;
		for(int i=1;i<=m;++i) if(!vis[i]){ok=false;break;}
		if(ok) printf("Yes\n");
		else printf("No\n");
		for(int i=1;i<=n;++i) dels[i].clear(),st[i]=0,ed[i]=0,es[i].clear(),rts[i]=0;
		for(int i=1;i<=m;++i) vis[i]=false;
		memset(hd,0,sizeof(int)*(ncnt+5));memset(d,0,sizeof(int)*(ncnt+5));
		/*printf("%d %d %d %d\n",cnt,ncnt,T1.cnt,T2.cnt);*/cnt=ncnt=0;T1.init();
	}
	return 0;
}

源文件, 语言: C++17

詳細信息

Subtask #1:

score: 5

Accepted

Test #1:

score: 5

Accepted

time: 7ms

memory: 20024kb

input:

output:

No

result:

ok single line: 'No'

Test #2:

score: 0

Accepted

time: 7ms

memory: 18352kb

input:

output:

No
Yes
Yes
No
Yes
No
Yes
No
Yes
No
No
Yes
No
No
No
No
No
No
No
No
No
Yes
Yes
Yes
Yes
No
No
Yes
No
No
No
No
No
No
No
Yes
Yes
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
Yes
Yes
Yes
No
Yes
Yes
No
Yes
Yes
No
Yes
Yes
No
Yes
Yes
No
No
Yes
Yes
No
No
Yes
No
No
Yes
No
No
Yes
No
No
Yes
No
No
No
Ye...

result:

ok 462 lines

Test #3:

score: 0

Accepted

time: 17ms

memory: 20028kb

input:

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 1000 lines

Test #4:

score: 0

Accepted

time: 2ms

memory: 18728kb

input:

output:

Yes
Yes
Yes
Yes
Yes
Yes
No
No
Yes
No
No
No
Yes
No
No
No
Yes
No
No
Yes

result:

ok 20 lines

Test #5:

score: 0

Accepted

time: 2ms

memory: 18484kb

input:

output:

Yes
Yes
Yes
Yes
Yes
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
Yes

result:

ok 20 lines

Test #6:

score: 0

Accepted

time: 1ms

memory: 20200kb

input:

output:

Yes
Yes
Yes
Yes
Yes
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
Yes

result:

ok 20 lines

Test #7:

score: 0

Accepted

time: 36ms

memory: 18932kb

input:

output:

Yes
Yes
Yes
Yes
Yes
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
Yes

result:

ok 20 lines

Test #8:

score: 0

Accepted

time: 31ms

memory: 48204kb

input:

output:

Yes

result:

ok single line: 'Yes'

Test #9:

score: 0

Accepted

time: 8ms

memory: 18308kb

input:

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 1000 lines

Test #10:

score: 0

Accepted

time: 62ms

memory: 20032kb

input:

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 1000 lines

Test #11:

score: 0

Accepted

time: 474ms

memory: 244556kb

input:

output:

Yes

result:

ok single line: 'Yes'

Test #12:

score: 0

Accepted

time: 457ms

memory: 239912kb

input:

output:

No

result:

ok single line: 'No'

Test #13:

score: 0

Accepted

time: 662ms

memory: 253784kb

input:

output:

No

result:

ok single line: 'No'

Test #14:

score: 0

Accepted

time: 2241ms

memory: 580340kb

input:

output:

No

result:

ok single line: 'No'

Test #15:

score: 0

Accepted

time: 765ms

memory: 305932kb

input:

output:

Yes

result:

ok single line: 'Yes'

Test #16:

score: 0

Accepted

time: 978ms

memory: 471096kb

input:

output:

Yes

result:

ok single line: 'Yes'

Test #17:

score: 0

Accepted

time: 735ms

memory: 301920kb

input:

output:

Yes

result:

ok single line: 'Yes'

Test #18:

score: 0

Accepted

time: 708ms

memory: 296280kb

input:

output:

No

result:

ok single line: 'No'

Test #19:

score: 0

Accepted

time: 623ms

memory: 285524kb

input:

output:

No

result:

ok single line: 'No'

Test #20:

score: 0

Accepted

time: 550ms

memory: 192992kb

input:

output:

No

result:

ok single line: 'No'

Subtask #2:

score: 5

Accepted

Test #21:

score: 5

Accepted

time: 4ms

memory: 18332kb

input:

output:

No
No
No
No
No
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
No
No
No
No
Yes
Yes

result:

ok 20 lines

Test #22:

score: 0

Accepted

time: 3ms

memory: 20276kb

input:

output:

Yes
Yes
Yes
Yes
Yes
No
No
No
No
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes

result:

ok 20 lines

Test #23:

score: 0

Accepted

time: 1ms

memory: 17132kb

input:

output:

Yes
Yes
Yes
Yes
Yes
Yes
No
No
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
No

result:

ok 20 lines

Test #24:

score: 0

Accepted

time: 2ms

memory: 17680kb

input:

output:

No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
No
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes

result:

ok 20 lines

Test #25:

score: 0

Accepted

time: 2ms

memory: 18632kb

input:

output:

Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes

result:

ok 20 lines

Test #26:

score: 0

Accepted

time: 1ms

memory: 18680kb

input:

output:

Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes

result:

ok 20 lines

Test #27:

score: 0

Accepted

time: 0ms

memory: 17248kb

input:

output:

Yes
No
No
No
No
No
No
Yes
Yes
Yes
Yes
Yes
Yes
No
No
No
No
No
No
Yes

result:

ok 20 lines

Test #28:

score: 0

Accepted

time: 3ms

memory: 17556kb

input:

output:

Yes
Yes
Yes
Yes
Yes
No
No
No
No
No
No
Yes
Yes
Yes
Yes
Yes
Yes

result:

ok 17 lines

Test #29:

score: 0

Accepted

time: 1ms

memory: 20092kb

input:

output:

No
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
No
Yes
Yes
Yes
Yes

result:

ok 20 lines

Test #30:

score: 0

Accepted

time: 3ms

memory: 18356kb

input:

output:

No
No
Yes
No
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes

result:

ok 20 lines

Subtask #3:

score: 16

Accepted

Dependency #2:

100%

Accepted

Test #31:

score: 16

Accepted

time: 4ms

memory: 17400kb

input:

output:

Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes

result:

ok 20 lines

Test #32:

score: 0

Accepted

time: 8ms

memory: 17180kb

input:

output:

Yes
No
No
No
Yes
No
No
Yes
No
No
Yes
No
No
No
Yes
Yes
No
Yes
No
No

result:

ok 20 lines

Test #33:

score: 0

Accepted

time: 1ms

memory: 17372kb

input:

output:

Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
No
No
No
No
Yes
Yes
Yes
Yes
Yes
Yes
No

result:

ok 20 lines

Test #34:

score: 0

Accepted

time: 3ms

memory: 18440kb

input:

output:

Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
No
Yes
No
No
Yes
Yes
No
No
Yes

result:

ok 20 lines

Test #35:

score: 0

Accepted

time: 1ms

memory: 17136kb

input:

output:

Yes
Yes
Yes
Yes
Yes
No
No
Yes
Yes
No
No
Yes
No
Yes
No
No
No
Yes
No
Yes

result:

ok 20 lines

Test #36:

score: 0

Accepted

time: 1ms

memory: 17116kb

input:

output:

No
No
No
No
No
No
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes

result:

ok 20 lines

Test #37:

score: 0

Accepted

time: 4ms

memory: 18804kb

input:

output:

Yes
Yes
Yes
Yes
No
No
No
No
No
No
Yes
Yes
Yes
Yes
Yes
No
Yes
No
Yes
No

result:

ok 20 lines

Test #38:

score: 0

Accepted

time: 4ms

memory: 18632kb

input:

output:

Yes
No
No
Yes
No
Yes
No
No
Yes
No
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes

result:

ok 20 lines

Test #39:

score: 0

Accepted

time: 4ms

memory: 18860kb

input:

output:

Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
No
No
No
No
No
No
No
No
No

result:

ok 20 lines

Test #40:

score: 0

Accepted

time: 0ms

memory: 17664kb

input:

output:

Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes

result:

ok 20 lines

Test #41:

score: 0

Accepted

time: 4ms

memory: 19976kb

input:

output:

No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes

result:

ok 20 lines

Test #42:

score: 0

Accepted

time: 2ms

memory: 17156kb

input:

output:

No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No

result:

ok 20 lines

Subtask #4:

score: 28

Accepted

Dependency #3:

100%

Accepted

Test #43:

score: 28

Accepted

time: 5ms

memory: 17812kb

input:

output:

No
No
No
Yes
Yes
No
No
No
No
Yes
No
No
No
No
No
No
No
No
No
No

result:

ok 20 lines

Test #44:

score: 0

Accepted

time: 9ms

memory: 18464kb

input:

output:

No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No

result:

ok 20 lines

Test #45:

score: 0

Accepted

time: 5ms

memory: 20296kb

input:

output:

No
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
No
No
Yes
Yes
No
No
No
No
No
Yes
No

result:

ok 20 lines

Test #46:

score: 0

Accepted

time: 4ms

memory: 17412kb

input:

output:

No
No
No
Yes
Yes
Yes
Yes
Yes
No
No
No
Yes
No
No
Yes
Yes
No
Yes
No
No

result:

ok 20 lines

Test #47:

score: 0

Accepted

time: 8ms

memory: 18940kb

input:

output:

No
No
No
No
No
No
No
No
No
No
Yes
Yes
Yes
Yes
Yes
No
No
Yes
No
Yes

result:

ok 20 lines

Test #48:

score: 0

Accepted

time: 0ms

memory: 17616kb

input:

output:

No
No
No
No
No
No
No
No
No
No
Yes
Yes
Yes
Yes
Yes
No
No
No
No
No

result:

ok 20 lines

Test #49:

score: 0

Accepted

time: 10ms

memory: 18468kb

input:

output:

Yes
No
No
Yes
No
Yes
No
No
Yes
No
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No

result:

ok 20 lines

Test #50:

score: 0

Accepted

time: 5ms

memory: 20056kb

input:

output:

Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes

result:

ok 20 lines

Subtask #5:

score: 12

Accepted

Dependency #4:

100%

Accepted

Test #51:

score: 12

Accepted

time: 48ms

memory: 19748kb

input:

output:

No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No

result:

ok 20 lines

Test #52:

score: 0

Accepted

time: 53ms

memory: 19172kb

input:

output:

Yes
Yes
Yes
No
Yes
Yes
Yes
No
Yes
No
No
Yes
No
Yes
Yes
Yes
No
Yes
Yes
Yes

result:

ok 20 lines

Test #53:

score: 0

Accepted

time: 35ms

memory: 21360kb

input:

output:

No
No
No
No
No
No
No
Yes
Yes
No
No
No
No
Yes
Yes
Yes
Yes
No
Yes
Yes

result:

ok 20 lines

Test #54:

score: 0

Accepted

time: 22ms

memory: 21020kb

input:

output:

Yes
Yes
No
Yes
No
No
Yes
Yes
Yes
Yes
Yes
No
Yes
No
No
Yes
Yes
No
No
No

result:

ok 20 lines

Test #55:

score: 0

Accepted

time: 22ms

memory: 21400kb

input:

output:

No
No
No
No
No
No
No
No
No
No
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
No
No

result:

ok 20 lines

Test #56:

score: 0

Accepted

time: 54ms

memory: 23632kb

input:

output:

No

result:

ok single line: 'No'

Test #57:

score: 0

Accepted

time: 52ms

memory: 25852kb

input:

output:

Yes

result:

ok single line: 'Yes'

Test #58:

score: 0

Accepted

time: 32ms

memory: 34332kb

input:

output:

Yes

result:

ok single line: 'Yes'

Test #59:

score: 0

Accepted

time: 39ms

memory: 34464kb

input:

output:

Yes

result:

ok single line: 'Yes'

Test #60:

score: 0

Accepted

time: 39ms

memory: 21716kb

input:

output:

No

result:

ok single line: 'No'

Test #61:

score: 0

Accepted

time: 46ms

memory: 22720kb

input:

output:

Yes

result:

ok single line: 'Yes'

Test #62:

score: 0

Accepted

time: 37ms

memory: 27992kb

input:

output:

Yes

result:

ok single line: 'Yes'

Test #63:

score: 0

Accepted

time: 36ms

memory: 25672kb

input:

output:

No

result:

ok single line: 'No'

Test #64:

score: 0

Accepted

time: 29ms

memory: 16668kb

input:

output:

Yes
No
No
Yes
No
Yes
No
No
Yes
No
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes

result:

ok 20 lines

Test #65:

score: 0

Accepted

time: 57ms

memory: 21564kb

input:

1
120000
9596 32034
82692 85993
30880 60468
22127 89935
44536 51056
29638 71986
57153 103961
11021 66919
65177 96684
4542 48982
10457 21422
10762 52690
76467 105536
31498 46755
48690 82310
13509 118283
15463 106906
7541 66632
74654 103950
58261 68753
15087 48231
31649 96398
69483 90580
36955 85619
2...

output:

Yes

result:

ok single line: 'Yes'

Subtask #6:

score: 0

Time Limit Exceeded

Test #66:

score: 11

Accepted

time: 48ms

memory: 15084kb

input:

output:

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
No
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
No
No
No
No
No
No
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
No
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
...

result:

ok 1000 lines

Test #67:

score: 0

Accepted

time: 58ms

memory: 15480kb

input:

output:

Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
No
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
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Y...

result:

ok 1000 lines

Test #68:

score: 0

Accepted

time: 54ms

memory: 15948kb

input:

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 1000 lines

Test #69:

score: 0

Accepted

time: 204ms

memory: 54556kb

input:

output:

No

result:

ok single line: 'No'

Test #70:

score: 0

Accepted

time: 838ms

memory: 255260kb

input:

output:

No

result:

ok single line: 'No'

Test #71:

score: 0

Accepted

time: 1422ms

memory: 511920kb

input:

output:

No

result:

ok single line: 'No'

Test #72:

score: 0

Accepted

time: 573ms

memory: 97932kb

input:

output:

Yes

result:

ok single line: 'Yes'

Test #73:

score: 0

Accepted

time: 399ms

memory: 91616kb

input:

output:

No

result:

ok single line: 'No'

Test #74:

score: 0

Accepted

time: 576ms

memory: 97036kb

input:

output:

Yes

result:

ok single line: 'Yes'

Test #75:

score: 0

Accepted

time: 1022ms

memory: 260116kb

input:

output:

No

result:

ok single line: 'No'

Test #76:

score: 0

Accepted

time: 784ms

memory: 246464kb

input:

output:

No

result:

ok single line: 'No'

Test #77:

score: 0

Accepted

time: 1333ms

memory: 268952kb

input:

output:

Yes

result:

ok single line: 'Yes'

Test #78:

score: 0

Accepted

time: 1319ms

memory: 267736kb

input:

output:

No

result:

ok single line: 'No'

Test #79:

score: 0

Accepted

time: 1282ms

memory: 268916kb

input:

output:

Yes

result:

ok single line: 'Yes'

Test #80:

score: -11

Time Limit Exceeded

input:

1
120000
11991 50256
11991 84876
11991 45905
11991 51568
11991 91200
11991 42928
11991 113754
8591 11991
11991 39222
11991 41683
11991 14143
11991 39036
11991 17920
11991 31807
11991 94372
11160 11991
11991 91065
11991 40582
11991 70878
11991 41750
11991 33677
11991 108658
11991 28168
11991 39793
11...

output:

result:

Subtask #7:

score: 0

Skipped

Dependency #1:

100%

Accepted

Dependency #2:

100%

Accepted

Dependency #3:

100%

Accepted

Dependency #4:

100%

Accepted

Dependency #5:

100%

Accepted