結果
問題 | No.807 umg tours |
ユーザー | yuliicppy |
提出日時 | 2019-07-01 12:33:02 |
言語 | C++11 (gcc 11.4.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,136 bytes |
コンパイル時間 | 1,009 ms |
コンパイル使用メモリ | 90,720 KB |
最終ジャッジ日時 | 2024-05-02 23:53:23 |
合計ジャッジ時間 | 1,980 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp: In function ‘std::vector<_Tp> dijkstra(WeightedGraph<T>&, int)’: main.cpp:82:20: error: ‘numeric_limits’ was not declared in this scope 82 | const auto INF = numeric_limits< T >::max(); | ^~~~~~~~~~~~~~ main.cpp:82:38: error: expected primary-expression before ‘>’ token 82 | const auto INF = numeric_limits< T >::max(); | ^ main.cpp:82:44: error: no matching function for call to ‘max()’ 82 | const auto INF = numeric_limits< T >::max(); | ~~~~~^~ In file included from /usr/include/c++/11/bits/char_traits.h:39, from /usr/include/c++/11/ios:40, from /usr/include/c++/11/ostream:38, from /usr/include/c++/11/iostream:39, from main.cpp:1: /usr/include/c++/11/bits/stl_algobase.h:254:5: note: candidate: ‘template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&)’ 254 | max(const _Tp& __a, const _Tp& __b) | ^~~ /usr/include/c++/11/bits/stl_algobase.h:254:5: note: template argument deduction/substitution failed: main.cpp:82:44: note: candidate expects 2 arguments, 0 provided 82 | const auto INF = numeric_limits< T >::max(); | ~~~~~^~ In file included from /usr/include/c++/11/bits/char_traits.h:39, from /usr/include/c++/11/ios:40, from /usr/include/c++/11/ostream:38, from /usr/include/c++/11/iostream:39, from main.cpp:1: /usr/include/c++/11/bits/stl_algobase.h:300:5: note: candidate: ‘template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare)’ 300 | max(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/11/bits/stl_algobase.h:300:5: note: template argument deduction/substitution failed: main.cpp:82:44: note: candidate expects 3 arguments, 0 pro
ソースコード
#include <iostream> #include <string> #include <vector> #include <algorithm> #include <stack> #include <queue> #include <cmath> #include <tuple> #include <cstdio> #include <bitset> #include <sstream> #include <iterator> #include <numeric> #include <map> #include <cstring> #include <set> #include <functional> #include <iomanip> using namespace std; #define DEBUG_ //!!提出時にコメントアウト!! #ifdef DEBUG_ #define dump(x) cerr << #x << " = " << (x) << endl; #else #define dump(x) ; #endif #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define SZ(x) ((int)(x).size()) #define pb push_back #define eb emplace_back //#define int long long typedef long long LL; typedef vector<int> VI; typedef vector<LL> VL; typedef vector<VI> VVI; typedef vector<string> VS; typedef pair<int, int> PII; typedef pair<LL, LL> PLL; template <typename T> std::string printVector(const std::vector<T> &data) { std::stringstream ss; std::ostream_iterator<T> out_it(ss, ", "); ss << "["; std::copy(data.begin(), data.end() - 1, out_it); ss << data.back() << "]"; return ss.str(); } const int MOD = 1e9+7; const LL LINF = 1001002003004005006ll; const int INF = 1001001001; template< typename T > struct edge { int src, to; T cost; edge(int to, T cost) : src(-1), to(to), cost(cost) {} edge(int src, int to, T cost) : src(src), to(to), cost(cost) {} edge &operator=(const int &x) { to = x; return *this; } operator int() const { return to; } }; template< typename T > using Edges = vector< edge< T > >; template< typename T > using WeightedGraph = vector< Edges< T > >; using UnWeightedGraph = vector< vector< int > >; template< typename T > using Matrix = vector< vector< T > >; template< typename T > vector< T > dijkstra(WeightedGraph< T > &g, int s) { const auto INF = numeric_limits< T >::max(); vector< T > dist(g.size(), INF); using Pi = pair< T, int >; priority_queue< Pi, vector< Pi >, greater< Pi > > que; dist[s] = 0; que.emplace(dist[s], s); while(!que.empty()) { T cost; int idx; tie(cost, idx) = que.top(); que.pop(); if(dist[idx] < cost) continue; for(auto &e : g[idx]) { auto next_cost = cost + e.cost; if(dist[e.to] <= next_cost) continue; dist[e.to] = next_cost; que.emplace(dist[e.to], e.to); } } return dist; } signed main(int argc, char const *argv[]) { cin.tie(0); ios::sync_with_stdio(false); int N,M; cin >> N >> M; WeightedGraph<LL> g1(N); WeightedGraph<LL> g2(2*N); REP(i,M){ int a,b; LL c; cin >> a >> b >> c; a--; b--; g1[a].eb(b,c); g1[b].eb(a,c); g2[a*2].eb(b*2,c); g2[b*2].eb(a*2,c); g2[a*2+1].eb(b*2+1,c); g2[b*2+1].eb(a*2+1,c); g2[a*2].eb(b*2+1,0); g2[b*2].eb(a*2+1,0); g2[a*2].eb(a*2+1,0); g2[b*2].eb(b*2+1,0); } auto r1 = dijkstra(g1,0); auto r2 = dijkstra(g2,0); REP(i,N){ //if(i == 0){ // cout << 0 << endl; // continue; //} cout << r1[i]+r2[i*2+1] << endl; } }