#488665 (C++17) No.1065 電柱 / Pole (Easy)

提出ソース

結果

問題	No.1065 電柱 / Pole (Easy)
ユーザー	mai
提出日時	2020-05-29 22:00:46
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	166 ms / 2,000 ms
コード長	6,824 bytes
コンパイル時間	2,902 ms
コンパイル使用メモリ	228,612 KB
実行使用メモリ	20,292 KB
最終ジャッジ日時	2024-11-06 04:37:59
合計ジャッジ時間	6,993 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,820 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	74 ms 12,016 KB
testcase_03	AC	84 ms 18,764 KB
testcase_04	AC	81 ms 18,756 KB
testcase_05	AC	49 ms 18,888 KB
testcase_06	AC	49 ms 18,756 KB
testcase_07	AC	15 ms 7,936 KB
testcase_08	AC	51 ms 20,276 KB
testcase_09	AC	6 ms 6,816 KB
testcase_10	AC	24 ms 11,008 KB
testcase_11	AC	17 ms 8,576 KB
testcase_12	AC	10 ms 6,820 KB
testcase_13	AC	56 ms 12,676 KB
testcase_14	AC	80 ms 15,476 KB
testcase_15	AC	98 ms 17,100 KB
testcase_16	AC	37 ms 9,652 KB
testcase_17	AC	107 ms 18,136 KB
testcase_18	AC	24 ms 7,680 KB
testcase_19	AC	104 ms 17,876 KB
testcase_20	AC	22 ms 7,168 KB
testcase_21	AC	29 ms 8,320 KB
testcase_22	AC	90 ms 16,248 KB
testcase_23	AC	2 ms 6,820 KB
testcase_24	AC	2 ms 6,820 KB
testcase_25	AC	9 ms 6,816 KB
testcase_26	AC	42 ms 11,116 KB
testcase_27	AC	42 ms 10,504 KB
testcase_28	AC	87 ms 15,768 KB
testcase_29	AC	8 ms 6,816 KB
testcase_30	AC	101 ms 17,400 KB
testcase_31	AC	67 ms 14,280 KB
testcase_32	AC	35 ms 10,292 KB
testcase_33	AC	100 ms 19,656 KB
testcase_34	AC	27 ms 8,064 KB
testcase_35	AC	100 ms 17,416 KB
testcase_36	AC	2 ms 6,816 KB
testcase_37	AC	3 ms 6,820 KB
testcase_38	AC	2 ms 6,816 KB
testcase_39	AC	2 ms 6,820 KB
testcase_40	AC	2 ms 6,816 KB
testcase_41	AC	166 ms 20,292 KB
testcase_42	AC	30 ms 8,704 KB
testcase_43	AC	65 ms 12,288 KB
testcase_44	AC	18 ms 6,816 KB
testcase_45	AC	62 ms 12,160 KB
testcase_46	AC	2 ms 6,816 KB
testcase_47	AC	2 ms 6,820 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize ("O3")
#include "bits/stdc++.h"

using namespace std;
using ll = long long int;

#define all(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(typename remove_const<typename remove_reference<decltype(l)>::type>::type cnt={};(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const long long MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename T> inline T& chmax(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& chmin(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T, typename Random = decltype(randdev), typename enable_if<is_integral<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_int_distribution<T>(l, h)(rand); }
template<typename T, typename Random = decltype(randdev), typename enable_if<is_floating_point<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_real_distribution<T>(l, h)(rand); }

template <typename I>
struct MyRangeFormat{ I b,e; MyRangeFormat(I _b, I _e):b(_b),e(_e){} };
template<typename I>
static ostream& operator<<(ostream& o, const MyRangeFormat<I>& f) {
  o << "[ "; iterate(i,f.b,f.e) o<<*i<<' ';
  return o << ']';
}
template <typename I>
struct MyMatrixFormat{
  const I& p; long long n, m;
  MyMatrixFormat(const I& _p, long long _n, long long _m):p(_p),n(_n),m(_m){}
};
template<typename I>
static ostream& operator<<(ostream& o, const MyMatrixFormat<I>& f) {
  o<<'\n';
  repeat(i,(f.n)) {
    repeat(j,f.m) o<<f.p[i][j]<<' ';
    o<<'\n';
  }
  return o;
}
struct LOG_t { ~LOG_t() { cout << endl; } };
#define LOG (LOG_t(),cout<<'L'<<__LINE__<<": ")
#define FMTA(m,w) (MyRangeFormat<decltype(m+0)>(m,m+w))
#define FMTR(b,e) (MyRangeFormat<decltype(e)>(b,e))
#define FMTV(v) FMTR(v.begin(),v.end())
#define FMTM(m,h,w) (MyMatrixFormat<decltype(m+0)>(m,h,w))

