# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
376735 | daniel920712 | Mergers (JOI19_mergers) | C++14 | 70 ms | 32252 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <set>
#include <vector>
using namespace std;
set < int > a,b;
set < pair < int , int > > road;
int now=0;
vector < int > Next[500005];
int color[500005];
int deg[500005];
int F(int here,int fa,int x)
{
//if(x==0) a.insert(color[here]);
//else b.insert(color[here]);
for(auto i:Next[here])
{
if(i==fa) continue;
F(i,here,x);
}
}
int F2(int here,int fa,int xx)
{
for(auto i:Next[here])
{
if(i==fa) continue;
if(road.find(make_pair(here,i))!=road.end())
{
now++;
deg[xx]++;
deg[now]++;
F2(i,here,now);
}
else F2(i,here,xx);
}
}
int main()
{
int N,M,i,x,y,con=0,ok=1;
scanf("%d %d",&N,&M);
for(i=1;i<N;i++)
{
scanf("%d %d",&x,&y);
Next[x].push_back(y);
Next[y].push_back(x);
}
for(i=1;i<=N;i++) scanf("%d",&color[i]);
for(i=1;i<=N;i++)
{
for(auto j:Next[i])
{
if(i<j)
{
ok=1;
a.clear();
b.clear();
F(i,j,0);
F(j,i,1);
/*for(auto k:a) if(b.find(k)!=b.end()) ok=0;
for(auto k:b) if(a.find(k)!=a.end()) ok=0;
if(ok)
{
road.insert(make_pair(i,j));
road.insert(make_pair(j,i));
}*/
}
}
}
/*now=0;
F2(1,-1,0);
for(i=0;i<=now;i++)
{
if(deg[i]==1) con++;
}
if(con==1) printf("0\n");
else printf("%d\n",(con+1)/2);*/
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |