Submission #934933

---

Source Code Expand

import java.util.ArrayList;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.function.BiFunction;

public class Main {
  Scanner sc = new Scanner(System.in);

  public static void main(String[] args) {
    new Main().run();
  }

  class Edge {
    int to;
    int cost;
  }

  int n, m, t;
  ArrayList<ArrayList<Edge>> list;
  ArrayList<ArrayList<Edge>> rev;

  long[] dijkstra(int atom) {
    long[] ret = new long[n + 1];
    Arrays.fill(ret, 1L << 56);
    PriorityQueue<Integer> queue = new PriorityQueue<>((a, b) -> Long.compare(ret[a], ret[b]));
    ret[atom] = 0;
    queue.add(atom);
    boolean[] done = new boolean[n + 1];
    while (queue.size() > 0) {
      int id = queue.poll();
      if (done[id]) {
        continue;
      }
      done[id] = true;
      for (Edge next : list.get(id)) {
        if (ret[next.to] > ret[id] + next.cost) {
          ret[next.to] = ret[id] + next.cost;
          queue.add(next.to);
        }
      }
    }
    return ret;
  }

  long[] to1;

  long[] dijkstra2(int atom) {
    long[] ret = new long[n + 1];
    Arrays.fill(ret, 1L << 60);
    PriorityQueue<Integer> queue = new PriorityQueue<>((a, b) -> Long.compare(ret[a], ret[b]));
    ret[atom] = 0;
    queue.add(atom);
    boolean[] done = new boolean[n + 1];
    while (queue.size() > 0) {
      int id = queue.poll();
      if (done[id]) {
        continue;
      }
      done[id] = true;
      for (Edge next : rev.get(id)) {
        if (ret[next.to] > ret[id] + next.cost) {
          ret[next.to] = ret[id] + next.cost;
          queue.add(next.to);
        }
      }
    }
    return ret;
  }

  void run() {
    n = ni();
    m = ni();
    t = ni();
    int[] A = new int[n + 1];
    for (int i = 1; i <= n; ++i) {
      A[i] = ni();
    }
    list = new ArrayList<>();
    for (int i = 0; i <= n; ++i) {
      list.add(new ArrayList<>());
    }
    rev = new ArrayList<>();
    for (int i = 0; i <= n; ++i) {
      rev.add(new ArrayList<>());
    }
    for (int i = 0; i < m; ++i) {
      int a = ni();
      int b = ni();
      int c = ni();
      Edge e = new Edge();
      e.to = b;
      e.cost = c;
      list.get(a).add(e);
      Edge r = new Edge();
      r.to = a;
      r.cost = c;
      rev.get(b).add(r);
    }

    long[] from1 = dijkstra(1);
    long[] to1 = dijkstra2(1);

    long max = 0;
    for (int i = 1; i <= n; ++i) {
      long now = Math.min(t, from1[i] + to1[i]);
      max = Math.max(max, (t - now) * A[i]);
    }
    System.out.println(max);
  }

  int ni() {
    return Integer.parseInt(sc.next());
  }

  void debug(Object... os) {
    System.err.println(Arrays.deepToString(os));
  }

  class BIT<T> {
    int n;
    ArrayList<T> bit;
    BiFunction<T, T, T> bif;

    BIT(int n, BiFunction<T, T, T> bif, T defaultValue) {
      this.n = n;
      bit = new ArrayList<>(n + 1);
      for (int i = 0; i < n + 1; ++i) {
        bit.add(defaultValue);
      }
      this.bif = bif;
    }

    void update(int i, T v) {
      for (int x = i; x <= n; x += x & -x) {
        bit.set(x, bif.apply(bit.get(x), v));
      }
    }

    T reduce(int i, T defaultValue) {
      T ret = defaultValue;
      for (int x = i; x > 0; x -= x & -x) {
        ret = bif.apply(ret, bit.get(x));
      }
      return ret;
    }
  }

}

Submission Info

Judge Result