結果

問題 No.1473 おでぶなおばけさん
ユーザー Ogtsn99Ogtsn99
提出日時 2021-04-09 22:35:29
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,887 ms / 2,000 ms
コード長 4,514 bytes
コンパイル時間 2,659 ms
コンパイル使用メモリ 217,432 KB
実行使用メモリ 24,228 KB
最終ジャッジ日時 2024-06-25 06:13:45
合計ジャッジ時間 32,075 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 1,184 ms
23,716 KB
testcase_03 AC 584 ms
21,284 KB
testcase_04 AC 850 ms
14,404 KB
testcase_05 AC 245 ms
7,424 KB
testcase_06 AC 1,237 ms
22,928 KB
testcase_07 AC 1,056 ms
24,220 KB
testcase_08 AC 1,887 ms
24,228 KB
testcase_09 AC 852 ms
24,092 KB
testcase_10 AC 524 ms
15,360 KB
testcase_11 AC 699 ms
14,208 KB
testcase_12 AC 404 ms
17,280 KB
testcase_13 AC 81 ms
6,272 KB
testcase_14 AC 113 ms
5,376 KB
testcase_15 AC 197 ms
7,680 KB
testcase_16 AC 329 ms
19,328 KB
testcase_17 AC 12 ms
5,376 KB
testcase_18 AC 46 ms
5,632 KB
testcase_19 AC 384 ms
16,640 KB
testcase_20 AC 459 ms
19,288 KB
testcase_21 AC 785 ms
21,632 KB
testcase_22 AC 382 ms
22,192 KB
testcase_23 AC 308 ms
18,844 KB
testcase_24 AC 303 ms
19,236 KB
testcase_25 AC 973 ms
22,000 KB
testcase_26 AC 1,050 ms
23,308 KB
testcase_27 AC 239 ms
11,520 KB
testcase_28 AC 1,645 ms
23,780 KB
testcase_29 AC 943 ms
20,672 KB
testcase_30 AC 1,130 ms
23,360 KB
testcase_31 AC 902 ms
23,916 KB
testcase_32 AC 776 ms
23,472 KB
testcase_33 AC 690 ms
19,544 KB
testcase_34 AC 334 ms
11,804 KB
testcase_35 AC 242 ms
13,540 KB
testcase_36 AC 917 ms
18,384 KB
testcase_37 AC 915 ms
18,044 KB
testcase_38 AC 93 ms
6,784 KB
testcase_39 AC 349 ms
19,456 KB
testcase_40 AC 350 ms
19,584 KB
testcase_41 AC 61 ms
6,516 KB
testcase_42 AC 57 ms
6,388 KB
testcase_43 AC 651 ms
22,936 KB
testcase_44 AC 630 ms
22,944 KB
testcase_45 AC 639 ms
22,936 KB
testcase_46 AC 295 ms
16,080 KB
testcase_47 AC 396 ms
18,776 KB
testcase_48 AC 427 ms
18,140 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define rep(i, n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i, n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.end(), 0LL)
#define lb(a, key) lower_bound(a.begin(),a.end(),key)
#define ub(a, key) upper_bound(a.begin(),a.end(),key)
#define COUNT(a, key) count(a.begin(), a.end(), key)
#define BITCOUNT(x) __builtin_popcount(x)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
using P = pair<int, int>;
using WeightedGraph = vector<vector<P>>;
using UnWeightedGraph = vector<vector<int>>;
using Real = long double;
using Point = complex<Real>; //Point and Vector2d is the same!
using Vector2d = complex<Real>;
const int MOD = 1000000007;
const long long INF = 1LL << 60;
const double EPS = 1e-15;
const double PI = 3.14159265358979323846;

template<typename T>
int getIndexOfLowerBound(vector<T> &v, T x) {
    return lower_bound(v.begin(), v.end(), x) - v.begin();
}

template<typename T>
int getIndexOfUpperBound(vector<T> &v, T x) {
    return upper_bound(v.begin(), v.end(), x) - v.begin();
}

template<class T>
inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)

istream &operator>>(istream &is, Point &p) {
    Real a, b;
    is >> a >> b;
    p = Point(a, b);
    return is;
}

template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p_var) {
    is >> p_var.first >> p_var.second;
    return is;
}

template<typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &x : vec) is >> x;
    return is;
}

template<typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
    os << pair_var.first << ' ' << pair_var.second;
    return os;
}

template<typename T>
ostream &operator<<(ostream &os, vector<T> &vec) {
    for (int i = 0; i < vec.size(); i++)
        os << vec[i] << ' ';
    return os;
}

template<typename T, typename U>
ostream &operator<<(ostream &os, vector<pair<T, U>> &vec) {
    for (int i = 0; i < vec.size(); i++)
        os << vec[i] << '\n';
    return os;
}

template<typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &df) {
    for (auto &vec : df) os << vec;
    return os;
}

template<typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
    repi(itr, map_var) {
        os << *itr << ' ';
        itr++;
        itr--;
    }
    return os;
}

template<typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
    repi(itr, set_var) {
        os << *itr << ' ';
        itr++;
        itr--;
    }
    return os;
}

void print() { cout << endl; }

template<class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(tail) != 0) cout << " ";
    print(forward<Tail>(tail)...);
}

int w;
map <pair <int, int>, int> dur;

vector <int> dijkstra(WeightedGraph &G, int s=0){
    vector <int> d(G.size(),INF);
    priority_queue<P, vector<P>, greater<> > que;
    d[s] = 0;
    que.push(P(0,s));
    while(!que.empty()){
        P p = que.top(); que.pop();
        int v = p.second;
        if(d[v]< p.first) continue;
        int sz = G[v].size();
        rep(i,sz) {
            int now = v;
            int ne = G[v][i].F;
            if(dur[{now, ne}] < w) continue;
            if (chmin(d[G[v][i].F], d[v] + G[v][i].S)) que.push(P(d[G[v][i].F], G[v][i].F));
        }
    }
    return d;
}

bool isOk(int mid, WeightedGraph &g) {
    w = mid;
    auto d = dijkstra(g);
    if(d[d.size() - 1] != INF) return true;
    else return false;
}

signed main(void) { cin.tie(0); ios::sync_with_stdio(false);
    int n, m; cin>>n>>m;
    WeightedGraph g(n);

    rep(i, m) {
        int s, t, d; cin>>s>>t>>d;
        s--, t--;
        chmax(dur[{s, t}], d);
        chmax(dur[{t, s}], d);
        g[s].pb({t, 1});
        g[t].pb({s, 1});
    }

    int ok = -1, ng = 1e12; //範囲にめっちゃ注意!
    while (abs(ng-ok) > 1) {
        int mid = (ng + ok) / 2;

        if(isOk(mid, g)) {
            ok = mid;
        } else {
            ng = mid;
        }
    }

    w = ok;
    print(ok, dijkstra(g)[n-1]);
}
0