QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#340856 | #602. 最小费用最大流(随机数据) | ffffyc# | 100 ✓ | 1302ms | 4336kb | C++14 | 2.2kb | 2024-02-29 13:30:42 | 2024-02-29 13:30:43 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define ll long long
namespace IO{//by cyffff
int len=0;
char ibuf[(1<<21)+1],*iS,*iT,out[(1<<25)+1];
#if ONLINE_JUDGE
#define gh() (iS==iT?iT=(iS=ibuf)+fread(ibuf,1,(1<<21)+1,stdin),(iS==iT?EOF:*iS++):*iS++)
#else
#define gh() getchar()
#endif
#define reg register
inline int read(){
reg char ch=gh();
reg int x=0;
reg char t=0;
while(ch<'0'||ch>'9') t|=ch=='-',ch=gh();
while(ch>='0'&&ch<='9') x=x*10+(ch^48),ch=gh();
return t?-x:x;
}
inline void putc(char ch){
out[len++]=ch;
}
template<class T>
inline void write(T x){
if(x<0)putc('-'),x=-x;
if(x>9)write(x/10);
out[len++]=x%10+48;
}
inline void flush(){
fwrite(out,1,len,stdout);
len=0;
}
inline char getc(){
char ch=gh();
while(ch<'A'||ch>'Z') ch=gh();
return ch;
}
}
using IO::read;
using IO::write;
using IO::flush;
using IO::getc;
using IO::putc;
const int N=400+10,M=3e4+10;
const ll INF=1e12;
int n,m,head[N],cnt=1;
struct Edge{
int to,nxt,fl,c;
}a[M];
inline void Add(int u,int v,int w,int c){
a[++cnt]={v,head[u],w,c},head[u]=cnt;
}
inline void add(int u,int v,int w,int c){
Add(u,v,w,c),Add(v,u,0,-c);
}
int s,t,fr[N];
ll dis[N];
bool vis[N];
inline bool bfs(){
for(int i=1;i<=n;i++)
dis[i]=INF,vis[i]=fr[i]=0;
queue<int>q;
q.push(s),dis[s]=0,vis[s]=1;
while(!q.empty()){
int x=q.front();
q.pop();
vis[x]=0;
for(int i=head[x];i;i=a[i].nxt){
int t=a[i].to;
if(a[i].fl&&dis[t]>dis[x]+a[i].c){
dis[t]=dis[x]+a[i].c,fr[t]=x;
if(!vis[t]) q.push(t),vis[t]=1;
}
}
}
return dis[t]<INF;
}
ll ans2;
inline ll dfs(int x,ll fl){
if(x==t) return fl;
vis[x]=1;
ll s=0;
for(int i=head[x];i&&fl;i=a[i].nxt){
int t=a[i].to;
if(fr[t]==x&&dis[t]==dis[x]+a[i].c&&!vis[t]&&a[i].fl){
ll res=dfs(t,min(fl,a[i].fl+0ll));
a[i].fl-=res,a[i^1].fl+=res,fl-=res,s+=res;
ans2+=res*a[i].c;
}
}
vis[x]=0;
return s;
}
inline ll dinic(){
ll sum=0;
while(bfs())
sum+=dfs(s,INF);
return sum;
}
int main(){
n=read(),m=read();
for(int i=1;i<=m;i++){
int u=read(),v=read(),w=read(),c=read();
add(u,v,w,c);
}
s=1,t=n;
write(dinic()),putc(' '),write(ans2);
flush();
}
详细
Test #1:
score: 10
Accepted
time: 1ms
memory: 3492kb
input:
8 27 2 3 2147483647 100 1 3 1 100 2 4 2147483647 10 1 4 1 10 2 4 2147483647 10 1 4 1 10 2 8 3 0 3 5 2147483647 100 1 5 1 100 3 8 1 0 3 2 2147483647 0 4 5 2147483647 10 1 5 1 10 4 8 1 0 4 2 2147483647 0 5 6 2147483647 1 1 6 1 1 5 6 2147483647 1 1 6 1 1 5 7 2147483647 1 1 7 1 1 5 8 3 0 5 2 2147483647 ...
output:
8 243
result:
ok 2 number(s): "8 243"
Test #2:
score: 10
Accepted
time: 0ms
memory: 3608kb
input:
12 49 2 10 2147483647 5 1 10 1 5 2 5 2147483647 50 1 5 1 50 2 9 2147483647 8 1 9 1 8 2 8 2147483647 47 1 8 1 47 2 11 2147483647 17 1 11 1 17 2 12 5 0 3 12 0 0 3 2 2147483647 0 4 6 2147483647 18 1 6 1 18 4 11 2147483647 12 1 11 1 12 4 9 2147483647 14 1 9 1 14 4 12 3 0 4 2 2147483647 0 5 11 2147483647...
output:
15 436
result:
ok 2 number(s): "15 436"
Test #3:
score: 10
Accepted
time: 1ms
memory: 3600kb
input:
27 169 2 15 2147483647 24 1 15 1 24 2 19 2147483647 96 1 19 1 96 2 12 2147483647 49 1 12 1 49 2 13 2147483647 75 1 13 1 75 2 24 2147483647 2 1 24 1 2 2 27 5 0 3 27 0 0 3 2 2147483647 0 4 11 2147483647 99 1 11 1 99 4 3 2147483647 85 1 3 1 85 4 27 2 0 4 2 2147483647 0 5 27 0 0 5 2 2147483647 0 6 9 214...
output:
60 4338
result:
ok 2 number(s): "60 4338"
Test #4:
score: 10
Accepted
time: 31ms
memory: 3640kb
input:
77 2149 2 42 2147483647 33 1 42 1 33 2 68 2147483647 30 1 68 1 30 2 76 2147483647 13 1 76 1 13 2 51 2147483647 93 1 51 1 93 2 12 2147483647 39 1 12 1 39 2 57 2147483647 74 1 57 1 74 2 70 2147483647 21 1 70 1 21 2 73 2147483647 24 1 73 1 24 2 52 2147483647 54 1 52 1 54 2 15 2147483647 99 1 15 1 99 2 ...
output:
1000 74606
result:
ok 2 number(s): "1000 74606"
Test #5:
score: 10
Accepted
time: 145ms
memory: 3796kb
input:
102 4199 2 48 2147483647 42 1 48 1 42 2 85 2147483647 50 1 85 1 50 2 22 2147483647 83 1 22 1 83 2 95 2147483647 97 1 95 1 97 2 82 2147483647 34 1 82 1 34 2 25 2147483647 72 1 25 1 72 2 4 2147483647 17 1 4 1 17 2 47 2147483647 10 1 47 1 10 2 71 2147483647 12 1 71 1 12 2 68 2147483647 39 1 68 1 39 2 2...
output:
2000 161420
result:
ok 2 number(s): "2000 161420"
Test #6:
score: 10
Accepted
time: 141ms
memory: 3792kb
input:
102 4199 2 79 2147483647 13 1 79 1 13 2 83 2147483647 73 1 83 1 73 2 75 2147483647 90 1 75 1 90 2 30 2147483647 92 1 30 1 92 2 54 2147483647 25 1 54 1 25 2 66 2147483647 53 1 66 1 53 2 52 2147483647 37 1 52 1 37 2 63 2147483647 46 1 63 1 46 2 11 2147483647 20 1 11 1 20 2 55 2147483647 53 1 55 1 53 2...
output:
2000 143072
result:
ok 2 number(s): "2000 143072"
Test #7:
score: 10
Accepted
time: 143ms
memory: 3780kb
input:
102 4199 2 39 2147483647 45 1 39 1 45 2 51 2147483647 11 1 51 1 11 2 86 2147483647 63 1 86 1 63 2 23 2147483647 46 1 23 1 46 2 48 2147483647 63 1 48 1 63 2 87 2147483647 8 1 87 1 8 2 73 2147483647 63 1 73 1 63 2 5 2147483647 52 1 5 1 52 2 80 2147483647 21 1 80 1 21 2 31 2147483647 44 1 31 1 44 2 101...
output:
2000 146132
result:
ok 2 number(s): "2000 146132"
Test #8:
score: 10
Accepted
time: 1193ms
memory: 4336kb
input:
302 10599 2 72 2147483647 169 1 72 1 169 2 260 2147483647 165 1 260 1 165 2 12 2147483647 108 1 12 1 108 2 16 2147483647 26 1 16 1 26 2 28 2147483647 148 1 28 1 148 2 7 2147483647 74 1 7 1 74 2 139 2147483647 199 1 139 1 199 2 231 2147483647 9 1 231 1 9 2 287 2147483647 123 1 287 1 123 2 135 2147483...
output:
5000 1106316
result:
ok 2 number(s): "5000 1106316"
Test #9:
score: 10
Accepted
time: 1302ms
memory: 4100kb
input:
302 10599 2 222 2147483647 132 1 222 1 132 2 17 2147483647 7 1 17 1 7 2 177 2147483647 253 1 177 1 253 2 90 2147483647 195 1 90 1 195 2 128 2147483647 289 1 128 1 289 2 42 2147483647 193 1 42 1 193 2 213 2147483647 133 1 213 1 133 2 263 2147483647 293 1 263 1 293 2 50 2147483647 155 1 50 1 155 2 228...
output:
5000 1290871
result:
ok 2 number(s): "5000 1290871"
Test #10:
score: 10
Accepted
time: 1227ms
memory: 4044kb
input:
302 10599 2 176 2147483647 289 1 176 1 289 2 190 2147483647 99 1 190 1 99 2 10 2147483647 96 1 10 1 96 2 240 2147483647 165 1 240 1 165 2 273 2147483647 205 1 273 1 205 2 248 2147483647 194 1 248 1 194 2 220 2147483647 122 1 220 1 122 2 194 2147483647 167 1 194 1 167 2 8 2147483647 67 1 8 1 67 2 227...
output:
5000 1395897
result:
ok 2 number(s): "5000 1395897"