Submission #1286733

---

Source Code Expand

#include <iostream> 
#include <string> 
#include <vector> 
#include <cmath> 
#include <algorithm> 
#include <cstdlib> 
#include <ctime> 
#include <cstdio> 
#include <functional> 
#include <set> 
#include <sstream> 
#include <cctype>
#include <stack>
#include <queue>
#include <cstring>
#include <map>
#include <list>
#include <cassert>
 
using namespace std; 

const long long INF=1LL<<60;

int main(){

	int n,m;
	cin>>n>>m;

	vector<int> a(m),b(m);
	vector<long long> c(m);
	for(int i=0;i<m;i++){
		cin>>a[i]>>b[i]>>c[i];
		a[i]--,b[i]--;
	}

	vector<long long> d(n,-INF);
	d[0]=0;

	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			d[b[j]]=max(d[b[j]],d[a[j]]+c[j]);
		}
	}

	long long dd=d[n-1];
	for(int j=0;j<m;j++){
		d[b[j]]=max(d[b[j]],d[a[j]]+c[j]);
	}	

	if(dd!=d[n-1]) cout<<"inf"<<endl;
	else cout<<dd<<endl;

	return 0;
}

Submission Info

Judge Result