結果

問題 No.1607 Kth Maximum Card
ユーザー rniyarniya
提出日時 2021-07-16 22:00:26
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 1,074 ms / 3,500 ms
コード長 5,070 bytes
コンパイル時間 3,330 ms
コンパイル使用メモリ 209,188 KB
実行使用メモリ 15,940 KB
最終ジャッジ日時 2023-09-20 13:55:16
合計ジャッジ時間 12,746 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 1 ms
4,380 KB
testcase_06 AC 1 ms
4,380 KB
testcase_07 AC 1 ms
4,376 KB
testcase_08 AC 1,074 ms
15,940 KB
testcase_09 AC 745 ms
13,632 KB
testcase_10 AC 1,040 ms
15,868 KB
testcase_11 AC 142 ms
6,212 KB
testcase_12 AC 627 ms
13,244 KB
testcase_13 AC 46 ms
4,876 KB
testcase_14 AC 49 ms
5,552 KB
testcase_15 AC 276 ms
12,160 KB
testcase_16 AC 42 ms
4,880 KB
testcase_17 AC 18 ms
4,376 KB
testcase_18 AC 164 ms
9,088 KB
testcase_19 AC 103 ms
7,152 KB
testcase_20 AC 184 ms
7,768 KB
testcase_21 AC 164 ms
8,200 KB
testcase_22 AC 277 ms
14,704 KB
testcase_23 AC 274 ms
14,832 KB
testcase_24 AC 113 ms
6,728 KB
testcase_25 AC 67 ms
5,404 KB
testcase_26 AC 81 ms
5,860 KB
testcase_27 AC 117 ms
6,920 KB
testcase_28 AC 98 ms
6,100 KB
testcase_29 AC 271 ms
9,844 KB
testcase_30 AC 834 ms
14,384 KB
testcase_31 AC 269 ms
9,352 KB
testcase_32 AC 65 ms
8,716 KB
testcase_33 AC 65 ms
8,856 KB
testcase_34 AC 64 ms
8,780 KB
testcase_35 AC 65 ms
8,504 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    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 U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

const int MAX_C = 200010;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, M, K;
    cin >> N >> M >> K;
    vector<vector<pair<int, int>>> G(N);
    for (; M--;) {
        int u, v, c;
        cin >> u >> v >> c;
        u--, v--;
        G[u].emplace_back(v, c);
        G[v].emplace_back(u, c);
    }

    vector<int> dp(N);
    priority_queue<pair<int, int>> pq;
    auto check = [&](int x) -> bool {
        for (int i = 0; i < N; i++) dp[i] = INF;
        dp[0] = 0;
        pq.emplace(-dp[0], 0);

        while (!pq.empty()) {
            auto p = pq.top();
            pq.pop();
            int v = p.second, val = -p.first;
            if (dp[v] < val) continue;

            for (auto& e : G[v]) {
                int u = e.first, nval = val + (e.second > x);
                if (chmin(dp[u], nval)) pq.emplace(-dp[u], u);
            }
        }

        return dp[N - 1] < K;
    };

    int lb = -1, ub = MAX_C;
    while (ub - lb > 1) {
        int mid = (ub + lb) >> 1;
        (check(mid) ? ub : lb) = mid;
    }

    cout << ub << '\n';
    return 0;
}
0