結果
問題 | No.1607 Kth Maximum Card |
ユーザー | 👑 hitonanode |
提出日時 | 2021-07-16 23:35:30 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 260 ms / 3,500 ms |
コード長 | 7,416 bytes |
コンパイル時間 | 2,823 ms |
コンパイル使用メモリ | 151,592 KB |
実行使用メモリ | 10,636 KB |
最終ジャッジ日時 | 2023-09-20 16:07:30 |
合計ジャッジ時間 | 7,166 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,376 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 | 2 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 195 ms
10,132 KB |
testcase_09 | AC | 199 ms
9,072 KB |
testcase_10 | AC | 257 ms
10,636 KB |
testcase_11 | AC | 48 ms
6,700 KB |
testcase_12 | AC | 192 ms
9,420 KB |
testcase_13 | AC | 27 ms
4,392 KB |
testcase_14 | AC | 36 ms
4,928 KB |
testcase_15 | AC | 195 ms
9,368 KB |
testcase_16 | AC | 31 ms
4,660 KB |
testcase_17 | AC | 10 ms
4,376 KB |
testcase_18 | AC | 117 ms
7,964 KB |
testcase_19 | AC | 68 ms
6,148 KB |
testcase_20 | AC | 87 ms
6,600 KB |
testcase_21 | AC | 102 ms
7,320 KB |
testcase_22 | AC | 260 ms
10,372 KB |
testcase_23 | AC | 254 ms
10,320 KB |
testcase_24 | AC | 80 ms
5,464 KB |
testcase_25 | AC | 38 ms
4,616 KB |
testcase_26 | AC | 57 ms
5,108 KB |
testcase_27 | AC | 83 ms
5,912 KB |
testcase_28 | AC | 65 ms
6,648 KB |
testcase_29 | AC | 132 ms
7,484 KB |
testcase_30 | AC | 255 ms
10,068 KB |
testcase_31 | AC | 140 ms
6,924 KB |
testcase_32 | AC | 163 ms
9,728 KB |
testcase_33 | AC | 158 ms
9,400 KB |
testcase_34 | AC | 208 ms
9,272 KB |
testcase_35 | AC | 209 ms
9,472 KB |
ソースコード
#include <algorithm> #include <array> #include <bitset> #include <cassert> #include <chrono> #include <cmath> #include <complex> #include <deque> #include <forward_list> #include <fstream> #include <functional> #include <iomanip> #include <ios> #include <iostream> #include <limits> #include <list> #include <map> #include <numeric> #include <queue> #include <random> #include <set> #include <sstream> #include <stack> #include <string> #include <tuple> #include <type_traits> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; using lint = long long; using pint = pair<int, int>; using plint = pair<lint, lint>; struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_; #define ALL(x) (x).begin(), (x).end() #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++) #define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) template <typename T, typename V> void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); } template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); } template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; } template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; } int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); } template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); } template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); } template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; } template <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); } template <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); } template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; } template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; } #if __cplusplus >= 201703L template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; } template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; } #endif template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; } template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } #ifdef HITONANODE_LOCAL const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m"; #define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl #define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl : cerr) #else #define dbg(x) (x) #define dbgif(cond, x) 0 #endif // Simple forward_list for MLE-sensitive situations // Verify: <http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_14_D> template <typename T> struct light_forward_list { static std::vector<unsigned> ptr; static std::vector<T> val; unsigned head; light_forward_list() : head(0) { ptr.reserve(404040); val.reserve(404040); } void push_front(T x) { ptr.push_back(head), val.push_back(x); head = ptr.size() - 1; } struct iterator { unsigned p; iterator operator++() { return {p = ptr[p]}; } T &operator*() { return val[p]; } bool operator!=(const iterator &rhs) { return p != rhs.p; } }; iterator begin() { return {head}; } iterator end() { return {0}; } }; template <typename T> std::vector<unsigned> light_forward_list<T>::ptr = {0}; template <typename T> std::vector<T> light_forward_list<T>::val = {T()}; int main() { int N, M, K; cin >> N >> M >> K; std::vector<light_forward_list<pair<int, int>>> to(N); vector<int> D; REP(j, M) { int u, v, c; cin >> u >> v >> c; D.push_back(c); u--, v--; to[u].push_front(make_pair(v, c)); to[v].push_front(make_pair(u, c)); } D.push_back(0); D = sort_unique(D); int lo = -1, hi = int(D.size()) - 1; // D[hi] 以下にはできて, D[lo] 以下にはできない while (hi > lo + 1) { const int c = D[(lo + hi) / 2]; vector<int> dist(N, K); dist[0] = 0; vector<int> s1{0}, s2; int hnow = 0; while (s1.size()) { while (s1.size()) { int now = s1.back(); s1.pop_back(); if (dist[now] < hnow) continue; for (auto [nxt, w] : to[now]) { int d = dist[now] + (w > c); if (chmin(dist[nxt], d)) { (w > c ? s2 : s1).push_back(nxt); } } } swap(s1, s2); hnow++; if (hnow >= K) break; } auto di = dist[N - 1]; (di < K ? hi : lo) = (lo + hi) / 2; } cout << D[hi] << '\n'; }