結果
問題 | No.1995 CHIKA Road |
ユーザー | Linaria2002 |
提出日時 | 2022-07-20 21:38:53 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 586 ms / 2,000 ms |
コード長 | 3,994 bytes |
コンパイル時間 | 2,445 ms |
コンパイル使用メモリ | 222,268 KB |
実行使用メモリ | 45,524 KB |
最終ジャッジ日時 | 2024-07-02 14:08:52 |
合計ジャッジ時間 | 9,537 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 17 ms
5,888 KB |
testcase_07 | AC | 75 ms
11,860 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 81 ms
12,684 KB |
testcase_11 | AC | 586 ms
45,524 KB |
testcase_12 | AC | 220 ms
26,088 KB |
testcase_13 | AC | 126 ms
17,380 KB |
testcase_14 | AC | 138 ms
18,148 KB |
testcase_15 | AC | 475 ms
40,556 KB |
testcase_16 | AC | 31 ms
7,536 KB |
testcase_17 | AC | 179 ms
20,764 KB |
testcase_18 | AC | 348 ms
31,904 KB |
testcase_19 | AC | 351 ms
32,064 KB |
testcase_20 | AC | 162 ms
18,928 KB |
testcase_21 | AC | 141 ms
17,684 KB |
testcase_22 | AC | 328 ms
30,356 KB |
testcase_23 | AC | 77 ms
11,976 KB |
testcase_24 | AC | 270 ms
27,172 KB |
testcase_25 | AC | 38 ms
8,364 KB |
testcase_26 | AC | 88 ms
13,640 KB |
testcase_27 | AC | 266 ms
26,396 KB |
testcase_28 | AC | 138 ms
17,664 KB |
testcase_29 | AC | 338 ms
30,992 KB |
testcase_30 | AC | 34 ms
8,040 KB |
testcase_31 | AC | 16 ms
5,504 KB |
testcase_32 | AC | 48 ms
9,776 KB |
testcase_33 | AC | 258 ms
25,900 KB |
testcase_34 | AC | 19 ms
6,016 KB |
testcase_35 | AC | 82 ms
12,872 KB |
testcase_36 | AC | 100 ms
14,504 KB |
testcase_37 | AC | 305 ms
28,976 KB |
testcase_38 | AC | 200 ms
22,448 KB |
testcase_39 | AC | 15 ms
5,504 KB |
ソースコード
#include<bits/stdc++.h> #define int ll #define rep(i, N) for(int i = 0; i < (int)(N); ++i) #define rep1(i, N) for(int i = 1; i <= (int)(N); ++i) #define per(i, N) for(int i = (N)-1; i >= 0; --i) #define all(v) (v).begin(), (v).end() #define rall(v) (v).rbegin(), (v).rend() #define bit(n, k) ((n) >> (k)) #define pcnt(n) (__builtin_popcount(n)) #define YesNo(ans) ans ? cout << "Yes\n" : cout << "No\n" #define endl '\n' #define fi first #define se second #define mkpr make_pair #define mktpl make_tuple #define eb emplace_back using namespace std; using ll = int64_t; using ull = uint64_t; using ld = long double; //using point = struct{ ll x, y; }; using point = struct{ ld x, y; }; using State = string::iterator; template<class T> using max_heap = priority_queue<T>; template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>; template<class T> using vec = vector<T>; template<class T> using vvec = vec<vec<T>>; template<class T> using vvvec = vec<vvec<T>>; template<class T> using vvvvec = vvec<vvec<T>>; constexpr ld EPS = 1e-10; ld Pi = acos(-1); constexpr int INF = 1001001001; constexpr ll LINF = 1001001001001001001ll; constexpr ll MOD = (0) ? 998244353 : 1e9+7; constexpr int NIL = -1; constexpr int pm[2] = {1, -1}; constexpr int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1}; constexpr int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1}; ll cel(ll a, ll b){ return (a + b - 1) / b;} ll Gcd(ll a, ll b){ return b ? Gcd(b, a % b) : abs(a);} ll Lcm(ll a, ll b){ return a / Gcd(a, b) * b;} template<class T> T powi(T x, ll exp){ return exp > 0 ? (exp & 1 ? x : 1) * powi(x * x, exp >> 1) : x / x; } ll modpow(ll x, ll exp, ll mod){ x %= mod; return exp > 0 ? (exp & 1 ? x : 1) * modpow(x * x, exp >> 1, mod) % mod : 1; } template<class T> bool chmin(T &a, T b){ return a > b ? (a = b, true) : 0;} template<class T> bool chmax(T &a, T b){ return a < b ? (a = b, true) : 0;} using Pair = pair<ll, ll>; using Tpl = tuple<int, int, int>; class Dijkstra{ using DS = pair<ll, int>; int N; // {distance, v} priority_queue<DS, vector<DS>, greater<DS>> Que; // {weight, v} vector<vector<DS>> G; public: // {dist, from} vector<DS> dist; Dijkstra(int N) : N(N), G(N), dist(N) {} void add_edge(int from, int to, int cst){ G[from].emplace_back(DS{cst, to}); } void solve(int s){ rep(i, N) dist[i] = {LINF, NIL}; dist[s].fi = 0; Que.push(DS{0, s}); while(!Que.empty()){ DS p = Que.top(); Que.pop(); int u = p.se; if(dist[u].fi != p.fi) continue; for(auto v : G[u]){ if(dist[v.se].fi > dist[u].fi + v.fi){ dist[v.se].fi = dist[u].fi + v.fi; dist[v.se].se = u; Que.push(DS{dist[v.se].fi, v.se}); } } } } }; void Main(){ int N, M; cin >> N >> M; map<int, int> mp; mp[1] = 0, mp[N] = 0; vec<Tpl> edge; rep(i, M){ int a, b; cin >> a >> b; mp[a] = 0, mp[b] = 0; edge.eb(mktpl(a, b, 2 * (b - a) - 1)); } int n = 0, prev; Dijkstra di(mp.size()); for(auto it : mp){ if(n > 0){ //cout << n << endl; di.add_edge(n - 1, n, 2 * (it.fi - prev)); di.add_edge(n, n - 1, 2 * (it.fi - prev)); //cout << it.fi - prev << endl; } prev = it.fi; mp[it.fi] = n; n++; } rep(i, M){ Tpl t = edge[i]; //cout << mp[get<0>(t)] << mp[get<1>(t)] << get<2>(t) << endl; di.add_edge(mp[get<0>(t)], mp[get<1>(t)], get<2>(t)); di.add_edge(mp[get<1>(t)], mp[get<0>(t)], get<2>(t)); } di.solve(0); rep(i, 0){ cout << di.dist[i].fi << endl; } cout << di.dist[mp.size() - 1].fi << endl; } signed main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); cout << fixed << setprecision(10); Main(); return 0; }