Submission #1981994


Source Code Expand

#include<bits/stdc++.h>
#define L long long
#define pb push_back
using namespace std;
int n,p;
vector<int> a,b;
map<L,int> h;
set<int> f[100010];
int main()
{
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	int i,j,k;
	scanf("%d",&n);
	for(i=1;i<=2*n-2;i++)
	  {
	   scanf("%d%d",&j,&k);
	   h[(L)j*n+k]++;
	   h[(L)k*n+j]++;
	   f[j].insert(k);
	   f[k].insert(j);
	   if(h[(L)j*n+k]==2)
	     a.pb(j),b.pb(k);
	  }
	for(i=0;i<a.size();i++)
	  if(h[(L)a[i]*n+b[i]]==2)
	    {
		 p++;
		 if(f[a[i]].size()<f[b[i]].size())
		   swap(a[i],b[i]);
		 while(f[b[i]].size())
		   {
			j=*f[b[i]].begin();
			h[(L)a[i]*n+j]+=h[(L)b[i]*n+j];
			h[(L)j*n+a[i]]+=h[(L)b[i]*n+j];
			h[(L)b[i]*n+j]=h[(L)j*n+b[i]]=0;
			f[a[i]].insert(j);
			f[j].erase(b[i]);
			f[j].insert(a[i]);
			if(h[(L)a[i]*n+j]==2)
			  a.pb(a[i]),b.pb(j);
			f[b[i]].erase(j);
		   }
		}
	if(p==n-1)
	  printf("YES\n");
	else
	  printf("NO\n");
	return 0;
}

Submission Info

Submission Time
Task E - Blue and Red Tree
User fateice
Language C++14 (GCC 5.4.1)
Score 1400
Code Size 985 Byte
Status AC
Exec Time 1411 ms
Memory 57584 KB

Compile Error

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

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 3 ms 4992 KB
in10.txt AC 479 ms 48640 KB
in11.txt AC 1252 ms 50416 KB
in12.txt AC 1214 ms 50416 KB
in13.txt AC 1228 ms 50672 KB
in14.txt AC 1228 ms 50672 KB
in15.txt AC 1141 ms 50416 KB
in16.txt AC 1188 ms 50544 KB
in17.txt AC 1248 ms 50672 KB
in18.txt AC 1241 ms 50800 KB
in19.txt AC 1259 ms 50800 KB
in2.txt AC 3 ms 4992 KB
in20.txt AC 1210 ms 50928 KB
in21.txt AC 1258 ms 51440 KB
in22.txt AC 1222 ms 51056 KB
in23.txt AC 1179 ms 51312 KB
in24.txt AC 1202 ms 51696 KB
in25.txt AC 1223 ms 51824 KB
in26.txt AC 1283 ms 50544 KB
in27.txt AC 1235 ms 50672 KB
in28.txt AC 1204 ms 50928 KB
in29.txt AC 1241 ms 50800 KB
in3.txt AC 3 ms 4992 KB
in30.txt AC 1295 ms 50800 KB
in31.txt AC 1327 ms 55800 KB
in32.txt AC 1259 ms 55800 KB
in33.txt AC 1365 ms 55800 KB
in34.txt AC 1338 ms 55800 KB
in35.txt AC 1411 ms 55800 KB
in36.txt AC 1346 ms 55800 KB
in37.txt AC 1397 ms 57584 KB
in38.txt AC 1260 ms 55800 KB
in39.txt AC 1238 ms 55800 KB
in4.txt AC 474 ms 48640 KB
in40.txt AC 1226 ms 55800 KB
in41.txt AC 1390 ms 55800 KB
in42.txt AC 1274 ms 55792 KB
in43.txt AC 1355 ms 55800 KB
in44.txt AC 1367 ms 55672 KB
in45.txt AC 1267 ms 55672 KB
in46.txt AC 1206 ms 55800 KB
in47.txt AC 1209 ms 55800 KB
in5.txt AC 483 ms 48640 KB
in6.txt AC 1223 ms 55800 KB
in7.txt AC 470 ms 48640 KB
in8.txt AC 459 ms 48640 KB
in9.txt AC 456 ms 48640 KB
sample1.txt AC 3 ms 4992 KB
sample2.txt AC 3 ms 4992 KB
sample3.txt AC 3 ms 4992 KB