Submission #17634368

---

Source Code Expand

// {{{ Boilerplate Code <--------------------------------------------------
// vim:filetype=cpp:foldmethod=marker:foldmarker={{{,}}}

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>

#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define ALL(A)     (A).begin(), (A).end()

using namespace std;

// }}}


long long traverse(const int N, vector<long long> &a, const vector<long long> &b, vector<set<int> > &next,vector<int> &visited,int target) {
        long long ret=b[target]-a[target];
        for(auto it=next[target].begin();it!=next[target].end();++it){
                int t=*it;

                if(visited[t]){
                        continue;
                }
                visited[t]=1;
                ret += traverse(N,a,b,next,visited,t);
        }
        return ret;
}

int solve(const int N, vector<long long> &a, const vector<long long> &b, vector<set<int> > &next) {
        vector<int> visited;
        FOR(i,0,N) visited.push_back(0);

        FOR(i,0,N){
                if(visited[i]==0){
                        visited[i]=1;
                        long long res = traverse(N,a,b,next,visited,i);
                        if (res!=0LL){
                                return 0;
                        }
                }
        }
        return 1;

}

int main(){
        int N,M;
        cin>>N>>M;

        vector<long long> a,b;

        FOR(i,0,N){
                long long tmp;
                cin>>tmp;
                a.push_back(tmp);
        }
        FOR(i,0,N){
                long long tmp;
                cin>>tmp;
                b.push_back(tmp);
        }

        vector <set<int> > next;
        FOR(i,0,N){
                next.push_back(set<int>());
        }

        FOR(i,0,M){
                int c,d;
                cin>>c>>d;
                --c;--d;
                next[c].insert(d);
                next[d].insert(c);
        }

        cout<<(solve(N,a,b,next)?"Yes":"No")<<endl;
}

Submission Info

Judge Result