Submission #2270832

---

Source Code Expand

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

typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}


int nextInt() { int x; scanf("%d", &x); return x;}

const int MAX_N = 1005;

struct E {
  int to;
  ll w;
};

vector<E> g[MAX_N];

int main2() {
  REP(i, MAX_N) g[i].clear();

  int N = nextInt();
  int M = nextInt();

  int s = N + N;
  REP(i, N) { int p = nextInt(); g[s].push_back({ i, p }); g[i].push_back({s, 0}); }
  REP(i, N) { int q = nextInt(); g[N+i].push_back({ s, q }); g[s].push_back({N+i, 0}); }
  REP(k, M) {
    int x = nextInt() - 1;
    int y = nextInt() - 1;
    int a = nextInt();
    int b = nextInt();
    g[x].push_back({N+y, -a});
    g[N+y].push_back({x, b});
  }
  vector<ll> d(N + N + 1, 0);
  const int V = d.size();

  bool neg_cycle = false;
  REP(step, 2 * V + 10) {
    bool update = false;
    REP(from, V) {
      for (const E e : g[from]) {
        if (d[e.to] > d[from] + e.w) {
          d[e.to] = d[from] + e.w;
          update = true;
        }
      }
    }

    if (!update) {
      break;
    } else { 
      if (step >= 2 * V) { neg_cycle = true; break; }
    }
  }
  cout << (!neg_cycle ? "yes":"no") << endl;
  return 0;
}

int main() {
  for (;!cin.eof();cin>>ws)
    main2();
  return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int nextInt()’:
./Main.cpp:14:39: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 int nextInt() { int x; scanf("%d", &x); return x;}
                                       ^

Judge Result