Submission #1275376

---

Source Code Expand

#include <cstdio>
#include <vector>
#include <algorithm>
#define repeat(i,n) for (int i = 0; (i) < int(n); ++(i))
#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
using namespace std;
template <class T> inline void setmax(T & a, T const & b) { a = max(a, b); }
template <class T> inline void setmin(T & a, T const & b) { a = min(a, b); }
template <typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }
int main() {
    // input
    int n, s; scanf("%d%d", &n, &s); -- s;
    vector<int> l(n), r(n); repeat (i,n) scanf("%d%d", &l[i], &r[i]);
    auto w = vectors(n, n, int()); repeat (i,n) repeat (j,n) scanf("%d", &w[i][j]);
    // compute
    // // Warshall Floyd
    repeat (k,n) {
        repeat (i,n) {
            repeat (j,n) {
                setmin(w[i][j], w[i][k] + w[k][j]);
            }
        }
    }
    // // dp
    vector<int> dp(n);
    repeat (i,n) {
        if (w[s][i] <= r[i]) {
            dp[i] = r[i] - max(l[i], w[s][i]);
        }
    }
    repeat (k,n*3+300) {
        repeat (i,n) {
            repeat (j,n) {
                if (r[i] + w[i][j] <= r[j]) {
                    setmax(dp[j], dp[i] + r[j] - max(l[j], r[i] + w[i][j]));
                }
            }
        }
    }
    // output
    int result = *whole(max_element, dp);
    printf("%d\n", result);
    return 0;
}

Submission Info

Judge Result