Submission #1280170

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <map>
#include <vector>
#include <algorithm>


// @author: pashka

const long long INF = (const long long int) 1e18;
using namespace std;

int main() {
    std::ios::sync_with_stdio(false);

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

    vector<int> a(m), b(m), 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);
    for (int i = 0; i < n; i++) {
        d[i] = -INF;
    }
    d[0] = 0;

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

    if (d[n - 1] == INF) {
        cout << "inf" << endl;
    } else {
        cout << d[n - 1] << endl;
    };
    return 0;
}

Submission Info

Judge Result