#774963 (C++14) No.1995 CHIKA Road

• 問題: No.1995 CHIKA Road
• ユーザー: t98slider
• 提出日時: 2022-07-01 21:40:34
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 88 ms / 2,000 ms
• コード長: 4,467 bytes
• コンパイル時間: 1,911 ms
• コンパイル使用メモリ: 180,980 KB
• 実行使用メモリ: 14,116 KB
• 最終ジャッジ日時: 2023-08-17 09:06:30
• 合計ジャッジ時間: 4,805 ms
• ジャッジサーバーID （参考情報）: judge12 / judge11

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 4,380 KB
testcase_01	AC	1 ms; 4,380 KB
testcase_02	AC	1 ms; 4,380 KB
testcase_03	AC	1 ms; 4,380 KB
testcase_04	AC	1 ms; 4,376 KB
testcase_05	AC	2 ms; 4,376 KB
testcase_06	AC	7 ms; 4,376 KB
testcase_07	AC	21 ms; 5,620 KB
testcase_08	AC	1 ms; 4,376 KB
testcase_09	AC	2 ms; 4,376 KB
testcase_10	AC	46 ms; 7,292 KB
testcase_11	AC	88 ms; 14,116 KB
testcase_12	AC	69 ms; 10,820 KB
testcase_13	AC	28 ms; 6,688 KB
testcase_14	AC	31 ms; 6,984 KB
testcase_15	AC	81 ms; 12,604 KB
testcase_16	AC	11 ms; 4,376 KB
testcase_17	AC	45 ms; 7,708 KB
testcase_18	AC	73 ms; 10,920 KB
testcase_19	AC	75 ms; 10,820 KB
testcase_20	AC	40 ms; 7,456 KB
testcase_21	AC	36 ms; 6,800 KB
testcase_22	AC	72 ms; 10,420 KB
testcase_23	AC	22 ms; 5,560 KB
testcase_24	AC	62 ms; 9,528 KB
testcase_25	AC	13 ms; 4,424 KB
testcase_26	AC	26 ms; 5,920 KB
testcase_27	AC	59 ms; 9,244 KB
testcase_28	AC	35 ms; 6,748 KB
testcase_29	AC	72 ms; 10,708 KB
testcase_30	AC	12 ms; 4,380 KB
testcase_31	AC	6 ms; 4,376 KB
testcase_32	AC	16 ms; 4,868 KB
testcase_33	AC	57 ms; 9,176 KB
testcase_34	AC	7 ms; 4,376 KB
testcase_35	AC	23 ms; 5,772 KB
testcase_36	AC	27 ms; 6,020 KB
testcase_37	AC	68 ms; 10,064 KB
testcase_38	AC	46 ms; 8,000 KB
testcase_39	AC	6 ms; 4,380 KB

ソースコード

#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)printf("yes\n");else printf("no\n")
#define Yes(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YES(ans) if(ans)printf("YES\n");else printf("NO\n")
#define popcount(v) __builtin_popcountll(v)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
#define vector4d(type,name,h,w,d,...) vector<vector<vector<vector<type>>>>name(h,vector<vector<vector<type>>>(w,vector<vector<type>>(d,vector<type>(__VA_ARGS__))))
using namespace std;
using ll = long long;
template<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
const int MOD=1000000007;
const int MOD2=998244353;
const int INF=1<<30;
const ll INF2=1LL<<60;
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}
template<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}
template<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<'\n';}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
ll updivide(ll a,ll b){return (a+b-1)/b;}
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}

int main(){
    INT(n,m);
    vector<array<int,2>> edge(m);
    vector<int> ca;
    ca.push_back(0);
    ca.push_back(n-1);
    for(int i = 0; i < m; i++){
        in(edge[i][0], edge[i][1]);
        edge[i][0]--, edge[i][1]--;
        ca.push_back(edge[i][0]);
        ca.push_back(edge[i][1]);
    }
    sort(ca.begin(), ca.end());
    ca.erase(unique(all(ca)),ca.end());
    vector<ll> dp(ca.size(), INF2);
    vector<vector<pair<int,ll>>> g(ca.size());
    for(int i = 0; i < m; i++){
        edge[i][0] = lower_bound(all(ca),edge[i][0]) - ca.begin();
        edge[i][1] = lower_bound(all(ca),edge[i][1]) - ca.begin();
        g[edge[i][0]].emplace_back(edge[i][1], 2ll * (ca[edge[i][1]] - ca[edge[i][0]]) - 1);
    }
    dp[0] = 0;
    for(int i = 0; i + 1 < ca.size(); i++){
        chmin(dp[i + 1], dp[i] + 2ll * (ca[i + 1] - ca[i]));
        for(auto &&p:g[i]){
            chmin(dp[p.first], dp[i] + p.second);
        }
    }
    cout << dp.back() << '\n';
}