#if defined(_WIN32) || defined(_WIN64)
#define getc_x _getc_nolock
#define putc_x _putc_nolock
#elif defined(__GNUC__)
#define getc_x getc_unlocked
#define putc_x putc_unlocked
#else
#define getc_x getc
#define putc_x putc
#endif
class MaiScanner {
  FILE* fp_;
  constexpr bool isvisiblechar(char c) noexcept { return (0x21<=(c)&&(c)<=0x7E); }
public:
  inline MaiScanner(FILE* fp):fp_(fp){}
  template<typename T> void input_integer(T& var) noexcept {
    var = 0; T sign = 1;
    int cc = getc_x(fp_);
    for (; cc < '0' || '9' < cc; cc = getc_x(fp_))
      if (cc == '-') sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = getc_x(fp_))
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
  }
  inline int c() noexcept { return getc_x(fp_); }
  template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>
  inline MaiScanner& operator>>(T& var) noexcept { input_integer<T>(var); return *this; }
  inline MaiScanner& operator>>(string& var) {
    int cc = getc_x(fp_);
    for (; !isvisiblechar(cc); cc = getc_x(fp_));
    for (; isvisiblechar(cc); cc = getc_x(fp_))
      var.push_back(cc);
    return *this;
  }
  template<typename IT> inline void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
};
class MaiPrinter {
  FILE* fp_;
public:
  inline MaiPrinter(FILE* fp):fp_(fp){}
  template<typename T>
  void output_integer(T var) noexcept {
    if (var == 0) { putc_x('0', fp_); return; }
    if (var < 0)
      putc_x('-', fp_),
      var = -var;
    char stack[32]; int stack_p = 0;
    while (var)
      stack[stack_p++] = '0' + (var % 10),
      var /= 10;
    while (stack_p)
      putc_x(stack[--stack_p], fp_);
  }
  inline MaiPrinter& operator<<(char c) noexcept { putc_x(c, fp_); return *this; }
  template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>
  inline MaiPrinter& operator<<(T var) noexcept { output_integer<T>(var); return *this; }
  inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putc_x(*(str_p++), fp_); return *this; }
  inline MaiPrinter& operator<<(const string& str) {
    const char* p = str.c_str();
    const char* l = p + str.size();
    while (p < l) putc_x(*p++, fp_);
    return *this;
  }
  template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; }
};
MaiScanner scanner(stdin);
MaiPrinter printer(stdout);

// Edge構造体を定義する無向グラフ
class GraphE {
 public:
  using W_T = double;
  struct Edge {
    int u, v;
    W_T value;
    Edge(int from = 0, int to = 0, W_T value = 0) : u(from), v(to), value(value) {}
    inline int to(int _v) const { return _v == v ? u : v; }
  };
  size_t n;
  vector<vector<int>> vertex_to;
  vector<Edge> edges;

  explicit GraphE(int n = 1) : n(n), vertex_to(n) {}

  inline size_t size() const noexcept { return n; }
  void resize(size_t _n) { vertex_to.resize(n = _n); }
  void connect(int from, int to, W_T val = 0) {
    vertex_to[(size_t)from].push_back((int)edges.size());
    vertex_to[(size_t)to].push_back((int)edges.size());
    edges.emplace_back(from, to, val);
  }
  void connect(vector<Edge>&& es) {
    edges = move(es);
    for (int i = 0; (size_t)i < edges.size(); ++i) {
      vertex_to[edges[i].u].push_back(i);
      vertex_to[edges[i].v].push_back(i);
    }
  }
};

vector<GraphE::W_T> dijkstraEdgeWeighted(const GraphE& graph, int startIndex) {
  using T = GraphE::W_T;
  vector<T> dist(graph.size(), numeric_limits<T>::max());

  priority_queue<pair<T, int>> que;  // <dist, idx>
  que.emplace(0, startIndex);
  dist[startIndex] = 0;

  while (!que.empty()) {
    T d = -que.top().first;
    int v = que.top().second;
    que.pop();
    if (dist[v] < d)
      continue;

    for (int ei : graph.vertex_to[v]) {
      auto e = graph.edges[ei];
      int u = e.to(v);
      if (d + e.value < dist[u]) {
        que.emplace(-(dist[u] = d + e.value), u);
      }
    }
  }
  return move(dist);
}


//

int N, M;
int start, goal;
array<int, 2> P[200010];

//




int main() {
  scanner >> N >> M >> start >> goal;
  --start; --goal;
  repeat(i, N) {
    scanner >> P[i][0] >> P[i][1];
  }
  GraphE graph(N);
  graph.edges.reserve(M);
  repeat(i, M) {
    int a, b; scanner >> a >> b; --a; --b;
    graph.connect(a, b, hypot(P[a][0]-P[b][0], P[a][1]-P[b][1]));
  }
  auto res = dijkstraEdgeWeighted(graph, start);
  printf("%.10f", res[goal]);
  
  return 0;
}

yukicoder

結果

テストケース

ソースコード