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

提出ソース

結果

問題	No.1065 電柱 / Pole (Easy)
ユーザー	ningenMe
提出日時	2020-05-29 21:52:24
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	434 ms / 2,000 ms
コード長	4,592 bytes
コンパイル時間	2,360 ms
コンパイル使用メモリ	203,916 KB
実行使用メモリ	22,592 KB
最終ジャッジ日時	2024-04-23 21:46:02
合計ジャッジ時間	10,794 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	200 ms 13,184 KB
testcase_03	AC	267 ms 21,688 KB
testcase_04	AC	266 ms 21,068 KB
testcase_05	AC	216 ms 21,528 KB
testcase_06	AC	215 ms 21,760 KB
testcase_07	AC	80 ms 8,320 KB
testcase_08	AC	290 ms 22,024 KB
testcase_09	AC	26 ms 6,940 KB
testcase_10	AC	127 ms 11,648 KB
testcase_11	AC	88 ms 8,960 KB
testcase_12	AC	50 ms 7,296 KB
testcase_13	AC	194 ms 14,428 KB
testcase_14	AC	218 ms 16,828 KB
testcase_15	AC	250 ms 18,680 KB
testcase_16	AC	121 ms 11,424 KB
testcase_17	AC	273 ms 19,728 KB
testcase_18	AC	87 ms 9,216 KB
testcase_19	AC	269 ms 19,132 KB
testcase_20	AC	70 ms 7,808 KB
testcase_21	AC	104 ms 10,752 KB
testcase_22	AC	245 ms 17,784 KB
testcase_23	AC	4 ms 6,940 KB
testcase_24	AC	4 ms 6,944 KB
testcase_25	AC	45 ms 7,040 KB
testcase_26	AC	143 ms 12,528 KB
testcase_27	AC	138 ms 12,260 KB
testcase_28	AC	236 ms 18,224 KB
testcase_29	AC	27 ms 6,944 KB
testcase_30	AC	252 ms 19,792 KB
testcase_31	AC	176 ms 15,984 KB
testcase_32	AC	116 ms 11,136 KB
testcase_33	AC	250 ms 21,304 KB
testcase_34	AC	89 ms 9,344 KB
testcase_35	AC	268 ms 19,936 KB
testcase_36	AC	3 ms 6,944 KB
testcase_37	AC	4 ms 6,944 KB
testcase_38	AC	3 ms 6,940 KB
testcase_39	AC	4 ms 6,944 KB
testcase_40	AC	3 ms 6,940 KB
testcase_41	AC	434 ms 22,592 KB
testcase_42	AC	114 ms 9,472 KB
testcase_43	AC	210 ms 13,440 KB
testcase_44	AC	68 ms 7,040 KB
testcase_45	AC	206 ms 13,184 KB
testcase_46	AC	2 ms 6,944 KB
testcase_47	AC	2 ms 6,944 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

//Dijkstra
template<class T> class Dijkstra {
public:
	int N;
	T inf;
	vector<T> cost; 
	vector<vector<pair<T, int>>> edge;

	Dijkstra(const int N, T inf) : N(N), inf(inf),cost(N), edge(N) {
	}

	void make_edge(int from, int to, T w) {
		edge[from].push_back({ w,to });
	}

	void solve(int start) {
		for(int i = 0; i < N; ++i) cost[i] = inf;

		priority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>> pq;
		cost[start] = 0;
		pq.push({ 0,start });

		while (!pq.empty()) {
			T v = pq.top().first;
			int from = pq.top().second;
			pq.pop();
			for (auto u : edge[from]) {
				T w = v + u.first;
				int to = u.second;
				if (w < cost[to]) {
					cost[to] = w;
					pq.push({ w,to });
				}
			}
		}
		return;
	}
};

//verify https://atcoder.jp/contests/abc077/tasks/arc084_b

/*
 * @title Distance
 */
template<class T> class Distance{
public:
    //Euclidean distance
    inline static constexpr T euclid(const T& x1, const T& y1, const T& x2, const T& y2) {
        return sqrt((x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2));
    }
    //Chebyshev distance
    inline static constexpr T chebyshev(T x1, T y1, T x2, T y2) {
        return max(abs(x1 - x2),abs(y1 - y2));
    }
    //Manhattan distance
    inline static constexpr T manhattan(T x1, T y1, T x2, T y2) {
        return abs(x1 - x2)+abs(y1 - y2);
    }
    inline static constexpr T between_point_and_line(const T& x,const T& y,const T& x1,const T& y1,const T& x2,const T& y2){
        return abs((y2 - y1)*x+(x1 - x2)*y-(y2-y1)*x1+(x2-x1)*y1)/sqrt((y2 - y1)*(y2 - y1)+(x1 - x2)*(x1 - x2));
    }
};

int main() {
    int N,M; cin >> N >> M;
    Dijkstra<double> dij(N,LOWINF);
    int s,t; cin >> s >> t; s--,t--;
    vector<double> p(N),q(N); 
    for(int i = 0; i < N; ++i) {
        cin >> p[i] >> q[i];
    }
    for(int i = 0; i < M; ++i) {
        int u,v; cin >> u >> v;
        u--,v--;
        double cost = Distance<double>::euclid(p[u],q[u],p[v],q[v]);
        dij.make_edge(u,v,cost);
        dij.make_edge(v,u,cost);
    }
    dij.solve(s);
    printf("%.10f",dij.cost[t]);    

    return 0;
}

yukicoder

結果

テストケース

ソースコード