結果

問題 No.2354 Poor Sight in Winter
ユーザー 👑 hos.lyric
提出日時 2023-06-16 21:46:51
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 47 ms / 2,000 ms
コード長 2,541 bytes
コンパイル時間 2,002 ms
コンパイル使用メモリ 117,120 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-24 13:40:16
合計ジャッジ時間 3,165 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

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; }
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)); }
enum INF = 10^^9;
void main() {
  try {
    for (; ; ) {
      const N = readInt + 2;
      const K = readInt;
      auto X = new int[N];
      auto Y = new int[N];
      foreach (u; 0 .. N) {
        X[u] = readInt;
        Y[u] = readInt;
      }
      
      auto C = new int[][](N, N);
      foreach (u; 0 .. N) foreach (v; 0 .. N) {
        C[u][v] = abs(X[u] - X[v]) + abs(Y[u] - Y[v]);
      }
      
      int solve(int p) {
        auto dist = new int[N];
        dist[] = INF;
        auto vis = new bool[N];
        dist[0] = 0;
        for (; ; ) {
          int um = -1;
          foreach (u; 0 .. N) if (!vis[u]) {
            if (!~um || dist[um] > dist[u]) {
              um = u;
            }
          }
          assert(~um);
          if (um == 1) {
            debug {
              writefln("solve %s = %s", p, dist[1]);
            }
            return dist[1];
          }
          vis[um] = true;
          foreach (v; 0 .. N) if (!vis[v]) {
            int c;
            if (p) {
              c = (C[um][v] - 1) / p;
            } else {
              if (C[um][v] > 0) continue;
            }
            chmin(dist[v], dist[um] + c);
          }
        }
      }
      
      int lo = -1, hi = C[0][1];
      for (; lo + 1 < hi; ) {
        const mid = (lo + hi) / 2;
        ((solve(mid) <= K) ? hi : lo) = mid;
      }
      writeln(hi);
    }
  } catch (EOFException e) {
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0