結果
問題 | No.1607 Kth Maximum Card |
ユーザー | hotman78 |
提出日時 | 2021-07-16 22:15:30 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,011 ms / 3,500 ms |
コード長 | 8,874 bytes |
コンパイル時間 | 3,865 ms |
コンパイル使用メモリ | 240,408 KB |
実行使用メモリ | 20,740 KB |
最終ジャッジ日時 | 2023-09-20 14:24:02 |
合計ジャッジ時間 | 15,532 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,376 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,376 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,376 KB |
testcase_08 | AC | 1,011 ms
20,740 KB |
testcase_09 | AC | 785 ms
17,336 KB |
testcase_10 | AC | 995 ms
20,700 KB |
testcase_11 | AC | 99 ms
7,392 KB |
testcase_12 | AC | 659 ms
17,188 KB |
testcase_13 | AC | 59 ms
5,820 KB |
testcase_14 | AC | 79 ms
6,688 KB |
testcase_15 | AC | 428 ms
17,164 KB |
testcase_16 | AC | 66 ms
6,136 KB |
testcase_17 | AC | 20 ms
4,380 KB |
testcase_18 | AC | 275 ms
12,828 KB |
testcase_19 | AC | 147 ms
9,156 KB |
testcase_20 | AC | 194 ms
10,616 KB |
testcase_21 | AC | 236 ms
11,620 KB |
testcase_22 | AC | 765 ms
20,516 KB |
testcase_23 | AC | 828 ms
20,352 KB |
testcase_24 | AC | 174 ms
9,168 KB |
testcase_25 | AC | 97 ms
6,884 KB |
testcase_26 | AC | 118 ms
7,508 KB |
testcase_27 | AC | 184 ms
9,120 KB |
testcase_28 | AC | 138 ms
8,216 KB |
testcase_29 | AC | 431 ms
13,972 KB |
testcase_30 | AC | 937 ms
20,708 KB |
testcase_31 | AC | 439 ms
12,760 KB |
testcase_32 | AC | 147 ms
13,300 KB |
testcase_33 | AC | 151 ms
13,844 KB |
testcase_34 | AC | 146 ms
13,280 KB |
testcase_35 | AC | 152 ms
13,540 KB |
ソースコード
#line 2 "cpplib/util/template.hpp" #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #pragma GCC target("avx2") #include<bits/stdc++.h> using namespace std; struct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}__INIT__; typedef long long lint; #define INF (1LL<<60) #define IINF (1<<30) #define EPS (1e-10) #define endl ('\n') typedef vector<lint> vec; typedef vector<vector<lint>> mat; typedef vector<vector<vector<lint>>> mat3; typedef vector<string> svec; typedef vector<vector<string>> smat; template<typename T>using V=vector<T>; template<typename T>using VV=V<V<T>>; template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;} template<typename T>inline void output2(T t){for(auto i:t)output(i);} template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;} template<typename T>inline void debug2(T t){for(auto i:t)output(i);} #define loop(n) for(long long _=0;_<(long long)(n);++_) #define _overload4(_1,_2,_3,_4,name,...) name #define __rep(i,a) repi(i,0,a,1) #define _rep(i,a,b) repi(i,a,b,1) #define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c) #define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__) #define _overload3_rev(_1,_2,_3,name,...) name #define _rep_rev(i,a) repi_rev(i,0,a) #define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i) #define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__) // #define rep(i,...) for(auto i:range(__VA_ARGS__)) // #define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__))) // #define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i) // #define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i) // #define irep(i) for(lint i=0;;++i) // inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;} // inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;} // inline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;} // template<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;} #define all(n) begin(n),end(n) template<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;} template<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;} const vector<lint> dx={1,0,-1,0,1,1,-1,-1}; const vector<lint> dy={0,1,0,-1,1,-1,1,-1}; #define SUM(v) accumulate(all(v),0LL) template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));} #define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__})) #define bit(n,a) ((n>>a)&1) vector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;} using graph=vector<vector<int>>; template<typename T>using graph_w=vector<vector<pair<int,T>>>; template<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<"("<<v.first<<","<<v.second<<")";return out;} constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;} #line 5 "cpplib/graph_tree/graph_template.hpp" /** * @brief グラフテンプレート */ using graph=std::vector<std::vector<int>>; template<typename T> using graph_w=std::vector<std::vector<std::pair<int,T>>>; graph load_graph(int n,int m){graph g(n);for(int i=0;i<m;++i){int s,t;std::cin>>s>>t;--s;--t;g[s].push_back(t);g[t].push_back(s);}return g;} graph load_digraph(int n,int m){graph g(n);for(int i=0;i<m;++i){int s,t;std::cin>>s>>t;--s;--t;g[s].push_back(t);}return g;} graph load_graph0(int n,int m){graph g(n);for(int i=0;i<m;++i){int s,t;std::cin>>s>>t;g[s].push_back(t);g[t].push_back(s);}return g;} graph load_digraph0(int n,int m){graph g(n);for(int i=0;i<m;++i){int s,t;std::cin>>s>>t;g[s].push_back(t);}return g;} graph load_tree(int n){graph g(n);for(int i=0;i<n-1;++i){int s,t;std::cin>>s>>t;--s;--t;g[s].push_back(t);g[t].push_back(s);}return g;} graph load_tree0(int n){graph g(n);for(int i=0;i<n-1;++i){int s,t;std::cin>>s>>t;g[s].push_back(t);g[t].push_back(s);}return g;} graph load_treep(int n){graph g(n);for(int i=0;i<n-1;++i){int t;std::cin>>t;g[i+1].push_back(t);g[t].push_back(i+1);}return g;} template<typename T>graph_w<T> load_graph_weight(int n,int m){graph_w<T> g(n);for(int i=0;i<m;++i){int s,t;T u;std::cin>>s>>t>>u;--s;--t;g[s].emplace_back(t,u);g[t].emplace_back(s,u);}return g;} template<typename T>graph_w<T> load_digraph_weight(int n,int m){graph_w<T> g(n);for(int i=0;i<m;++i){int s,t;T u;std::cin>>s>>t>>u;--s;--t;g[s].emplace_back(t,u);}return g;} template<typename T>graph_w<T> load_graph0_weight(int n,int m){graph_w<T> g(n);for(int i=0;i<m;++i){int s,t;T u;std::cin>>s>>t>>u;g[s].emplace_back(t,u);g[t].emplace_back(s,u);}return g;} template<typename T>graph_w<T> load_digraph0_weight(int n,int m){graph_w<T> g(n);for(int i=0;i<m;++i){int s,t;T u;std::cin>>s>>t>>u;g[s].emplace_back(t,u);}return g;} template<typename T>graph_w<T> load_tree_weight(int n){graph_w<T> g(n);for(int i=0;i<n-1;++i){int s,t;T u;std::cin>>s>>t>>u;--s;--t;g[s].emplace_back(t,u);g[t].emplace_back(s,u);}return g;} template<typename T>graph_w<T> load_tree0_weight(int n){graph_w<T> g(n);for(int i=0;i<n-1;++i){int s,t;T u;std::cin>>s>>t>>u;g[s].emplace_back(t,u);g[t].emplace_back(s,u);}return g;} template<typename T>graph_w<T> load_treep_weight(int n){graph_w<T> g(n);for(int i=0;i<n-1;++i){int t;T u;std::cin>>t>>u;g[i+1].emplace_back(t,u);g[t].emplace_back(i+1,u);}return g;} #line 10 "cpplib/graph_tree/dijkstra.hpp" /** * @brief ダイクストラ法 O((E+V)logE) */ template<typename T,typename F=std::less<T>,typename Add=std::plus<T>> struct dijkstra{ int s; std::vector<T> diff; std::vector<int> par; std::vector<int>used; dijkstra(const graph_w<T>& list,int s,T zero=T(),T inf=std::numeric_limits<T>::max(),F f=F(),Add add=Add()):s(s){ int n=list.size(); diff.resize(n,inf); par.resize(n,-1); used.resize(n,0); std::priority_queue<std::pair<T,int>,std::vector<std::pair<T,int>>,std::greater<std::pair<T,int>>>que; diff[s]=zero; que.push(std::make_pair(T(),s)); while(!que.empty()){ auto d=que.top(); que.pop(); T x; int now; std::tie(x,now)=d; if(used[now])continue; used[now]=1; for(auto d2:list[now]){ T sa; int to; std::tie(to,sa)=d2; T tmp=add(diff[now],sa); if(f(tmp,diff[to])){ diff[to]=tmp; par[to]=now; que.emplace(diff[to],to); } } } } T operator[](int idx){ return diff[idx]; } bool reachable(int t){ return par[t]!=-1; } std::vector<int> get_path(int t){ std::vector<int>res; while(t!=s){ res.push_back(t); t=par[t]; } res.push_back(s); std::reverse(res.begin(),res.end()); return res; } }; #line 3 "cpplib/math/binary_search.hpp" /** * @brief 二分探索 */ template<typename F> long long bs(long long mn,long long mx,F func){ mn--; mx++; while(mx-mn>1){ long long mid=(mn+mx)/2; if(!func(mid))mx=mid; else mn=mid; } return mn; } #line 4 "main.cpp" int main(){ lint n,m,k; cin>>n>>m>>k; vector<vector<pair<lint,lint>>> v(n); rep(i,m){ lint s,t,c; cin>>s>>t>>c; s--;t--; v[s].emplace_back(t,c); v[t].emplace_back(s,c); } auto f=[&](lint x){ vec dif(n,INF),vis(n); deque<lint>que; dif[0]=0; que.push_front(0); while(!que.empty()){ auto now=que.front(); que.pop_front(); if(vis[now])continue; vis[now]=1; for(auto [to,c]:v[now]){ if(chmin(dif[to],dif[now]+(c>x))){ if(c>x){ que.push_back(to); }else{ que.push_front(to); } } } } return !(dif[n-1]<k); }; cout<<bs(0,202020,f)+1<<endl; }