結果
問題 | No.2642 Don't cut line! |
ユーザー |
|
提出日時 | 2024-02-19 22:37:50 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,035 bytes |
コンパイル時間 | 5,288 ms |
コンパイル使用メモリ | 277,084 KB |
最終ジャッジ日時 | 2025-02-19 17:21:46 |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 30 WA * 3 |
ソースコード
#include<bits/stdc++.h>#include<atcoder/all>using namespace std;using namespace atcoder;typedef long long int ll;typedef long double ld;typedef vector<ll> vi;typedef vector<vi> vvi;typedef vector<vvi> vvvi;typedef vector<vvvi> vvvvi;typedef vector<bool> vb;typedef vector<vb> vvb;typedef vector<vvb> vvvb;typedef vector<vvvb> vvvvb;typedef pair<ll,ll> pi;typedef pair<ll,pi> ppi;typedef pair<ll,ppi> pppi;typedef pair<ll,pppi> ppppi;#define FOR(i,l,r) for(ll i=l;i<r;i++)#define REP(i,n) FOR(i,0,n)#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)#define RREP(i,n) RFOR(i,0,n)#define ALL(x) x.begin(),x.end()#define F first#define S second#define BS(A,x) binary_search(ALL(A),x)#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())#define COU(A,x) (UB(A,x)-LB(A,x))#define sz(c) ((ll)(c).size())/*#include<boost/multiprecision/cpp_int.hpp>namespace mp=boost::multiprecision;using Bint=mp::cpp_int;*/template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;}template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}vi fast_mod_convolution(vi&a,vi&b,ll mod){const ll m1=167772161,m2=469762049,m3=1224736769;const ll m1_inv_m2=inv_mod(m1,m2);const ll m12_inv_m3=inv_mod(m1*m2,m3);const ll m12_mod=m1*m2%mod;auto x=convolution<m1>(a,b);auto y=convolution<m2>(a,b);auto z=convolution<m3>(a,b);vector<ll>ret(sz(a)+sz(b)-1);REP(i,sz(ret)){ll v1=(y[i]-x[i])*m1_inv_m2%m2;if(v1<0)v1+=m2;ll v2=(z[i]-(x[i]+m1*v1)%m3)*m12_inv_m3%m3;if(v2<0)v2+=m3;ret[i]=(x[i]+m1*v1+m12_mod*v2)%mod;}return ret;}const ld EPS=1e-8;//*using mint=modint998244353;const ll mod=998244353;//*//*using mint=modint1000000007;const ll mod=1000000007;//*///using mint=modint;//*typedef vector<mint> vm;typedef vector<vm> vvm;typedef vector<vvm> vvvm;typedef vector<vvvm> vvvvm;ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;}//*/int main(){ll N,K,C;cin>>N>>K>>C;vi u(K),v(K),w(K),p(K);REP(i,K){cin>>u[i]>>v[i]>>w[i]>>p[i];u[i]--;v[i]--;}vi idx(K);REP(i,K)idx[i]=i;sort(ALL(idx),[&](ll i,ll j){return w[i]<w[j];});dsu D(N);ll W=0,Pr=0;vector<vector<pi>>E(N);for(auto i:idx)if(!D.same(u[i],v[i])){D.merge(u[i],v[i]);W+=w[i];chmax(Pr,p[i]);E[u[i]].emplace_back(pi(v[i],w[i]));E[v[i]].emplace_back(pi(u[i],w[i]));}vi P(N),dist(N,1e18);queue<ll>Q;Q.emplace(0);dist[0]=0;while(sz(Q)){ll v=Q.front();Q.pop();for(auto[u,w]:E[v])if(chmin(dist[u],dist[v]+w))P[u]=v,Q.emplace(u);}vvi T(20,vi(N)),U(20,vi(N));REP(i,N)T[0][i]=P[i],U[0][i]=dist[i]-dist[P[i]];FOR(i,1,20)REP(j,N)T[i][j]=T[i-1][T[i-1][j]],U[i][j]=max(U[i-1][j],U[i-1][T[i-1][j]]);auto up=[&](ll v,ll d){chmin(d,N);REP(i,20)if((d>>i)%2)v=T[i][v];return v;};auto lca=[&](ll u,ll v){if(dist[u]<dist[v])v=up(v,dist[v]-dist[u]);if(dist[v]<dist[u])u=up(u,dist[u]-dist[v]);ll l=-1,r=N;while(r-l>1){ll m=(l+r)/2;if(up(u,m)==up(v,m))r=m;else l=m;}return up(v,r);};auto ma=[&](ll u,ll v){ll w=lca(u,v),ret=0;ll du=dist[u]-dist[w],dv=dist[v]-dist[w];REP(i,20)if((du>>i)%2)chmax(ret,U[i][u]),u=T[i][u];REP(i,20)if((dv>>i)%2)chmax(ret,U[i][v]),v=T[i][v];return ret;};ll ans=-1;REP(i,K)if(w[i]<=C-W+ma(u[i],v[i]))chmax(ans,max(Pr,p[i]));cout<<ans<<endl;return 0;}