結果

問題 No.2565 はじめてのおつかい
ユーザー dyktr_06dyktr_06
提出日時 2023-12-02 15:46:20
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 147 ms / 2,000 ms
コード長 5,723 bytes
コンパイル時間 2,370 ms
コンパイル使用メモリ 215,748 KB
実行使用メモリ 36,096 KB
最終ジャッジ日時 2024-09-26 19:15:26
合計ジャッジ時間 6,939 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 147 ms
36,096 KB
testcase_04 AC 70 ms
36,096 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 75 ms
17,352 KB
testcase_07 AC 35 ms
10,880 KB
testcase_08 AC 38 ms
11,392 KB
testcase_09 AC 57 ms
15,972 KB
testcase_10 AC 45 ms
12,672 KB
testcase_11 AC 114 ms
26,496 KB
testcase_12 AC 18 ms
8,576 KB
testcase_13 AC 41 ms
12,416 KB
testcase_14 AC 76 ms
19,368 KB
testcase_15 AC 80 ms
19,056 KB
testcase_16 AC 69 ms
29,424 KB
testcase_17 AC 15 ms
7,936 KB
testcase_18 AC 18 ms
12,636 KB
testcase_19 AC 85 ms
24,156 KB
testcase_20 AC 76 ms
22,144 KB
testcase_21 AC 74 ms
22,272 KB
testcase_22 AC 36 ms
15,232 KB
testcase_23 AC 51 ms
15,744 KB
testcase_24 AC 9 ms
5,760 KB
testcase_25 AC 77 ms
22,352 KB
testcase_26 AC 47 ms
14,976 KB
testcase_27 AC 72 ms
23,296 KB
testcase_28 AC 98 ms
23,808 KB
testcase_29 AC 120 ms
28,288 KB
testcase_30 AC 85 ms
25,344 KB
testcase_31 AC 97 ms
23,040 KB
testcase_32 AC 42 ms
14,848 KB
testcase_33 AC 80 ms
24,136 KB
testcase_34 AC 78 ms
21,504 KB
testcase_35 AC 78 ms
27,520 KB
testcase_36 AC 80 ms
24,064 KB
testcase_37 AC 41 ms
15,324 KB
testcase_38 AC 65 ms
21,536 KB
testcase_39 AC 74 ms
18,048 KB
testcase_40 AC 91 ms
28,136 KB
testcase_41 AC 100 ms
29,440 KB
testcase_42 AC 46 ms
14,720 KB
testcase_43 AC 61 ms
20,096 KB
testcase_44 AC 34 ms
11,648 KB
testcase_45 AC 16 ms
8,320 KB
testcase_46 AC 93 ms
20,176 KB
testcase_47 AC 47 ms
14,592 KB
testcase_48 AC 43 ms
12,544 KB
testcase_49 AC 17 ms
8,320 KB
testcase_50 AC 48 ms
16,568 KB
testcase_51 AC 1 ms
5,376 KB
testcase_52 AC 29 ms
17,664 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } 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, 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(); } 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<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

template <typename T>
vector<long long> dijkstra(const vector<vector<array<long long, 2>>> &G, T x){
    const long long INF = 0x1fffffffffffffff;
    vector<long long> cost((int) G.size(), INF);
    using P = pair<long long, long long>;
    priority_queue<P, vector<P>, greater<>> q;
    cost[x] = 0;
    q.emplace(0, x);
    
    while(q.size()){
        auto [c, at] = q.top();
        q.pop();
        if(c > cost[at]) continue;
        for(auto& [to, t] : G[at]){
            if(cost[to] > c + t){
                cost[to] = c + t;
                q.emplace(cost[to], to);
            }
        }
    }
    return cost;
}

ll n, m;
vll u, v;

void input(){
    in(n, m);
    u.resize(m);
    v.resize(m);
    rep(i, m) in(u[i], v[i]);
}

void solve(){
    rep(i, m) u[i]--, v[i]--;

    vector<vector<array<ll, 2>>> G(n * 4), G2(n);
    rep(i, m){
        rep(j, 4){
            ll bit = j;
            if(v[i] == n - 2){
                bit |= 1;
                G[j * n + u[i]].push_back({bit * n + v[i], 1});
            }else if(v[i] == n - 1){
                bit |= 2;
                G[j * n + u[i]].push_back({bit * n + v[i], 1});
            }else{
                bit |= 0;
                G[j * n + u[i]].push_back({bit * n + v[i], 1});
            }
        }
    }
    rep(i, m){
        G2[v[i]].push_back({u[i], 1});
    }
    
    vll cost = dijkstra(G, 0), cost2 = dijkstra(G2, 0);
    ll ans = INF;
    rep(i, n){
        chmin(ans, cost[3 * n + i] + cost2[i]);
    }
    if(ans == INF){
        out(-1);
    }else{
        out(ans);
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}
0