結果

問題 No.1473 おでぶなおばけさん
ユーザー Ogtsn99Ogtsn99
提出日時 2021-04-09 22:35:29
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 4,514 bytes
コンパイル時間 2,586 ms
コンパイル使用メモリ 215,344 KB
実行使用メモリ 24,204 KB
最終ジャッジ日時 2023-09-07 12:08:06
合計ジャッジ時間 37,894 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1,419 ms
23,892 KB
testcase_03 AC 681 ms
21,040 KB
testcase_04 AC 1,051 ms
14,080 KB
testcase_05 AC 274 ms
7,252 KB
testcase_06 AC 1,531 ms
22,772 KB
testcase_07 AC 1,310 ms
24,180 KB
testcase_08 TLE -
testcase_09 AC 1,062 ms
24,044 KB
testcase_10 AC 565 ms
15,416 KB
testcase_11 AC 768 ms
14,260 KB
testcase_12 AC 468 ms
17,152 KB
testcase_13 AC 81 ms
6,192 KB
testcase_14 AC 116 ms
5,520 KB
testcase_15 AC 200 ms
7,520 KB
testcase_16 AC 397 ms
19,360 KB
testcase_17 AC 11 ms
4,552 KB
testcase_18 AC 46 ms
5,508 KB
testcase_19 AC 513 ms
16,688 KB
testcase_20 AC 594 ms
19,056 KB
testcase_21 AC 930 ms
21,576 KB
testcase_22 AC 466 ms
22,296 KB
testcase_23 AC 384 ms
18,728 KB
testcase_24 AC 371 ms
19,188 KB
testcase_25 AC 1,181 ms
21,564 KB
testcase_26 AC 1,188 ms
23,120 KB
testcase_27 AC 314 ms
11,484 KB
testcase_28 AC 1,903 ms
23,804 KB
testcase_29 AC 1,016 ms
20,488 KB
testcase_30 AC 1,241 ms
23,316 KB
testcase_31 AC 1,055 ms
23,628 KB
testcase_32 AC 866 ms
23,440 KB
testcase_33 AC 759 ms
19,380 KB
testcase_34 AC 380 ms
11,608 KB
testcase_35 AC 288 ms
13,608 KB
testcase_36 AC 1,047 ms
18,400 KB
testcase_37 AC 1,048 ms
17,864 KB
testcase_38 AC 97 ms
6,664 KB
testcase_39 AC 364 ms
19,520 KB
testcase_40 AC 387 ms
19,544 KB
testcase_41 AC 62 ms
6,532 KB
testcase_42 AC 58 ms
6,472 KB
testcase_43 AC 679 ms
22,864 KB
testcase_44 AC 679 ms
22,804 KB
testcase_45 AC 681 ms
22,996 KB
testcase_46 AC 313 ms
15,976 KB
testcase_47 AC 423 ms
18,664 KB
testcase_48 AC 454 ms
18,180 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