Submission #3592146

---

Source Code Expand

//
//  abc061d.cpp
//  
//
//  Created by Yoshida Satoshi on 2018/11/13.
//

#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>

#define MAX 2010
#define INF (-3000000000000)

using namespace std;

typedef long long ll;

int main()
{
    int n,m;
    cin>>n>>m;
    int a[MAX],b[MAX];
    ll c[MAX];
    for(int i=0;i<m;i++)
    {
        cin>>a[i]>>b[i]>>c[i];
        a[i]--;b[i]--;
    }
    ll max[MAX];
    
    for(int i=0;i<n;i++) max[i]=INF;
    max[0]=0;
    
    bool flag=false;
    
    for(int i=0;i<2*n;i++)
    {
        for(int j=0;j<m;j++)
        {
            if(max[a[j]]!=INF&&max[a[j]]+c[j]>max[b[j]])
            {
                max[b[j]]=max[a[j]]+c[j];
                if(b[j]==n-1&&i>=n) flag=true;
            }
        }
    }
    
    if(flag) cout<<"inf"<<endl;
    else     cout<<max[n-1]<<endl;
    
    return 0;
}

Submission Info

Judge Result