結果

問題 No.416 旅行会社
ユーザー 👑 hos.lyric
提出日時 2019-01-19 16:25:28
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 518 ms / 4,000 ms
コード長 2,499 bytes
コンパイル時間 1,120 ms
コンパイル使用メモリ 136,720 KB
実行使用メモリ 30,104 KB
最終ジャッジ日時 2024-06-13 03:19:17
合計ジャッジ時間 8,481 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens
    .popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }
void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }
int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) 
    >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }
int N, M, Q;
int[] A, B;
int[] C, D;
int[] J;
int[][] G;
void main() {
  try {
    for (; ; ) {
      N = readInt();
      M = readInt();
      Q = readInt();
      A = new int[M];
      B = new int[M];
      foreach (i; 0 .. M) {
        A[i] = readInt() - 1;
        B[i] = readInt() - 1;
      }
      C = new int[Q];
      D = new int[Q];
      foreach (j; 0 .. Q) {
        C[j] = readInt() - 1;
        D[j] = readInt() - 1;
      }
      
      long encode(int u, int v) {
        return cast(long)(u) << 32 | v;
      }
      int[long] js;
      foreach (j; 0 .. Q) {
        js[encode(C[j], D[j])] = j;
      }
      J = new int[M];
      G = new int[][N];
      foreach (i; 0 .. M) {
        J[i] = js.get(encode(A[i], B[i]), Q);
        G[A[i]] ~= i;
        G[B[i]] ~= i;
      }
      
      auto q = BinaryHeap!(Array!(Tuple!(int, int)))();
      auto d = new int[N];
      d[] = -1;
      d[0] = Q;
      q.insert(tuple(Q, 0));
      for (; !q.empty; ) {
        const c = q.front[0];
        const u = q.front[1];
        q.removeFront;
        if (d[u] == c) {
          foreach (i; G[u]) {
            int cc = min(c, J[i]);
            int v = A[i] ^ B[i] ^ u;
            if (d[v] < cc) {
              d[v] = cc;
              q.insert(tuple(cc, v));
            }
          }
        }
      }
      foreach (u; 1 .. N) {
        writeln((d[u] >= Q) ? -1 : (d[u] + 1));
      }
    }
  } catch (EOFException e) {
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0