結果

問題 No.1069 電柱 / Pole (Hard)
コンテスト
ユーザー ei1333333
提出日時 2020-05-29 22:51:21
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 154 ms / 2,000 ms
コード長 6,737 bytes
コンパイル時間 3,357 ms
コンパイル使用メモリ 227,420 KB
最終ジャッジ日時 2025-01-10 18:08:05
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 79
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

#include <bits/stdc++.h>

using namespace std;
using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

template< typename T = int >
struct Edge {
  int from, to;
  T cost;
  int idx;

  Edge() = default;

  Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}

  operator int() const { return to; }
};

template< typename T = int >
struct Graph {
  vector< vector< Edge< T > > > g;
  int es;

  Graph() = default;

  explicit Graph(int n) : g(n), es(0) {}

  size_t size() const {
    return g.size();
  }

  void add_directed_edge(int from, int to, T cost = 1) {
    g[from].emplace_back(from, to, cost, es++);
  }

  void add_edge(int from, int to, T cost = 1) {
    g[from].emplace_back(from, to, cost, es);
    g[to].emplace_back(to, from, cost, es++);
  }

  void read(int M, int padding = -1, bool weighted = false, bool directed = false) {
    for(int i = 0; i < M; i++) {
      int a, b;
      cin >> a >> b;
      a += padding;
      b += padding;
      T c = T(1);
      if(weighted) cin >> c;
      if(directed) add_directed_edge(a, b, c);
      else add_edge(a, b, c);
    }
  }
};

template< typename T = int >
using Edges = vector< Edge< T > >;

int main() {
  int N, M, K;
  cin >> N >> M >> K;
  int X, Y;
  cin >> X >> Y;
  --X, --Y;
  vector< int > P(N), Q(N);
  for(int i = 0; i < N; i++) {
    cin >> P[i] >> Q[i];
  }
  Graph< double > g(N);
  vector< int > x(M * 2), y(M * 2);
  for(int i = 0; i < M; i++) {
    int a, b;
    cin >> a >> b;
    --a, --b;
    g.add_directed_edge(a, b, hypot(P[a] - P[b], Q[a] - Q[b]));
    x[i] = a, y[i] = b;
  }
  for(int i = 0; i < M; i++) {
    int a = x[i], b = y[i];
    x[i + M] = b, y[i + M] = a;
    g.add_directed_edge(b, a, hypot(P[a] - P[b], Q[a] - Q[b]));
  }

  vector< vector< int > > A;
  set< pair< double, vector< int > > > B;

  vector< int > pre, epre;
  auto restore = [&]() {
    int cur = Y;
    vector< int > tap;
    while(cur != -1) {
      if(~epre[cur])
        tap.emplace_back(epre[cur]);
      cur = pre[cur];
    }
    reverse(begin(tap), end(tap));
    return tap;
  };

  {
    const auto INF = numeric_limits< double >::max();
    vector< double > dist(g.size(), INF);
    using Pi = pair< double, int >;
    priority_queue< Pi, vector< Pi >, greater<> > que;
    dist[X] = 0;
    pre.assign(g.size(), -1);
    epre.assign(g.size(), -1);
    que.emplace(dist[X], X);
    while(!que.empty()) {
      double cost;
      int idx;
      tie(cost, idx) = que.top();
      que.pop();
      if(dist[idx] < cost) continue;
      for(auto &e : g.g[idx]) {
        auto next_cost = cost + e.cost;
        if(dist[e.to] <= next_cost) continue;
        dist[e.to] = next_cost;
        pre[e.to] = idx;
        epre[e.to] = e.idx;
        que.emplace(dist[e.to], e.to);
      }
    }
    A.emplace_back(restore());

    cout << dist[Y] << "\n";
  }

  for(int i = 1; i < K; i++) {
    auto &d = A.back();
    vector< int > candidate(A.size());
    iota(begin(candidate), end(candidate), 0);

    const auto INF = numeric_limits< double >::max();
    vector< double > dist2(g.size(), INF);
    dist2[X] = 0;
    vector< int > pre2, epre2;
    pre2.assign(g.size(), -1);
    epre2.assign(g.size(), -1);

    int base = X;

    for(int j = 0; j < d.size(); j++) {


      set< int > dame;
      for(auto &k : candidate) {
        if(j < A[k].size()) dame.emplace(A[k][j]);
      }

      auto dist = dist2;
      pre = pre2;
      epre = epre2;

      using Pi = pair< double, int >;
      priority_queue< Pi, vector< Pi >, greater<> > que;
      que.emplace(dist[base], base);
      while(!que.empty()) {
        double cost;
        int idx;
        tie(cost, idx) = que.top();
        que.pop();
        if(dist[idx] < cost) continue;
        if(idx == Y) {
          auto U = restore();
          bool ok = true;
          for(auto &p : A) ok &= U != p;
          if(ok) B.emplace(dist[Y], restore());
          break;
        }
        for(auto &e : g.g[idx]) {
          auto next_cost = cost + e.cost;
          if(dame.count(e.idx)) continue;
          if(dist[e.to] <= next_cost) continue;
          dist[e.to] = next_cost;
          pre[e.to] = idx;
          epre[e.to] = e.idx;
          que.emplace(dist[e.to], e.to);
        }
      }

      dist2[y[d[j]]] = dist2[x[d[j]]] + hypot(P[x[d[j]]] - P[y[d[j]]], Q[x[d[j]]] - Q[y[d[j]]]);
      pre2[y[d[j]]] = x[d[j]];
      epre2[y[d[j]]] = d[j];
      base = y[d[j]];

      vector< int > accept;
      for(auto &k : candidate) {
        if(j < A[k].size() && A[k][j] == d[j]) accept.emplace_back(k);
      }
      accept.swap(candidate);
    }

    if(B.size()) {
      A.emplace_back(B.begin()->second);
      cout << B.begin()->first << "\n";
      B.erase(B.begin());
    } else {
      cout << -1 << "\n";
    }
  }
}
0