Submission #677153

---

Source Code Expand

#include <algorithm>
#include <array>
#include <complex>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

inline bool valid(const int x, const int r) { return 0 <= x && x < r; }

void initIOStream() {
  ios::sync_with_stdio(false); // stdinなどと同期しない
  cin.tie(0); // cinの前にflushしない
  cout.setf(ios::fixed);
  cout.precision(10); // 四捨五入して指定桁数表示
}

typedef pair<ll, ll> P;

const int MAX_N = 100000;
const ll INF = 1LL << 60;

vector<P> G[MAX_N];
vector<P> G2[MAX_N];
ll dist[MAX_N];
ll dist2[MAX_N];

void dijkstra(){
  fill(dist, dist+MAX_N, INF);
  dist[0] = 0;
  priority_queue<P, vector<P>, greater<P> > q;
  q.push(make_pair(0, 0));
  while(!q.empty()){
    auto p = q.top();
    q.pop();
    ll u = p.second;
    if(dist[u] < p.first) continue;
    for(int i = 0; i < G[u].size(); ++i){
      ll v = G[u][i].first;
      ll cost = p.first + G[u][i].second;
      if(dist[v] > cost){
        dist[v] = cost;
        q.push(make_pair(v, dist[v]));
      }
    }
  }
}

void dijkstra2(){
  fill(dist2, dist2+MAX_N, INF);
  dist2[0] = 0;
  priority_queue<P, vector<P>, greater<P> > q;
  q.push(make_pair(0, 0));
  while(!q.empty()){
    auto p = q.top();
    q.pop();
    ll u = p.second;
    if(dist2[u] < p.first) continue;
    for(int i = 0; i < G2[u].size(); ++i){
      ll v = G2[u][i].first;
      ll cost = p.first + G2[u][i].second;
      if(dist2[v] > cost){
        dist2[v] = cost;
        q.push(make_pair(v, dist2[v]));
      }
    }
  }
}

int main() {
  initIOStream();

  ll N, M, T;
  cin >> N >> M >> T;
  vector<ll> A(N);
  for(int i = 0; i < N; ++i) {
    cin >> A[i];
  }
  for(int i = 0; i < M; ++i) {
    ll a, b, c;
    cin >> a >> b >> c;
    --a; --b;
    G[a].emplace_back(b, c);
    G2[b].emplace_back(a, c);
  }
  dijkstra();
  dijkstra2();
  ll ans = 0;
  for(int i = 0; i < N; ++i) {
    ll t = T - (dist[i] + dist2[i]);
    if(t > 0){
      ans = max(ans, A[i] * t);
    }
  }
  cout << ans << endl;
}

Submission Info

Judge Result