Submission #1556699

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define _rep(i,n) _repl(i,0,n)
#define rep(...) GET_MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
void _dbg(string){cout<<endl;}
template<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<" = "<<h<<", ";_dbg(s.substr(l+1),t...);}
template<class T,class U> ostream& operator<<(ostream &o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream &o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 112000000012345678LL

template<class T>
bool bellmanFord(const vector<vector<pair<int,T>>> &vec, vector<T> &d, int from=0){
  fill(all(d), INF);
  d[from] = 0;
  int n = d.size();
  rep(_,n){
    bool update = false;
    rep(i,n){
      for(auto &p : vec[i]){
        int to = p.first;
        T nd = d[i] + p.second;
        if(d[to] > nd){
          d[to] = nd;
          update = true;
        }
      }
    }
    if(!update) return true;
  }
  return false;
}


int main(){
  int n,m;
  cin>>n>>m;
  vector<vector<pair<int,long>>> vec(2*n+1);

  vector<int> p(n), q(n);
  rep(i,n) cin>>p[i];
  rep(i,n) cin>>q[i];

  // -p[i] : i*2
  // q[i]  : i*2+1
  // zero  : 2*n

  rep(i,n){
    vec[2*n].pb(mp(2*i, 0));
    vec[2*i].pb(mp(2*n, p[i]));
    vec[2*n].pb(mp(2*i+1, q[i]));
    vec[2*i+1].pb(mp(2*n, 0));
  }

  rep(i,m){
    int x,y,a,b;
    cin>>x>>y>>a>>b;
    x--;y--;
    vec[2*y+1].pb(mp(2*x, -a));
    vec[2*x].pb(mp(2*y+1, b));
  }

  vector<long> dd(2*n+1);

  if(bellmanFord(vec, dd, 2*n)) cout << "yes" << endl;
  else cout << "no" << endl;
// dbg(dd);

  return 0;
}

Submission Info

Judge Result