Submission #1280211

---

Source Code Expand

#include<vector>
#include<cmath>
#include<map>
#include<cstdlib>
#include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<set>
#include<stack>
#include<bitset>
#include<functional>
#include<ctime>
#include<queue>
#include<deque>
#include<complex>
#include<cassert>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long lint;
typedef complex<double> P;
#define mp make_pair
#define fi first
#define se second
typedef pair<int,int> pint;
#define All(s) s.begin(),s.end()
#define rAll(s) s.rbegin(),s.rend()
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
lint dp[1010];
int a[2010],b[2010],c[2010];
int main()
{
	int n,m;lint out=0,inf=1E18+10;
	cin>>n>>m;
	rep(i,m){
		cin>>a[i]>>b[i]>>c[i];
		a[i]--;b[i]--;
	}
	rep(i,1010) dp[i]=-inf;dp[0]=0;
	rep(i,5010){
		int t=0;
		rep(j,m){
			//cout<<a[j]<<' '<<b[i]<<endl;
			if(dp[a[j]]+c[j]>dp[b[j]]){
				dp[b[j]]=dp[a[j]]+c[j];
				if(b[j]==n-1) t=1;
			}
		}
		if(i>4000 && t>0){
			cout<<"inf"<<endl;return 0;
		}
	}
	cout<<dp[n-1]<<endl;
}

Submission Info

Judge Result