Submission #2213856


Source Code Expand

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

#define int long long

#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;

template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}

int N;

set<int>G[111111],H[111111];

signed main(){
    scanf("%lld",&N);
    rep(i,N-1){
        int a,b;
        scanf("%lld%lld",&a,&b);
        a--;b--;
        G[a].insert(b);
        G[b].insert(a);
    }

    queue<pint>que;

    rep(i,N-1){
        int c,d;
        scanf("%lld%lld",&c,&d);
        c--;d--;
        H[c].insert(d);
        H[d].insert(c);

        if(G[c].find(d)!=G[c].end())que.push({c,d});
    }

    rep(i,N-1){
        if(que.size()==0){
            cout<<"NO"<<endl;
            return 0;
        }

        int u,v;
        tie(u,v)=que.front();
        que.pop();
        if(G[u].size()+H[u].size()>G[v].size()+H[v].size())swap(u,v);


        for(auto a:G[u]){
            if(H[v].find(a)!=H[v].end()){
                que.push({v,a});
            }
        }
        for(auto a:H[u]){
            if(G[v].find(a)!=G[v].end()){
                que.push({v,a});
            }
        }

        G[u].erase(v);G[v].erase(u);
        H[u].erase(v);H[v].erase(u);

        for(auto a:G[u]){
            G[a].erase(u);
            G[a].insert(v);
            G[v].insert(a);
        }
        for(auto a:H[u]){
            H[a].erase(u);
            H[a].insert(v);
            H[v].insert(a);
        }
    }
    cout<<"YES"<<endl;
    return 0;
}

Submission Info

Submission Time
Task E - Blue and Red Tree
User latte0119
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1789 Byte
Status WA
Exec Time 335 ms
Memory 32000 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:23:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld",&N);
                     ^
./Main.cpp:26:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld%lld",&a,&b);
                                ^
./Main.cpp:36:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld%lld",&c,&d);
                                ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1400
Status
AC × 3
AC × 45
WA × 8
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 5 ms 10624 KB
in10.txt AC 109 ms 29440 KB
in11.txt AC 212 ms 30080 KB
in12.txt AC 196 ms 30080 KB
in13.txt AC 213 ms 30080 KB
in14.txt AC 205 ms 30080 KB
in15.txt AC 214 ms 30080 KB
in16.txt AC 255 ms 30080 KB
in17.txt AC 210 ms 30080 KB
in18.txt AC 228 ms 30080 KB
in19.txt AC 244 ms 30080 KB
in2.txt AC 5 ms 10624 KB
in20.txt AC 215 ms 30080 KB
in21.txt WA 203 ms 29952 KB
in22.txt WA 207 ms 29952 KB
in23.txt WA 230 ms 29952 KB
in24.txt WA 256 ms 29952 KB
in25.txt WA 214 ms 32000 KB
in26.txt WA 255 ms 30080 KB
in27.txt AC 254 ms 30080 KB
in28.txt AC 224 ms 30080 KB
in29.txt AC 210 ms 30080 KB
in3.txt AC 5 ms 10624 KB
in30.txt AC 241 ms 30080 KB
in31.txt AC 335 ms 29696 KB
in32.txt AC 335 ms 29696 KB
in33.txt AC 308 ms 29696 KB
in34.txt AC 323 ms 29696 KB
in35.txt AC 313 ms 29696 KB
in36.txt WA 105 ms 29440 KB
in37.txt AC 309 ms 29696 KB
in38.txt AC 245 ms 31744 KB
in39.txt AC 232 ms 29696 KB
in4.txt AC 112 ms 29440 KB
in40.txt WA 102 ms 29440 KB
in41.txt AC 323 ms 29696 KB
in42.txt AC 313 ms 29696 KB
in43.txt AC 327 ms 29696 KB
in44.txt AC 320 ms 29696 KB
in45.txt AC 327 ms 29696 KB
in46.txt AC 228 ms 29696 KB
in47.txt AC 236 ms 29696 KB
in5.txt AC 105 ms 29440 KB
in6.txt AC 240 ms 29696 KB
in7.txt AC 105 ms 29440 KB
in8.txt AC 111 ms 29440 KB
in9.txt AC 107 ms 29440 KB
sample1.txt AC 5 ms 10624 KB
sample2.txt AC 5 ms 10624 KB
sample3.txt AC 5 ms 10624 KB