結果
| 問題 | No.1615 Double Down |
| コンテスト | |
| ユーザー |
 Taiki0715
|
| 提出日時 | 2026-07-15 20:39:49 |
| 言語 | C++23 (gcc 15.2.0 + boost 1.90.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 8,082 bytes |
| 記録 | |
| コンパイル時間 | 2,570 ms |
| コンパイル使用メモリ | 357,396 KB |
| 実行使用メモリ | 10,220 KB |
| 最終ジャッジ日時 | 2026-07-15 20:40:16 |
| 合計ジャッジ時間 | 25,963 ms |
|
ジャッジサーバーID （参考情報） |
judge1_0 / judge2_0 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | -- * 3 |
| other | TLE * 1 -- * 53 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T1,typename T2,typename T3>istream &operator>>(istream &is,tuple<T1,T2,T3>&a){is>>std::get<0>(a)>>std::get<1>(a)>>std::get<2>(a);return is;}
template<typename T,size_t n>istream &operator>>(istream &is,array<T,n>&a){for(auto&i:a)is>>i;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define overload3(_1,_2,_3,name,...) name
#define rep1(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
#define rep(...) overload3(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define reps(i,l,r) rep2(i,l,r)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
#define fin(x) return cout<<(x)<<'\n',static_cast<void>(0)
#define yn(x) cout<<((x)?"Yes\n":"No\n")
#define uniq(x) sort(all(x)),x.erase(unique(all(x)),x.end())
template<typename T>
inline int fkey(vector<T>&z,T key){return lower_bound(z.begin(),z.end(),key)-z.begin();}
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
else return init;
}
#ifdef LOCAL
#include<debug.h>
#define SWITCH(a,b) (a)
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
#define SWITCH(a,b) (b)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
struct Timer{
clock_t start;
Timer(){
start=clock();
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout<<fixed<<setprecision(16);
}
inline double now(){return (double)(clock()-start)/1000;}
#ifdef LOCAL
~Timer(){
cerr<<"time:";
cerr<<now();
cerr<<"ms\n";
}
#endif
}timer;
void SOLVE();
int main(){
int testcase=1;
//cin>>testcase;
for(int i=0;i<testcase;i++){
SOLVE();
}
}
#include<optional>
template<typename Cap,typename Cost>
struct MinCostFlow{
private:
struct Edge{
int to;
Cap cap,flow;
Cost cost;
int idx;
};
struct Edge2{
int from,to;
Cap lower,upper;
Cost cost;
};
static constexpr Cap infcap=std::numeric_limits<Cap>::max();
static constexpr Cost infcost=std::numeric_limits<Cost>::max();
int n;
std::vector<Edge>g;
std::vector<int>cnt,ptr;
std::vector<Cap>b;
std::vector<std::pair<int,int>>edges;
std::vector<Edge2>pre_csr;
std::vector<int>pre;
std::vector<Cost>potential,dst;
std::vector<int>pos,neg;
int pos_ptr,neg_ptr;
bool dual(Cap delta){
for(int i=0;i<n;i++)pre[i]=-1,dst[i]=infcost;
pos_ptr=std::remove_if(pos.begin(),pos.begin()+pos_ptr,[&](int i){return b[i]<delta;})-pos.begin();
neg_ptr=std::remove_if(neg.begin(),neg.begin()+neg_ptr,[&](int i){return b[i]>-delta;})-neg.begin();
std::priority_queue<std::pair<Cost,int>,std::vector<std::pair<Cost,int>>,std::greater<std::pair<Cost,int>>>que;
for(int i=0;i<pos_ptr;i++){
dst[pos[i]]=0;
que.push({0,pos[i]});
}
int calced=0;
Cost mx=0;
while(!que.empty()){
auto [d,x]=que.top();
que.pop();
if(dst[x]!=d)continue;
mx=d;
if(b[x]<=-delta&&++calced==neg_ptr)break;
for(int i=ptr[x];i<ptr[x+1];i++){
Edge&e=g[i];
if(e.cap-e.flow>=delta){
if(dst[e.to]>d+potential[x]-potential[e.to]+e.cost){
dst[e.to]=d+potential[x]-potential[e.to]+e.cost;
que.push({dst[e.to],e.to});
pre[e.to]=e.idx;
}
}
}
}
for(int i=0;i<n;i++)potential[i]+=std::min(dst[i],mx);
return calced>0;
}
void primal(Cap delta){
for(int i=0;i<neg_ptr;i++){
if(dst[neg[i]]==infcost)continue;
Cap f=-b[neg[i]];
int now=neg[i];
while(pre[now]!=-1){
Edge&e=g[ptr[now]+pre[now]];
Edge&inv=g[ptr[e.to]+e.idx];
if(f>inv.cap-inv.flow)f=inv.cap-inv.flow;
now=e.to;
}
if(f>b[now])f=b[now];
if(f<delta)continue;
now=neg[i];
while(pre[now]!=-1){
Edge&e=g[ptr[now]+pre[now]];
Edge&inv=g[ptr[e.to]+e.idx];
e.flow-=f;
inv.flow+=f;
pre[now]=-1;
now=e.to;
}
b[now]-=f;
b[neg[i]]+=f;
}
}
public:
MinCostFlow(int n_):n(n_),cnt(n,0),b(n,0),pre(n),potential(n,0),dst(n),pos(n),neg(n),pos_ptr(0),neg_ptr(0){}
void add_source(int u,Cap c){b[u]+=c;}
void add_edge(int from,int to,Cap lower,Cap upper,Cost cost){
pre_csr.push_back({from,to,lower,upper,cost});
edges.emplace_back(from,cnt[from]++);
cnt[to]++;
}
std::optional<Cost>mincost_flow(){
ptr=cnt;
ptr.insert(ptr.begin(),0);
for(int i=0;i<n;i++)ptr[i+1]+=ptr[i];
std::vector<int>ptr2(n,0);
g.resize(ptr[n]);
for(auto&&[from,to,lower,upper,cost]:pre_csr){
int gfrom=ptr2[from],gto=ptr2[to];
if(from==to)gto++;
g[ptr[from]+(ptr2[from]++)]={to,upper,0,cost,gto};
g[ptr[to]+(ptr2[to]++)]={from,-lower,0,-cost,gfrom};
}
Cap delta=1;
for(int i=0;i<n;i++)for(int j=ptr[i];j<ptr[i+1];j++){
Edge&e=g[j];
if(e.cap-e.flow<0){
Cap c=e.cap-e.flow;
e.flow+=c;
Edge&inv=g[ptr[e.to]+e.idx];
inv.flow-=c;
b[i]-=c;
b[e.to]+=c;
}
else while(delta<=e.cap-e.flow)delta<<=1;
}
while(delta){
pos_ptr=neg_ptr=0;
for(int i=0;i<n;i++)for(int j=ptr[i];j<ptr[i+1];j++){
Edge&e=g[j];
Cap c=e.cap-e.flow;
if(c>=delta&&e.cost+potential[i]-potential[e.to]<0){
e.flow+=c;
g[ptr[e.to]+e.idx].flow-=c;
b[i]-=c;
b[e.to]+=c;
}
}
for(int i=0;i<n;i++){
if(b[i]>0)pos[pos_ptr++]=i;
else if(b[i]<0)neg[neg_ptr++]=i;
}
while(dual(delta))primal(delta);
delta>>=1;
}
if(pos_ptr+neg_ptr>0)return std::nullopt;
Cost ret=0;
for(int i=0;i<ptr[n];i++)ret+=g[i].flow*g[i].cost;
return std::make_optional(ret/2);
}
struct Result{
int from,to;
Cap lower,upper,flow;
Cost cost;
friend std::ostream &operator<<(std::ostream &os,const Result&res){
os<<'[';
os<<"from:"<<res.from<<' ';
os<<"to:"<<res.to<<' ';
os<<"lower:"<<res.lower<<' ';
os<<"upper:"<<res.upper<<' ';
os<<"cost:"<<res.cost<<' ';
os<<"flow:"<<res.flow;
os<<']';
return os;
}
};
std::vector<Cost>get_potential(){
std::vector<Cost>ret(n,0);
for(int v=0;v<n;v++)for(int i=0;i<n;i++){
for(int j=ptr[i];j<ptr[i+1];j++){
Edge&e=g[j];
if(e.cap-e.flow>0&&ret[e.to]>ret[i]+e.cost)ret[e.to]=ret[i]+e.cost;
}
}
return ret;
}
std::vector<Result>get_edge(){
std::vector<Result>ret(edges.size());
for(int i=0;i<(int)ret.size();i++){
Edge&e=g[ptr[edges[i].first]+edges[i].second];
Edge&inv=g[ptr[e.to]+e.idx];
ret[i]={edges[i].first,e.to,-inv.cap,e.cap,e.flow,e.cost};
}
return ret;
}
};
void SOLVE(){
int n,m,k,l;
cin>>n>>m>>k>>l;
MinCostFlow<int,ll>mcf(n+m+2);
rep(i,l){
int x,y,z;
cin>>x>>y>>z;
x--,y--;
mcf.add_edge(x,y+n,0,1,-(1ll<<z));
}
rep(i,n)mcf.add_edge(n+m,i,0,1,0);
rep(i,m)mcf.add_edge(i+n,n+m+1,0,1,0);
mcf.add_edge(n+m+1,n+m,0,n+m,0);
cout<<-*mcf.mincost_flow()<<endl;
}