QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#474164 | #602. 最小费用最大流(随机数据) | N_z_# | 10 | 0ms | 3780kb | C++14 | 5.6kb | 2024-07-12 16:27:17 | 2024-07-12 16:27:18 |
Judging History
answer
#if defined(LOCAL) or not defined(LUOGU)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast,unroll-loops")
#endif
#include<bits/stdc++.h>
using namespace std;
struct time_helper
{
#ifdef LOCAL
clock_t time_last;
#endif
time_helper()
{
#ifdef LOCAL
time_last=clock();
#endif
}
void test()
{
#ifdef LOCAL
auto time_now=clock();
std::cerr<<"time:"<<1.*(time_now-time_last)/CLOCKS_PER_SEC<<";all_time:"<<1.*time_now/CLOCKS_PER_SEC<<std::endl;
time_last=time_now;
#endif
}
~time_helper()
{
test();
}
}time_helper;
#ifdef LOCAL
#include"dbg.h"
#else
#define dbg(...) (__VA_ARGS__)
#endif
namespace Fread{const int SIZE=1<<16;char buf[SIZE],*S,*T;inline char getchar(){if(S==T){T=(S=buf)+fread(buf,1,SIZE,stdin);if(S==T)return'\n';}return *S++;}}namespace Fwrite{const int SIZE=1<<16;char buf[SIZE],*S=buf,*T=buf+SIZE;inline void flush(){fwrite(buf,1,S-buf,stdout);S=buf;}inline void putchar(char c){*S++=c;if(S==T)flush();}struct NTR{~NTR(){flush();}}ztr;}
#define getchar Fread::getchar
#define putchar Fwrite::putchar
#define Setprecision 10
#define between '\n'
#define __int128 long long
template<typename T>struct is_char{static constexpr bool value=(std::is_same<T,char>::value||std::is_same<T,signed char>::value||std::is_same<T,unsigned char>::value);};template<typename T>struct is_integral_ex{static constexpr bool value=(std::is_integral<T>::value||std::is_same<T,__int128>::value)&&!is_char<T>::value;};template<typename T>struct is_floating_point_ex{static constexpr bool value=std::is_floating_point<T>::value||std::is_same<T,__float128>::value;};namespace Fastio{struct Reader{template<typename T>typename std::enable_if_t<std::is_class<T>::value,Reader&>operator>>(T&x){for(auto &y:x)*this>>y;return *this;}template<typename T>typename std::enable_if_t<is_integral_ex<T>::value,Reader&>operator>>(T&x){char c=getchar();short f=1;while(c<'0'||c>'9'){if(c=='-')f*=-1;c=getchar();}x=0;while(c>='0'&&c<='9'){x=(x<<1)+(x<<3)+(c^48);c=getchar();}x*=f;return *this;}template<typename T>typename std::enable_if_t<is_floating_point_ex<T>::value,Reader&>operator>>(T&x){char c=getchar();short f=1,s=0;x=0;T t=0;while((c<'0'||c>'9')&&c!='.'){if(c=='-')f*=-1;c=getchar();}while(c>='0'&&c<='9'&&c!='.')x=x*10+(c^48),c=getchar();if(c=='.')c=getchar();else return x*=f,*this;while(c>='0'&&c<='9')t=t*10+(c^48),s++,c=getchar();while(s--)t/=10.0;x=(x+t)*f;return*this;}template<typename T>typename std::enable_if_t<is_char<T>::value,Reader&>operator>>(T&c){c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();return *this;}Reader&operator>>(char*str){int len=0;char c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();while(c!='\n'&&c!=' '&&c!='\r')str[len++]=c,c=getchar();str[len]='\0';return*this;}Reader&operator>>(std::string&str){str.clear();char c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();while(c!='\n'&&c!=' '&&c!='\r')str.push_back(c),c=getchar();return*this;}Reader(){}}cin;const char endl='\n';struct Writer{typedef __int128 mxdouble;template<typename T>typename std::enable_if_t<std::is_class<T>::value,Writer&>operator<<(T x){for(auto &y:x)*this<<y<<between;*this<<'\n';return *this;}template<typename T>typename std::enable_if_t<is_integral_ex<T>::value,Writer&>operator<<(T x){if(x==0)return putchar('0'),*this;if(x<0)putchar('-'),x=-x;static int sta[45];int top=0;while(x)sta[++top]=x%10,x/=10;while(top)putchar(sta[top]+'0'),--top;return*this;}template<typename T>typename std::enable_if_t<is_floating_point_ex<T>::value,Writer&>operator<<(T x){if(x<0)putchar('-'),x=-x;x+=pow(10,-Setprecision)/2;mxdouble _=x;x-=(T)_;static int sta[45];int top=0;while(_)sta[++top]=_%10,_/=10;if(!top)putchar('0');while(top)putchar(sta[top]+'0'),--top;putchar('.');for(int i=0;i<Setprecision;i++)x*=10;_=x;while(_)sta[++top]=_%10,_/=10;for(int i=0;i<Setprecision-top;i++)putchar('0');while(top)putchar(sta[top]+'0'),--top;return*this;}template<typename T>typename std::enable_if_t<is_char<T>::value,Writer&>operator<<(T c){putchar(c);return*this;}Writer&operator<<(char*str){int cur=0;while(str[cur])putchar(str[cur++]);return *this;}Writer&operator<<(const char*str){int cur=0;while(str[cur])putchar(str[cur++]);return*this;}Writer&operator<<(std::string str){int st=0,ed=str.size();while(st<ed)putchar(str[st++]);return*this;}Writer(){}}cout;}
#define cin Fastio::cin
#define cout Fastio::cout
#define endl Fastio::endl
void solve();
main()
{
int t=1;
// cin>>t;
while(t--)solve();
}
int flow[30001],dis[401],arc[401];
int n,m,s,t;
vector<tuple<int,int,int>>e[401];
bool spfa(int s,int t)
{
for(int x=1;x<=n;x++)
dis[x]=1e9;
dis[s]=0;
queue<int>q;
q.push(s);
while(!q.empty())
{
int u=q.front();
if(u==t)return 1;
q.pop();
for(auto [v,w,id]:e[u])
if(flow[id]&&dis[v]>dis[u]+w)
{
dis[v]=dis[u]+w;
q.push(v);
}
}
return 0;
}
pair<long long,long long>dfs(int u,int t,long long lim)
{
if(u==t)return {lim,0};
long long fl=0,ct=0;
for(int &x=arc[u];x<e[u].size();x++)
{
auto [v,w,id]=e[u][x];
if(dis[v]!=dis[u]+w||!flow[id])continue;
auto [nf,nc]=dfs(v,t,min<long long>(lim,flow[id]));
ct+=nc;
flow[id]-=nf,flow[id^1]+=nf;
fl+=nf,lim-=nf;
ct+=w*nf;
if(lim==0)break;
}
return {fl,ct};
}
pair<long long,long long>dinic(int s,int t)
{
long long res=0,ct=0;
while(spfa(s,t))
{
for(int x=1;x<=n;x++)
arc[x]=0;
auto [f,c]=dfs(s,t,1e18);
res+=f,ct+=c;
}
return {res,ct};
}
void solve()
{
cin>>n>>m;
s=1,t=n;
for(int x=0;x<m;x++)
{
int u,v,c,w;
cin>>u>>v>>c>>w;
flow[2*x]=c;
flow[2*x+1]=0;
e[u].emplace_back(v,w,2*x);
e[v].emplace_back(u,w,2*x+1);
}
auto [f,c]=dinic(s,t);
cout<<f<<' '<<c<<endl;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 10
Accepted
time: 0ms
memory: 3780kb
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: 0
Memory Limit Exceeded
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:
result:
Test #3:
score: 0
Memory Limit Exceeded
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:
result:
Test #4:
score: 0
Memory Limit Exceeded
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:
result:
Test #5:
score: 0
Memory Limit Exceeded
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:
result:
Test #6:
score: 0
Memory Limit Exceeded
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:
result:
Test #7:
score: 0
Memory Limit Exceeded
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:
result:
Test #8:
score: 0
Memory Limit Exceeded
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:
result:
Test #9:
score: 0
Memory Limit Exceeded
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:
result:
Test #10:
score: 0
Memory Limit Exceeded
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...