#line 1 "a.cpp" #include #include using namespace std; #line 1 "/home/kotatsugame/library/graph/MCF.cpp" //Minimum Cost Flow O(FE log V) //Minimum Cost Flow with negative cost O(NE+FE log V) #line 4 "/home/kotatsugame/library/graph/MCF.cpp" #include #include #include #include #include template struct MCF{ struct edge{ int to,rev,cap; T cost; }; int n; bool negedge,ok; vector >G; vectorh,d; vectorpv,pe; MCF(int n_=0):n(n_),negedge(false),G(n_),h(n_),d(n_),pv(n_),pe(n_){} void add_edge(int from,int to,int cap,T cost) { if(cost<0)negedge=true; G[from].push_back({to,(int)G[to].size(),cap,cost}); G[to].push_back({from,(int)G[from].size()-1,0,-cost}); } T min_cost_flow(int s,int t,int f)//ans or -1 { ok=false; if(negedge) { fill(h.begin(),h.end(),numeric_limits::max()); h[s]=0; for(int tm=0;tm::max()) { for(const edge&e:G[i]) { if(e.cap>0&&h[e.to]>h[i]+e.cost) { h[e.to]=h[i]+e.cost; ch=true; } } } if(!ch)break; assert(tm0) { priority_queue,vector >,greater > >P; fill(d.begin(),d.end(),numeric_limits::max()); d[s]=0; P.push(make_pair(0,s)); while(!P.empty()) { pairp=P.top();P.pop(); if(d[p.second]0&&d[e.to]>d[p.second]+e.cost+h[p.second]-h[e.to]) { d[e.to]=d[p.second]+e.cost+h[p.second]-h[e.to]; pv[e.to]=p.second; pe[e.to]=i; P.push(make_pair(d[e.to],e.to)); } } } if(d[t]==numeric_limits::max())return -1; for(int u=0;u>N>>M; vector >mx(N),mi(N); for(int i=0;i>A[i]>>B[i]>>C[i]; if(A[i]>C[i])swap(A[i],C[i]); mx[i]=make_pair(C[i],i); mi[i]=make_pair(A[i],i); } MCFP(N*4+2); int st=N*4,go=st+1; sort(mx.begin(),mx.end()); sort(mi.begin(),mi.end()); for(int i=1;i0)P.add_edge(i,N+mx[mxd-1].second,1,-B[i]); } for(int i=0;i=M)cout<<"KADOMATSU!"<