結果

問題 No.1607 Kth Maximum Card
ユーザー 👑 hos.lyrichos.lyric
提出日時 2021-07-16 22:08:42
言語 D
(dmd 2.109.1)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 2,400 bytes
コンパイル時間 559 ms
コンパイル使用メモリ 116,588 KB
最終ジャッジ日時 2024-06-22 11:45:56
合計ジャッジ時間 1,545 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/algorithm/mutation.d(1469): Error: cannot modify `const` expression `target`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/algorithm/mutation.d(1265): Error: template instance `std.algorithm.mutation.moveEmplaceImpl!(const(int))` error instantiating
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/algorithm/mutation.d(1190):        instantiated from here: `moveImpl!(const(int))`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/container/dlist.d(223):        instantiated from here: `move!(const(int))`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/container/dlist.d(782):        instantiated from here: `createNode!(const(int))`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/container/dlist.d(454):        instantiated from here: `insertAfterNode!(const(int))`
Main.d(58):        instantiated from here: `insertFront!(const(int))`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/algorithm/mutation.d(1267): Error: template instance `std.algorithm.mutation.trustedMoveImpl!(const(int))` error instantiating
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/algorithm/mutation.d(1190):        instantiated from here: `moveImpl!(const(int))`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/container/dlist.d(223):        instantiated from here: `move!(const(int))`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/container/dlist.d(782):        instantiated from here: `createNode!(const(int))`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/container/dlist.d(454):        instantiated from here: `insertAfterNode!(const(int))`
Main.d(58):        instantiated from here: `insertFront!(const(int))`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/container/dlist.d(461): Error: template instance `std.container.dlist.DList!int.DList.insertBeforeNode!(const(int))` error instantiating
Main.d(62):        instantiated from here: `insertBack!(co

ソースコード

diff # 

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, 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; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const M = readInt();
      const K = readInt();
      auto A = new int[M];
      auto B = new int[M];
      auto C = new int[M];
      foreach (i; 0 .. M) {
        A[i] = readInt() - 1;
        B[i] = readInt() - 1;
        C[i] = readInt();
      }
      
      auto G = new int[][N];
      foreach (i; 0 .. M) {
        G[A[i]] ~= i;
        G[B[i]] ~= i;
      }
      
      int lo = -1, hi = C.maxElement;
      for (; lo + 1 < hi; ) {
        const mid = (lo + hi) / 2;
        DList!int que;
        auto dist = new int[N];
        dist[] = N;
        dist[0] = 0;
        que ~= 0;
        for (; !que.empty; ) {
          const u = que.front;
          que.removeFront;
          foreach (i; G[u]) {
            const v = A[i] ^ B[i] ^ u;
            if (C[i] <= mid) {
              if (chmin(dist[v], dist[u])) {
                que.insertFront(v);
              }
            } else {
              if (chmin(dist[v], dist[u] + 1)) {
                que.insertBack(v);
              }
            }
          }
        }
        ((dist[N - 1] < K) ? hi : lo) = mid;
      }
      
      writeln(hi);
    }
  } catch (EOFException e) {
  }
}
0