結果

問題 No.1995 CHIKA Road
ユーザー shu8Creamshu8Cream
提出日時 2022-07-01 22:07:12
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 267 ms / 2,000 ms
コード長 4,065 bytes
コンパイル時間 2,668 ms
コンパイル使用メモリ 215,168 KB
最終ジャッジ日時 2025-01-30 02:53:19
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 37
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:126:31: warning: narrowing conversion of ‘cmp.std::vector<long long int, std::allocator<long long int> >::operator[](((std::vector<long long int, std::allocator<long long int> >::size_type)((i * 2) + 1)))’ from ‘__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type’ {aka ‘long long int’} to ‘int’ [-Wnarrowing]
  126 |         to[cmp[i*2]].push_back({cmp[i*2+1], cst});
      |         ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
main.cpp:127:33: warning: narrowing conversion of ‘cmp.std::vector<long long int, std::allocator<long long int> >::operator[](((std::vector<long long int, std::allocator<long long int> >::size_type)(i * 2)))’ from ‘__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type’ {aka ‘long long int’} to ‘int’ [-Wnarrowing]
  127 |         to[cmp[i*2+1]].push_back({cmp[i*2], cst});
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~

ソースコード

diff # 

/**
*    author:  shu8Cream
*    created: 01.07.2022 21:48:29
**/

#include <bits/stdc++.h>
using namespace std;
#define overload3(a,b,c,d,...) d
#define rep1(i,n) for (int i=0; i<(n); i++)
#define rep2(i,a,n) for (int i=(a); i<(n); i++)
#define rep(...) overload3(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
#define rrep1(i,n) for (int i=(n-1); i>=0; i--)
#define rrep2(i,a,n) for (int i=(n-1); i>=(a); i--)
#define rrep(...) overload3(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) int((x).size())
#define pcnt __builtin_popcountll
using ll = long long;
using P = pair<ll,ll>;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
using vi = vc<ll>;
using vvi = vv<ll>;
const ll INF = 8e18;
template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.first>>v.second;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) { a = b; return true; }
    return false;
}
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) { a = b; return true; }
    return false;
}

template <class T> string to_string(T s);
template <class S, class T> string to_string(pair<S, T> p);
string to_string(char c) { return string(1, c); }
string to_string(string s) { return s; }
string to_string(const char s[]) { return string(s); }

template <class T>
string to_string(T v) {
    if (v.empty()) return "{}";
    string ret = "{";
    for (auto x : v) ret += to_string(x) + ",";
    ret.back() = '}';
    return ret;
}
template <class S, class T>
string to_string(pair<S, T> p) {
    return "{" + to_string(p.first) + ":" + to_string(p.second) + "}";
}

void debug_out() { cout << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cout << to_string(H) << " ";
    debug_out(T...);
}

#ifdef _DEBUG
#define debug(...) debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif

template <typename T>
vector<T> compress(vector<T> a){
    auto b = a;
    sort(all(b));
    b.erase(unique(all(b)), b.end());
    for(auto &p:a) p = lower_bound(all(b),p) - b.begin();
    return a;
}

struct edge {int to; ll cost; int id=0;};

vi dist;
// 最短経路木
vc<int> tree;

// edges:グラフ, V:頂点数, s:始点 を与える
void dijkstra(vv<edge> &edges, int V, int s){
    dist.resize(V,INF); dist[s] = 0;
    priority_queue<P, vector<P>, greater<P>> q;
    tree.resize(V-1);
    q.push(P(0, s));
    while (!q.empty()) {
        P p = q.top(); q.pop();
        int v = p.second;
        if (dist[v] < p.first) continue;
        for (auto e : edges[v]) {
            if (dist[e.to] > dist[v] + e.cost) {
                dist[e.to] = dist[v] + e.cost;
                q.push(P(dist[e.to], e.to));
                tree[e.to-1] = e.id+1;
            }
        }
    }
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    ll n,m; cin >> n >> m;
    vi c;
    rep(i,m){
        int a,b; cin >> a >> b;
        c.push_back(a);
        c.push_back(b);
    }
    c.push_back(1);
    c.push_back(n);
    auto cmp = compress(c);
    int len = *max_element(all(cmp))+1;
    vv<edge> to(len);
    rep(i,m){
        ll cst = c[i*2+1]*2-c[i*2]*2-1;
        to[cmp[i*2]].push_back({cmp[i*2+1], cst});
        to[cmp[i*2+1]].push_back({cmp[i*2], cst});
    }
    sort(all(c));
    c.erase(unique(all(c)),c.end());
    rep(i,sz(c)-1){
        ll cst = (c[i+1]-c[i])*2;
        to[i].push_back({i+1,cst});
        to[i+1].push_back({i,cst});
    }
    dijkstra(to,sz(c),0);
    cout << dist[sz(c)-1] << endl;
}
0