Submission #1771606


Source Code Expand

#include<bits/stdc++.h>
using namespace std;

int n,t,w,cnt;
int fa[200010],d[200010];
pair<int,int> q[4000010];
map<int,int> h[200010];

int find(int x)
{return fa[x]==x?x:fa[x]=find(fa[x]);
}

int main()
{int i,j,x,y,k;
 map<int,int>::iterator p;
 
 scanf("%d",&n);
 for(i=1;i<n;i++)
 {	scanf("%d%d",&x,&y);
 	h[x][y]=1;
 	h[y][x]=1;
 	d[x]++;
 	d[y]++;
 }
 t=1;
 w=0;
 for(i=1;i<n;i++)
 {	scanf("%d%d",&x,&y);
 	h[x][y]++;
 	h[y][x]++;
 	d[x]++;
 	d[y]++;
 	if(h[x][y]==2) q[++w]=make_pair(x,y);
 }
 for(i=1;i<=n;i++) fa[i]=i;
 while(t<=w)
 {	x=find(q[t].first);
 	y=find(q[t].second);
 	if(x!=y)
 	{	if(d[x]<d[y]) swap(x,y);
 		h[x][y]-=2;
 		h[y][x]-=2;
 		for(p=h[y].begin();p!=h[y].end();p++)
 		{	if((*p).second==0) continue;
	 		k=(h[x][(*p).first]+=(*p).second);
 			h[(*p).first][x]+=(*p).second;
 			h[(*p).first][y]-=(*p).second;
 			if(k==2)
 				q[++w]=make_pair(x,(*p).first);
 		}
 		h[y].clear();
		d[x]+=d[y]-2;
		fa[y]=x;
		cnt++;
	}
 	t++;
 }
 printf("%s\n",cnt==n-1?"YES":"NO");
 return 0;
}

Submission Info

Submission Time
Task E - Blue and Red Tree
User xhk
Language C++14 (GCC 5.4.1)
Score 1400
Code Size 1072 Byte
Status AC
Exec Time 413 ms
Memory 31872 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:17:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:19:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  { scanf("%d%d",&x,&y);
                       ^
./Main.cpp:28:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  { scanf("%d%d",&x,&y);
                       ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1400 / 1400
Status
AC × 3
AC × 53
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in3.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in4.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
in1.txt AC 6 ms 12544 KB
in10.txt AC 174 ms 31744 KB
in11.txt AC 293 ms 28160 KB
in12.txt AC 386 ms 28288 KB
in13.txt AC 241 ms 28160 KB
in14.txt AC 263 ms 28160 KB
in15.txt AC 233 ms 28160 KB
in16.txt AC 238 ms 28160 KB
in17.txt AC 219 ms 28160 KB
in18.txt AC 236 ms 28160 KB
in19.txt AC 223 ms 28160 KB
in2.txt AC 7 ms 12544 KB
in20.txt AC 261 ms 28160 KB
in21.txt AC 282 ms 28416 KB
in22.txt AC 274 ms 28416 KB
in23.txt AC 339 ms 28544 KB
in24.txt AC 273 ms 28544 KB
in25.txt AC 269 ms 28544 KB
in26.txt AC 296 ms 28160 KB
in27.txt AC 228 ms 28160 KB
in28.txt AC 245 ms 28160 KB
in29.txt AC 258 ms 28160 KB
in3.txt AC 6 ms 12544 KB
in30.txt AC 241 ms 28288 KB
in31.txt AC 328 ms 31872 KB
in32.txt AC 320 ms 31872 KB
in33.txt AC 332 ms 31872 KB
in34.txt AC 351 ms 31872 KB
in35.txt AC 383 ms 31872 KB
in36.txt AC 372 ms 31872 KB
in37.txt AC 362 ms 31872 KB
in38.txt AC 301 ms 31872 KB
in39.txt AC 283 ms 31872 KB
in4.txt AC 208 ms 31744 KB
in40.txt AC 338 ms 31872 KB
in41.txt AC 344 ms 31872 KB
in42.txt AC 320 ms 31872 KB
in43.txt AC 322 ms 31872 KB
in44.txt AC 317 ms 31872 KB
in45.txt AC 413 ms 31872 KB
in46.txt AC 323 ms 31872 KB
in47.txt AC 304 ms 31872 KB
in5.txt AC 152 ms 31744 KB
in6.txt AC 295 ms 31872 KB
in7.txt AC 183 ms 31744 KB
in8.txt AC 170 ms 31744 KB
in9.txt AC 166 ms 31744 KB
sample1.txt AC 6 ms 12544 KB
sample2.txt AC 6 ms 12544 KB
sample3.txt AC 7 ms 12544 KB