CodeForcesGym 100517H Hentium Scheduling

Hentium Scheduling

Time Limit: 2000ms

Memory Limit: 262144KB

This problem will be judged on CodeForcesGym. Original ID: 100517H
64-bit integer IO format: %I64d      Java class name: (Any)

 

解题：我擦，裸的网络流啊，居然没发现

 #include <bits/stdc++.h>
 using namespace std;
 typedef long long LL;
 const LL INF = 0x3f3f3f3f3f3f3f3f;
 const int maxn = ;
 struct arc {
     int to,next;
     LL flow;
     arc(int x = ,LL y = ,int z = -) {
         to = x;
         flow = y;
         next = z;
     }
 } e[];
 int head[maxn],d[maxn],cur[maxn],tot,S,T;
 void add(int u,int v,LL flow) {
     e[tot] = arc(v,flow,head[u]);
     head[u] = tot++;
     e[tot] = arc(u,,head[v]);
     head[v] = tot++;
 }
 bool bfs() {
     queue<int>q;
     memset(d,-,sizeof d);
     d[S] = ;
     q.push(S);
     while(!q.empty()) {
         int u = q.front();
         q.pop();
         for(int i = head[u]; ~i; i = e[i].next) {
             if(e[i].flow && d[e[i].to] == -) {
                 d[e[i].to] = d[u] + ;
                 q.push(e[i].to);
             }
         }
     }
     return d[T] > -;
 }
 LL dfs(int u,LL low) {
     if(u == T) return low;
     LL a,tmp = ;
     for(int &i = cur[u]; ~i; i = e[i].next) {
         if(e[i].flow && d[e[i].to] == d[u]+&&(a=dfs(e[i].to,min(low,e[i].flow)))) {
             e[i].flow -= a;
             e[i^].flow += a;
             low -= a;
             tmp += a;
             if(!low) break;
         }
     }
     if(!tmp) d[u] = -;
     return tmp;
 }
 LL dinic(LL ret = ) {
     while(bfs()) {
         memcpy(cur,head,sizeof head);
         ret += dfs(S,INF);
     }
     return ret;
 }
 bool vis[maxn];
 void dfs(int u) {
     vis[u] = true;
     for(int i = head[u]; ~i; i = e[i].next)
         if(e[i].flow && !vis[e[i].to]) dfs(e[i].to);
 }
 int main() {
 #define NAME "hentium"
     freopen(NAME".in","r",stdin);
     freopen(NAME".out","w",stdout);
     int n,a,b;
     while(scanf("%d",&n),n) {
         memset(head,-,sizeof head);
         S = tot = ;
         T = n + ;
         for(int i = ; i <= n; ++i) {
             scanf("%d%d",&a,&b);
             add(S,i,a);
             add(i,T,b);
         }
         for(int i = ; i <= n; ++i)
             for(int j = ; j <= n; ++j) {
                 scanf("%d",&a);
                 if(a) add(i,j,a);
             }
         printf("%I64d\n",dinic());
         memset(vis,false,sizeof vis);
         dfs(S);
         for(int i = ; i <= n; ++i)
             printf("%d%c",vis[i]?:,i == n?'\n':' ');
     }
     return ;
 }