Submission #1285357

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
const ll INF = 1000000000000000000;
typedef vector<vector<ll> > Matrix;
Matrix d;

void warshall_floyd(int n) {
	rep(i, n) {
		rep(j, n) {
			rep(k, n) {
				d[j][k] = min(d[j][k], d[j][i] + d[i][k]);
			}
		}
	}
}
int main() {
	cin.sync_with_stdio(false);
	int N, M;
	cin >> N >> M;
	d = Matrix(N, vector<ll>(N, INF));
	rep(i, N) {
		d[i][i] = INF;
	}
	ll a, b, c;
	rep(i, M) {
		cin >> a >> b >> c;
		d[a - 1][b - 1] = -c;
	}
	warshall_floyd(N);
	if (d[0][N - 1] < 0) {
		cout << "inf" << endl;
	}
	else {
		cout << -d[0][N - 1] << endl;
	}
	return 0;
}

Submission Info

Judge Result