Submission #80023
ソースコード
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 | //line 1 "answer.cpp" #if !__INCLUDE_LEVEL__ #include __FILE__ int main() { ll n,m,s,g; input(n,m,s,g); --s; --g; vi from(m), to(m); vl cost(m); rep(i, m) input(from[i], to[i], cost[i]); --from; --to; Graph gi(n, from, to, cost, true ); vl min_cost; vi prev; dijkstra(gi, s, min_cost, prev, INFL); print(min_cost[g]); vi path; path.push_back(g); while (g != s) { g = prev[g]; path.push_back(g); } reverse(all(path)); ++path; print(path); } #else //line 2 "/home/seekworser/.cpp_lib/competitive_library/competitive/std/std.hpp" #include <bits/stdc++.h> #ifndef LOCAL_TEST #pragma GCC target ("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #endif // LOCAL_TEST using namespace std; using std::cout; // shorten typenames using ll = long long ; using pii = pair< int , int >; using pll = pair<ll, ll>; using vi = vector< int >; using vvi = vector<vi>; using vvvi = vector<vvi>; using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vb = vector< bool >; using vvb = vector<vb>; using vvvb = vector<vvb>; using vc = vector< char >; using vvc = vector<vc>; using vvvc = vector<vvc>; using vd = vector< double >; using vvd = vector<vd>; using vvvd = vector<vvd>; using vs = vector<string>; using vvs = vector<vector<string>>; using vvvs = vector<vector<vector<string>>>; template < typename T> vector<vector<T>> vv( int h, int w, T val = T()) { return vector(h, vector<T>(w, val)); } template < typename T> vector<vector<vector<T>>> vvv( int h1, int h2, int h3, T val = T()) { return vector(h1, vector(h2, vector<T>(h3, val))); } template < typename T> vector<vector<vector<vector<T>>>> vvvv( int h1, int h2, int h3, int h4, T val = T()) { return vector(h1, vector(h2, vector(h3, vector<T>(h4, val)))); } template < class T> using priority_queue_min = priority_queue<T, vector<T>, greater<T>>; // define CONSTANTS constexpr double PI = 3.14159265358979323; constexpr int INF = 100100111; constexpr ll INFL = 3300300300300300491LL; float EPS = 1e-8; double EPSL = 1e-10; template < typename T> bool eq( const T x, const T y) { return x == y; } template <> bool eq< double >( const double x, const double y) { return ( abs (x - y) < EPSL * x || abs (x - y) < EPSL); } template <> bool eq< float >( const float x, const float y) { return abs (x - y) < EPS * x; } template < typename T> bool neq( const T x, const T y) { return !(eq<T>(x, y)); } template < typename T> bool ge( const T x, const T y) { return (eq<T>(x, y) || (x > y)); } template < typename T> bool le( const T x, const T y) { return (eq<T>(x, y) || (x < y)); } template < typename T> bool gt( const T x, const T y) { return !(le<T>(x, y)); } template < typename T> bool lt( const T x, const T y) { return !(ge<T>(x, y)); } constexpr int MODINT998244353 = 998244353; constexpr int MODINT1000000007 = 1000000007; // fasten io struct Nyan { Nyan() { cin.tie(nullptr); ios::sync_with_stdio( false ); cout << fixed << setprecision(18); } } nyan; // define macros #define all(a) (a).begin(), (a).end() #define sz(x) ((ll)(x).size()) #define rep1(n) for(ll dummy_iter = 0LL; dummy_iter < n; ++dummy_iter) // 0,1,...,n-1 #define rep2(i, n) for(ll i = 0LL, i##_counter = 0LL; i##_counter < ll(n); ++(i##_counter), (i) = i##_counter) // i=0,1,...,n-1 #define rep3(i, s, t) for(ll i = ll(s), i##_counter = ll(s); i##_counter < ll(t); ++(i##_counter), (i) = (i##_counter)) // i=s,s+1,...,t-1 #define rep4(i, s, t, step) for(ll i##_counter = step > 0 ? ll(s) : -ll(s), i##_end = step > 0 ? ll(t) : -ll(t), i##_step = abs(step), i = ll(s); i##_counter < i##_end; i##_counter += i##_step, i = step > 0 ? i##_counter : -i##_counter) // i=s,s+step,...,<t #define overload4(a, b, c, d, e, ...) e #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define repe(a, v) for(auto& a : (v)) // iterate over all elements in v #define smod(n, m) ((((n) % (m)) + (m)) % (m)) #define sdiv(n, m) (((n) - smod(n, m)) / (m)) #define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} int Yes( bool b= true ) { cout << (b ? "Yes\n" : "No\n" ); return 0; }; int YES( bool b= true ) { cout << (b ? "YES\n" : "NO\n" ); return 0; }; int No( bool b= true ) { return Yes(!b);}; int NO( bool b= true ) { return YES(!b);}; template < typename T, size_t N> T max(array<T, N>& a) { return *max_element(all(a)); }; template < typename T, size_t N> T min(array<T, N>& a) { return *min_element(all(a)); }; template < typename T> T max(vector<T>& a) { return *max_element(all(a)); }; template < typename T> T min(vector<T>& a) { return *min_element(all(a)); }; template < typename T> vector<T> vec_slice( const vector<T>& a, int l, int r) { vector<T> rev; rep(i, l, r) rev.push_back(a[i]); return rev; }; template < typename T> T sum(vector<T>& a, T zero = T(0)) { T rev = zero; rep(i, sz(a)) rev += a[i]; return rev; }; template < typename T> bool in_range( const T& val, const T& s, const T& t) { return s <= val && val < t; }; template < class T> inline vector<T>& operator--(vector<T>& v) { repe(x, v) --x; return v; } template < class T> inline vector<T>& operator++(vector<T>& v) { repe(x, v) ++x; return v; } ll powm(ll a, ll n, ll mod=INFL) { ll res = 1; while (n > 0) { if (n & 1) res = (res * a) % mod; if (n > 1) a = (a * a) % mod; n >>= 1; } return res; } ll sqrtll(ll x) { assert (x >= 0); ll rev = sqrt (x); while (rev * rev > x) --rev; while ((rev+1) * (rev+1)<=x) ++rev; return rev; } template < class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true ; } return false ; } template < class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true ; } return false ; } int digit(ll x, int d=10) { int rev=0; while (x > 0) { rev++; x /= d;}; return rev; } /** * @brief std.hpp * @docs docs/std/std.md */ //line 3 "/home/seekworser/.cpp_lib/competitive_library/competitive/graph/graph.hpp" template < class Cost> struct Graph{ public : struct Edge { int to; Cost cost; Edge() {}; Edge( int _to, Cost _cost) : to(_to), cost(_cost) {}; }; struct AdjacencyListRange{ using iterator = typename std::vector<Edge>::const_iterator; iterator begi, endi; iterator begin() const { return begi; } iterator end() const { return endi; } int size() const { return ( int )distance(begi, endi); } const Edge& operator[]( int i) const { return begi[i]; } }; private : public : vector<Edge> E; vector< int > I; int n; Graph() : n(0) {} Graph( int _n) : n(_n) {} Graph( int _n, const vector< int >& from, vector< int >& to, vector<Cost>& cost, bool rev = false ) : n(_n) { vector< int > buf(n+1, 0); for ( int i=0; i<( int )from.size(); i++){ ++buf[from[i]]; if (rev) ++buf[to[i]]; } for ( int i=1; i<=_n; i++) buf[i] += buf[i-1]; E.resize(buf[n]); for ( int i=( int )from.size()-1; i>=0; i--){ int u = from[i]; int v = to[i]; Cost c = cost[i]; E[--buf[u]] = Edge(v, c); if (rev) E[--buf[v]] = Edge(u, c); } I = move(buf); } AdjacencyListRange operator[]( int u) const { return AdjacencyListRange{ E.begin() + I[u], E.begin() + I[u+1] }; } int num_vertices() const { return n; } int size() const { return num_vertices(); } int num_edges() const { return E.size(); } Graph<Cost> reversed_edges() const { Graph<Cost> res; int _n = res.n = n; vi buf(n+1, 0); for (auto v : E) ++buf[v.to]; for ( int i=1; i<=n; i++) buf[i] += buf[i-1]; res.E.resize(buf[n]); for ( int u=0; u<n; u++) for (auto v : operator[](u)) res.E[--buf[v.to]] = {u, v.cost}; res.I = std::move(buf); return res; } }; template < class T> ostream& operator<<(ostream& os, Graph<T> g) { bool first = true ; rep(i, g.n) repe(e, g[i]) { if (first) first = false ; else os << endl; os << i << "->" << e.to << ": " << e.cost; } return os; } /** * @brief graph.hpp * @docs docs/graph/graph.md */ //line 4 "/home/seekworser/.cpp_lib/competitive_library/competitive/graph/dijkstra.hpp" template < class Cost> void dijkstra( const Graph<Cost>& G, int start, vector<Cost> &min_cost, vector< int > &prev, Cost inf=INF, Cost identity=0){ priority_queue<pair<Cost, int >, vector<pair<Cost, int >>, greater<pair<Cost, int >>> que; min_cost = vector<Cost>(G.n, inf); min_cost[start] = identity; prev = vector< int >(G.n); que.emplace(identity, start); while (que.size()){ Cost d = que.top().first; int u = que.top().second; que.pop(); if (min_cost[u] < d) continue ; for (auto e : G[u]){ int v = e.to; Cost cost_to = d + e.cost; if (min_cost[v] > cost_to) { min_cost[v] = cost_to; que.emplace(cost_to, v); prev[v] = u; } } } return ; } /** * @brief dijkstra.hpp * @docs docs/graph/dijkstra.md */ //line 3 "/home/seekworser/.cpp_lib/competitive_library/competitive/std/io.hpp" // overload operators (prototypes) template < class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p); template < class T> inline istream& operator>>(istream& is, vector<T>& v); template < class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p); template < class T> inline ostream& operator<<(ostream& os, const vector<T>& v); template < typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp); template < typename T> ostream &operator<<(ostream &os, const set<T> &st); template < typename T> ostream &operator<<(ostream &os, const multiset<T> &st); template < typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st); template < typename T> ostream &operator<<(ostream &os, queue<T> q); template < typename T> ostream &operator<<(ostream &os, deque<T> q); template < typename T> ostream &operator<<(ostream &os, stack<T> st); template < class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq); // overload operators template < class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; } template < class T> inline istream& operator>>(istream& is, vector<T>& v) { repe(x, v) is >> x; return is; } template < class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p) { os << p.first << " " << p.second; return os; } template < class T> inline ostream& operator<<(ostream& os, const vector<T>& v) { rep(i, sz(v)) { os << v.at(i); if (i != sz(v) - 1) os << " " ; } return os; } template < typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp) { for (auto &[key, val] : mp) { os << key << ":" << val << " " ; } return os; } template < typename T> ostream &operator<<(ostream &os, const set<T> &st) { auto itr = st.begin(); for ( int i = 0; i < ( int )st.size(); i++) { os << *itr << (i + 1 != ( int )st.size() ? " " : "" ); itr++; } return os; } template < typename T> ostream &operator<<(ostream &os, const multiset<T> &st) { auto itr = st.begin(); for ( int i = 0; i < ( int )st.size(); i++) { os << *itr << (i + 1 != ( int )st.size() ? " " : "" ); itr++; } return os; } template < typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st) { ll cnt = 0; for (auto &e : st) { os << e << (++cnt != ( int )st.size() ? " " : "" ); } return os; } template < typename T> ostream &operator<<(ostream &os, queue<T> q) { while (q.size()) { os << q.front() << " " ; q.pop(); } return os; } template < typename T> ostream &operator<<(ostream &os, deque<T> q) { while (q.size()) { os << q.front(); q.pop_front(); if (q.size()) os << " " ; } return os; } template < typename T> ostream &operator<<(ostream &os, stack<T> st) { while (st.size()) { os << st.top() << " " ; st.pop(); } return os; } template < class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq) { while (pq.size()) { os << pq.top() << " " ; pq.pop(); } return os; } template < typename T> int print_sep_end(string sep, string end, const T& val) { ( void )sep; cout << val << end; return 0; }; template < typename T1, typename ... T2> int print_sep_end(string sep, string end, const T1 &val, const T2 &...remain) { cout << val << sep; print_sep_end(sep, end, remain...); return 0; }; template < typename ... T> int print( const T &...args) { print_sep_end( " " , "\n" , args...); return 0; }; template < typename ... T> void flush() { cout << flush; }; template < typename ... T> int print_and_flush( const T &...args) { print(args...); flush(); return 0; }; #define debug(...) debug_func(0, #__VA_ARGS__, __VA_ARGS__) // debug print template < typename T> void input(T &a) { cin >> a; }; template < typename T1, typename ... T2> void input(T1&a, T2 &...b) { cin >> a; input(b...); }; #ifdef LOCAL_TEST template < typename T> void debug_func( int i, const T name) { ( void )i; ( void )name; cerr << endl; } template < typename T1, typename T2, typename ... T3> void debug_func( int i, const T1 &name, const T2 &a, const T3 &...b) { int scope = 0; for ( ; (scope != 0 || name[i] != ',' ) && name[i] != '\0' ; i++ ) { cerr << name[i]; if (name[i] == '(' || name[i] == '{' ) scope++; if (name[i] == ')' || name[i] == '}' ) scope--; } cerr << ":" << a << " " ; debug_func(i + 1, name, b...); } template < typename T1, typename T2, typename ... T3> void debug_func( int i, const T1 &name, T2 &a, T3 &...b) { int scope = 0; for ( ; (scope != 0 || name[i] != ',' ) && name[i] != '\0' ; i++ ) { cerr << name[i]; if (name[i] == '(' || name[i] == '{' ) scope++; if (name[i] == ')' || name[i] == '}' ) scope--; } cerr << ":" << a << " " ; debug_func(i + 1, name, b...); } #endif #ifndef LOCAL_TEST template < typename ... T> void debug_func(T &...) {} template < typename ... T> void debug_func( const T &...) {} #endif /** * @brief io.hpp * @docs docs/std/io.md */ //line 26 "answer.cpp" #endif |
ステータス
項目 | データ |
---|---|
問題 | 1814 - 最長経路問題 |
ユーザー名 | seekworser |
投稿日時 | 2024-07-18 19:58:10 |
言語 | C++17 |
状態 | Accepted |
得点 | 100 |
ソースコード長 | 14474 Byte |
最大実行時間 | 55 ms |
最大メモリ使用量 | 8524 KB |
セット
セット | 得点 | Cases | |
---|---|---|---|
1 | ALL | 100 / 100 | * |
テストケース
ファイル名 | 状態 | 実行時間 | メモリ使用量 | # |
---|---|---|---|---|
01.in | AC | 29 ms | 604 KB |
1
|
02.in | AC | 27 ms | 428 KB |
1
|
03.in | AC | 19 ms | 380 KB |
1
|
04.in | AC | 20 ms | 464 KB |
1
|
05.in | AC | 16 ms | 548 KB |
1
|
06.in | AC | 53 ms | 7792 KB |
1
|
07.in | AC | 30 ms | 5568 KB |
1
|
08.in | AC | 41 ms | 5224 KB |
1
|
09.in | AC | 28 ms | 3376 KB |
1
|
10.in | AC | 25 ms | 4000 KB |
1
|
11.in | AC | 24 ms | 3920 KB |
1
|
12.in | AC | 22 ms | 3448 KB |
1
|
13.in | AC | 21 ms | 2740 KB |
1
|
14.in | AC | 32 ms | 3836 KB |
1
|
15.in | AC | 27 ms | 5116 KB |
1
|
16.in | AC | 50 ms | 8524 KB |
1
|
17.in | AC | 36 ms | 7192 KB |
1
|
18.in | AC | 30 ms | 4328 KB |
1
|
19.in | AC | 42 ms | 6960 KB |
1
|
20.in | AC | 27 ms | 4960 KB |
1
|
21.in | AC | 54 ms | 8388 KB |
1
|
22.in | AC | 55 ms | 8304 KB |
1
|
23.in | AC | 49 ms | 8332 KB |
1
|
24.in | AC | 47 ms | 8364 KB |
1
|
25.in | AC | 52 ms | 8292 KB |
1
|