結果
問題 | No.1995 CHIKA Road |
ユーザー | Linaria2002 |
提出日時 | 2022-07-20 20:17:51 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,755 bytes |
コンパイル時間 | 2,204 ms |
コンパイル使用メモリ | 224,456 KB |
実行使用メモリ | 37,464 KB |
最終ジャッジ日時 | 2024-07-02 14:08:06 |
合計ジャッジ時間 | 6,561 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
ソースコード
#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<char, 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 - 2 * 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)); } prev = it.fi; mp[it.fi] = n; n++; } rep(i, M){ Tpl t = edge[i]; //cout << mp[get<0>(t)] << mp[get<1>(t)] << endl; di.add_edge(mp[get<0>(t)], mp[get<1>(t)], get<2>(t)); } di.solve(0); cout << di.dist[n - 1].fi << endl; } signed main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); cout << fixed << setprecision(10); Main(); return 0; }