Submission #2229491

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <functional>
using namespace std;

#define Rep(b, e, i) for(int i = b; i <= e; i++)
#define rep(n, i) Rep(0, n-1, i)
#define MAX 200000

typedef long long ll;
typedef pair<ll, ll> llP;
typedef pair<int, int> intP;
typedef std::priority_queue<int> IntPrioQueue; //Z->A
typedef std::priority_queue<int, std::vector<int>, std::greater<int> > IntReversePrioQueue; //A->Z

const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1e10;
const int MOD = 1000000007;

const int MAX_E = 2048;
const int MAX_V = 1024;

struct edge {int from, to; ll cost;};

edge es[MAX_E];

ll dis[MAX_V];
int V, E;
//負の閉路が存在すればtrueを返す
bool bellmanford(int s) {
    rep(V, v) dis[v] = INF;
    dis[s] = 0;
    rep(V, i) {
        rep(E, e) {
            edge ne = es[e];
            if (dis[ne.to] > dis[ne.from] + ne.cost) {
                dis[ne.to] = dis[ne.from] + ne.cost;
                if (i == V-1) return true;
            }
        }
    }
    return false;
}
//abc061d
void solve(void){
    cin >> V >> E;
    rep(E, e){
        int a, b;ll c;
        scanf("%d %d %lld\n", &a, &b, &c);
        a--; b--;
        es[e] = edge {a, b, -c};
    }
    if (bellmanford(0)) cout << "inf" << endl;
    else cout << -dis[V-1] << endl;
}

int main(void){
  solve();
  return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘void solve()’:
./Main.cpp:61:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %lld\n", &a, &b, &c);
                                          ^

Judge Result