Submission #2831470


Source Code Expand

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

struct UnionFind{
  Int n;
  vector<Int> r,p;
  UnionFind(){}
  UnionFind(Int sz):n(sz),r(sz,1),p(sz,0){iota(p.begin(),p.end(),0);}
  Int find(Int x){
    return (x==p[x]?x:p[x]=find(p[x]));
  }
  bool same(Int x,Int y){
    return find(x)==find(y);
  }
  void unite(Int x,Int y){
    x=find(x);y=find(y);
    if(x==y) return;
    r[x]+=r[y];
    p[y]=x;
  }
};

//INSERT ABOVE HERE
signed main(){
  Int n;
  cin>>n;
  
  vector<set<Int> > G(n),H(n);
  for(Int i=1;i<n;i++){
    Int x,y;
    cin>>x>>y;
    x--;y--;
    G[x].emplace(y);
    G[y].emplace(x);
  }
  using P = pair<Int, Int>;
  queue<P> q;
  for(Int i=1;i<n;i++){
    Int x,y;
    cin>>x>>y;
    x--;y--;
    if(G[x].count(y)) q.emplace(x,y);
    H[x].emplace(y);
    H[y].emplace(x);
  }

  UnionFind uf(n);
  while(!q.empty()){
    Int x,y;
    tie(x,y)=q.front();q.pop();
    if(uf.same(x,y)) continue;
    x=uf.find(x);y=uf.find(y);
    
    uf.unite(x,y);
    
    
    if(H[x].size()<H[y].size()) swap(x,y);
    for(auto z:H[y]){
      if(G[x].count(z)) q.emplace(x,z);
      H[x].emplace(z);
      H[z].emplace(x);
    }
    
    if(G[x].size()<G[y].size()) swap(x,y);
    for(auto z:G[y]){
      if(H[x].count(z)) q.emplace(x,z);
      G[x].emplace(z);
      G[z].emplace(x);
    }
  }
  cout<<(uf.r[uf.find(0)]==n?"YES":"NO")<<endl;
  return 0;
}

Submission Info

Submission Time
Task E - Blue and Red Tree
User beet
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1463 Byte
Status WA
Exec Time 361 ms
Memory 40320 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1400
Status
AC × 1
WA × 2
AC × 24
WA × 29
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 1 ms 256 KB
in10.txt AC 220 ms 29952 KB
in11.txt WA 348 ms 40320 KB
in12.txt WA 328 ms 40192 KB
in13.txt WA 307 ms 40192 KB
in14.txt WA 295 ms 40064 KB
in15.txt WA 308 ms 40192 KB
in16.txt WA 331 ms 40192 KB
in17.txt WA 361 ms 40320 KB
in18.txt WA 330 ms 40320 KB
in19.txt WA 296 ms 40192 KB
in2.txt WA 1 ms 256 KB
in20.txt WA 292 ms 40192 KB
in21.txt AC 274 ms 37888 KB
in22.txt AC 307 ms 37760 KB
in23.txt AC 321 ms 37760 KB
in24.txt AC 255 ms 37760 KB
in25.txt AC 291 ms 37760 KB
in26.txt AC 309 ms 38400 KB
in27.txt WA 331 ms 38400 KB
in28.txt WA 273 ms 38400 KB
in29.txt WA 272 ms 38400 KB
in3.txt AC 1 ms 256 KB
in30.txt WA 265 ms 38400 KB
in31.txt WA 186 ms 29952 KB
in32.txt WA 231 ms 29952 KB
in33.txt WA 187 ms 29952 KB
in34.txt WA 189 ms 29952 KB
in35.txt WA 217 ms 29952 KB
in36.txt WA 182 ms 29952 KB
in37.txt WA 194 ms 29952 KB
in38.txt WA 224 ms 30208 KB
in39.txt WA 183 ms 29952 KB
in4.txt AC 197 ms 29952 KB
in40.txt WA 224 ms 30080 KB
in41.txt AC 195 ms 29952 KB
in42.txt AC 209 ms 29952 KB
in43.txt AC 190 ms 29952 KB
in44.txt AC 226 ms 29952 KB
in45.txt AC 191 ms 29952 KB
in46.txt AC 186 ms 29952 KB
in47.txt AC 218 ms 30080 KB
in5.txt AC 200 ms 29952 KB
in6.txt AC 234 ms 29952 KB
in7.txt AC 232 ms 29952 KB
in8.txt AC 231 ms 29952 KB
in9.txt AC 192 ms 29952 KB
sample1.txt WA 1 ms 256 KB
sample2.txt WA 1 ms 256 KB
sample3.txt AC 1 ms 256 KB