結果
問題 | No.1316 Maximum Minimum Spanning Tree |
ユーザー |
![]() |
提出日時 | 2020-12-19 15:44:23 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 5 ms / 2,000 ms |
コード長 | 8,667 bytes |
コンパイル時間 | 2,687 ms |
コンパイル使用メモリ | 225,008 KB |
最終ジャッジ日時 | 2025-01-17 03:51:58 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 78 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll=long long;#define int ll#define rng(i,a,b) for(int i=int(a);i<int(b);i++)#define rep(i,b) rng(i,0,b)#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)#define per(i,b) gnr(i,0,b)#define pb push_back#define eb emplace_back#define a first#define b second#define bg begin()#define ed end()#define all(x) x.bg,x.ed#define si(x) int(x.size())#ifdef LOCAL#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl#else#define dmp(x) void(0)#endiftemplate<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}template<class t> using vc=vector<t>;template<class t> using vvc=vc<vc<t>>;using pi=pair<int,int>;using vi=vc<int>;template<class t,class u>ostream& operator<<(ostream& os,const pair<t,u>& p){return os<<"{"<<p.a<<","<<p.b<<"}";}template<class t> ostream& operator<<(ostream& os,const vc<t>& v){os<<"{";for(auto e:v)os<<e<<",";return os<<"}";}#define mp make_pair#define mt make_tuple#define one(x) memset(x,-1,sizeof(x))#define zero(x) memset(x,0,sizeof(x))#ifdef LOCALvoid dmpr(ostream&os){os<<endl;}template<class T,class... Args>void dmpr(ostream&os,const T&t,const Args&... args){os<<t<<" ";dmpr(os,args...);}#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)#else#define dmp2(...) void(0)#endifusing uint=unsigned;using ull=unsigned long long;template<class t,size_t n>ostream& operator<<(ostream&os,const array<t,n>&a){return os<<vc<t>(all(a));}template<int i,class T>void print_tuple(ostream&,const T&){}template<int i,class T,class H,class ...Args>void print_tuple(ostream&os,const T&t){if(i)os<<",";os<<get<i>(t);print_tuple<i+1,T,Args...>(os,t);}template<class ...Args>ostream& operator<<(ostream&os,const tuple<Args...>&t){os<<"{";print_tuple<0,tuple<Args...>,Args...>(os,t);return os<<"}";}template<class t>void print(t x,int suc=1){cout<<x;if(suc==1)cout<<"\n";if(suc==2)cout<<" ";}ll read(){ll i;cin>>i;return i;}vi readvi(int n,int off=0){vi v(n);rep(i,n)v[i]=read()+off;return v;}pi readpi(int off=0){int a,b;cin>>a>>b;return pi(a+off,b+off);}template<class T>void print(const vector<T>&v,int suc=1){rep(i,v.size())print(v[i],i==int(v.size())-1?suc:2);}string readString(){string s;cin>>s;return s;}template<class T>T sq(const T& t){return t*t;}//#define CAPITALvoid yes(bool ex=true){#ifdef CAPITALcout<<"YES"<<"\n";#elsecout<<"Yes"<<"\n";#endifif(ex)exit(0);#ifdef LOCALcout.flush();#endif}void no(bool ex=true){#ifdef CAPITALcout<<"NO"<<"\n";#elsecout<<"No"<<"\n";#endifif(ex)exit(0);#ifdef LOCALcout.flush();#endif}void possible(bool ex=true){#ifdef CAPITALcout<<"POSSIBLE"<<"\n";#elsecout<<"Possible"<<"\n";#endifif(ex)exit(0);#ifdef LOCALcout.flush();#endif}void impossible(bool ex=true){#ifdef CAPITALcout<<"IMPOSSIBLE"<<"\n";#elsecout<<"Impossible"<<"\n";#endifif(ex)exit(0);#ifdef LOCALcout.flush();#endif}constexpr ll ten(int n){return n==0?1:ten(n-1)*10;}const ll infLL=LLONG_MAX/3;#ifdef intconst int inf=infLL;#elseconst int inf=INT_MAX/2-100;#endifint topbit(signed t){return t==0?-1:31-__builtin_clz(t);}int topbit(ll t){return t==0?-1:63-__builtin_clzll(t);}int botbit(signed a){return a==0?32:__builtin_ctz(a);}int botbit(ll a){return a==0?64:__builtin_ctzll(a);}int popcount(signed t){return __builtin_popcount(t);}int popcount(ll t){return __builtin_popcountll(t);}bool ispow2(int i){return i&&(i&-i)==i;}ll mask(int i){return (ll(1)<<i)-1;}bool inc(int a,int b,int c){return a<=b&&b<=c;}template<class t> void mkuni(vc<t>&v){sort(all(v));v.erase(unique(all(v)),v.ed);}ll rand_int(ll l, ll r) { //[l, r]#ifdef LOCALstatic mt19937_64 gen;#elsestatic mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());#endifreturn uniform_int_distribution<ll>(l, r)(gen);}template<class t>void myshuffle(vc<t>&a){rep(i,si(a))swap(a[i],a[rand_int(0,i)]);}template<class t>int lwb(const vc<t>&v,const t&a){return lower_bound(all(v),a)-v.bg;}vvc<int> readGraph(int n,int m){vvc<int> g(n);rep(i,m){int a,b;cin>>a>>b;//sc.read(a,b);a--;b--;g[a].pb(b);g[b].pb(a);}return g;}vvc<int> readTree(int n){return readGraph(n,n-1);}using int128=__int128_t;using uint128=unsigned __int128_t;//-が来た場合はまだわからんistream& operator>>(istream&is,int128&res){res=0;string s;is>>s;int head=0;int128 w=1;if(s[0]=='_'){w=-1;head++;}while(head<si(s)){res=res*10+s[head++]-'0';}res*=w;return is;}ostream& operator<<(ostream&os,int128 i){if(i==0)return os<<0;static char buf[100];if(i<0){os<<"-";i=-i;}int p=0;while(i){buf[p++]='0'+i%10;i/=10;}reverse(buf,buf+p);buf[p]=0;return os<<buf;}int128 abs128(int128 a){return a<0?-a:a;}int botbit(int128 a){const int128 m=(int128(1)<<64)-1;if(a&m)return __builtin_ctzll(ll(a));else return __builtin_ctzll(ll(a>>64));}int128 gcd(int128 a,int128 b){if(a<0)a=-a;if(b<0)b=-b;if(a==0)return b;if(b==0)return a;int128 s=botbit(a|b);a>>=botbit(a);do{b>>=botbit(b);if(a>b)swap(a,b);b-=a;}while(b);return a<<s;}const int128 inf128=int128(1)<<122;//work without define int ll//maxflow with small constant//CF Global11 G//bfs を途中で打ち切る,dfs が逆順//ae の 4th argument は逆辺の capacity//無向辺を貼りたい場合などに,有効・・・template<class d>struct maxflow{struct E{int to,nx;d cap;};int n;vc<E> es;vi head,q;vc<pi> itr,lv;int curt;maxflow(int nn):n(nn),head(n,-1),q(n),itr(n),lv(n),curt(0){}int ae(int s,int t,d c,d c2=0){int pres=head[s];int pret=head[t];head[s]=si(es);es.pb({t,pres,c});head[t]=si(es);es.pb({s,pret,c2});return head[s];}void bfs(int s,int t=-1){lv[s]=pi(0,curt);int l=0,r=0;q[r++]=s;while(l<r){int v=q[l++];for(int id=head[v];id!=-1;id=es[id].nx){auto e=es[id];if(e.cap>0&&lv[e.to].b<curt){lv[e.to]=pi(lv[v].a+1,curt);q[r++]=e.to;if(e.to==t)return;}}}}d dfs(int v,int t,d f){if(v==t)return f;if(itr[v].b<curt)itr[v]=pi(head[v],curt);d res=0;while(itr[v].a!=-1){E& e=es[itr[v].a];E& rev=es[itr[v].a^1];if(rev.cap>0&&lv[e.to].a==lv[v].a-1&&lv[e.to].b==curt){d a=dfs(e.to,t,min(f,rev.cap));if(a>0){rev.cap-=a;e.cap+=a;res+=a;f-=a;if(f<=0)break;}}itr[v].a=e.nx;}return res;}d calc(int s,int t,d mx=inf){d f=0;while(f<mx){curt++;bfs(s,t);if(lv[t].b<curt)return f;f+=dfs(t,s,mx-f);}return f;}//s:false, t:truevc<bool> getcut(){vc<bool> res(n);rep(i,n)res[i]=lv[i].b<curt;return res;}};//VERIFY: yosupo//KUPC2017J//AOJDSL1A//without rankstruct unionfind{vi p,s;int c;unionfind(int n):p(n,-1),s(n,1),c(n){}int find(int a){return p[a]==-1?a:(p[a]=find(p[a]));}//set b to a child of abool unite(int a,int b){a=find(a);b=find(b);if(a==b)return false;p[b]=a;s[a]+=s[b];c--;return true;}bool same(int a,int b){return find(a)==find(b);}int sz(int a){return s[find(a)];}};struct Edge{int a,b,c,d;void initread(){cin>>a>>b>>c>>d;a--;b--;}bool operator<(const Edge&e){return c<e.c;}};void slv(){int n,m,k;cin>>n>>m>>k;vc<Edge> es(m);rep(i,m)es[i].initread();sort(all(es));unionfind uf(n);int ans=k*(n-1)*es[0].c;vc<Edge> alive;rng(used,1,m+1){alive.pb(es[used-1]);int s=si(alive);maxflow<int> mf(1+s+n+1);vi idx;int tot=0;rep(i,s){int v=alive[i].d+(i==s-1?k:0);idx.pb(mf.ae(0,1+i,v));tot+=v;mf.ae(1+i,1+s+uf.find(alive[i].a),inf);mf.ae(1+i,1+s+uf.find(alive[i].b),inf);}rep(i,n)mf.ae(1+s+i,1+s+n,k);tot-=mf.calc(0,1+s+n);dmp2(used,tot);if(tot>0){auto c=mf.getcut();dmp(c);rep(i,s){bool u=!c[1+i];if(i==s-1)assert(u);if(u)uf.unite(alive[i].a,alive[i].b);}}int w=k*(uf.c-1);vc<Edge> tmp;rep(i,s){if(!uf.same(alive[i].a,alive[i].b)){tmp.pb(alive[i]);w-=alive[i].d;}}swap(tmp,alive);if(used==m){if(w>0){print(-1);return;}}else{ans+=w*(es[used].c-es[used-1].c);}}print(ans);}signed main(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(20);//int t;cin>>t;rep(_,t)slv();}