Submission #1654454

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;

#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define chmin(x,v) x = min(x, v)
#define chmax(x,v) x = max(x, v)

const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);

template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
    each(x,vec) is >> x;
    return is;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
    rep(i,vec.size()) {
        if (i) os << " ";
        os << vec[i];
    }
    return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector< vector<T> >& vec) {
    rep(i,vec.size()) {
        if (i) os << endl;
        os << vec[i];
    }
    return os;
}
bool solve() {
    ll n, m; cin >> n >> m;
    vector<ll> p(n), q(n); cin >> p >> q;
    vector<ll> X(m), Y(m), a(m), b(m);
    rep(i, m) {
        cin >> X[i] >> Y[i] >> a[i] >> b[i];
        --X[i], --Y[i];
    }
    ll s = 2*n;
    ll V = 2*n+1;
    vector<vector<P>> G(V);
    rep(i, n) G[s].pb(P(i, p[i]));
    rep(i, n) G[s].pb(P(n+i, q[i]));
    rep(i, m) {
        G[X[i]].pb(P(n+Y[i], -a[i]));
        G[n+Y[i]].pb(P(X[i], b[i]));
    }
    vector<ll> dist(V, linf);
    dist[s] = 0;
    rep(t, V+1) {
        bool is_update = false;
        rep(i, V) each(p, G[i]) {
            if (dist[i] == linf) continue;
            if (dist[i]+p.second < dist[p.first]) {
                dist[p.first] = dist[i]+p.second;
                is_update = true;
            }
        }
        if (!is_update) break;
        if (t == V) return false;
    }
    // cout << dist << endl;
    rep(i, n) {
        // xi >= 0
        if (dist[i] < 0) return false;
        // yi <= 0
        if (dist[n+i] > 0) return false;
    }
    return true;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    if (solve()) {
        cout << "yes" << endl;
    }
    else {
        cout << "no" << endl;
    }
}

Submission Info

Judge Result