【网络流】 HDU 2883 kebab 离散
2014-09-30 19:39
316 查看
思路来自。。
#include <stdio.h> #include <string.h> #include <stdlib.h> #include <string> #include <iostream> #include <algorithm> #include <sstream> #include <cmath> using namespace std; #include <queue> #include <stack> #include <vector> #include <deque> #include <set> #include <map> #include <time.h>; #define cler(arr, val) memset(arr, val, sizeof(arr)) #define FOR(i,a,b) for(int i=a;i<=b;i++) #define IN freopen ("in.txt" , "r" , stdin); #define OUT freopen ("out.txt" , "w" , stdout); typedef long long LL; const int MAXN = 2503; const int MAXM = 15006; const int INF = 0x3f3f3f3f; const int mod = 1000000007; struct Edge { int to,next,cap,flow; }edge[MAXM];//注意是MAXM int tol; int head[MAXN]; int gap[MAXN],dep[MAXN],cur[MAXN]; void init() { tol = 0; memset(head,-1,sizeof (head)); } void addedge (int u,int v,int w,int rw = 0) { edge[tol].to = v; edge[tol].cap = w; edge[tol].flow = 0; edge[tol].next = head[u]; head[u] = tol++; edge[tol].to = u; edge[tol].cap = rw; edge[tol].flow = 0; edge[tol].next = head[v]; head[v] = tol++; } int Q[MAXN]; void BFS(int start,int end) { memset(dep,-1,sizeof(dep)); memset(gap,0,sizeof(gap)); gap[0] = 1; int front = 0, rear = 0; dep[end] = 0; Q[rear++] = end; while(front != rear) { int u = Q[front++]; for(int i = head[u]; i != -1; i = edge[i].next) { int v = edge[i]. to; if(dep[v] != -1)continue; Q[rear++] = v; dep[v] = dep[u] + 1; gap[dep[v]]++; } } } int S[MAXN]; int sap(int start,int end, int N) { BFS(start,end); memcpy(cur,head,sizeof(head)); int top = 0; int u = start; int ans = 0; int i; while(dep[start] < N) { if(u == end) { int Min = INF; int inser; for( i = 0;i < top;i++) { if(Min > edge[S[i]].cap - edge[S[i]].flow) { Min = edge[S[i]].cap - edge[S[i]].flow; inser = i; } } for( i = 0;i < top;i++) { edge[S[i]]. flow += Min; edge[S[i]^1].flow -= Min; } ans += Min; top = inser; u = edge[S[top]^1].to; continue; } bool flag = false; int v; for( i = cur[u]; i != -1; i = edge[i]. next) { v = edge[i]. to; if(edge[i].cap - edge[i].flow && dep[v]+1 == dep[u]) { flag = true; cur[u] = i; break; } } if(flag) { S[top++] = cur[u]; u = v; continue; } int Min = N; for( i = head[u]; i != -1; i = edge[i].next) { if(edge[i].cap - edge[i].flow && dep[edge[i].to] < Min) { Min = dep[edge[i].to]; cur[u] = i; } } gap[dep[u]]--; if(!gap[dep[u]]) return ans; dep[u] = Min + 1; gap[dep[u]]++; if(u != start)u = edge[S[--top]^1].to; } return ans; } int a[233],b,c[233],d,e[677]; int main() { int n,m; // IN; while(scanf("%d%d",&n,&m)!=EOF) { init(); int sum=0,tol=0; for(int i=1;i<=n;i++) { scanf("%d%d%d%d",&a[i],&b,&c[i],&d); e[tol++]=a[i],e[tol++]=c[i]; sum+=b*d; addedge(0,i,b*d); } sort(e,e+tol); int tol1=1; for(int i=1;i<tol;i++) if(e[i]!=e[i-1]) e[tol1++]=e[i]; for(int i=1;i<tol1;i++) { addedge(n+i,n+tol1+1,(e[i]-e[i-1])*m); for(int j=1;j<=n;j++) { if(a[j]<=e[i-1]&&c[j]>=e[i]) { //printf("%d %d\n",j,i+n); addedge(j,i+n,INF); } } } int x=sap(0,n+tol1+1,n+tol1+2); printf("%d\n",x); if(sum==x) puts("Yes"); else puts("No"); } return 0; }
相关文章推荐
- 【网络流】 HDU 2883 kebab 离散
- kebab (hdu 2883 网络流判满流 关键是缩点)
- HDU 2883kebab(网络流之最大流)
- HDU 2883 kebab 网络流
- hdu 2883 kebab 网络流
- 【网络流】 hdu 2883 kebab
- HDU 2883 kebab(最大流,满流)
- hdu 3572 Task Schedule hdu 2883 kebab 最大流
- hdu 2883 kebab 【网络最大流】
- HDU 2883 kebab(离散化+最大流)
- hdu 2883 kebab【最大流Dinic+缩点】
- HDU 2883 kebab (最大流)
- hdu 2883 kebab(最大流,判断满流,区间化点)
- HDU 2883 —— kebab
- HDU 2883 kebab
- hdu 2883 kebab(最大流dinic邻接表)
- [HDU 2883]kebab[最大流][区间离散化]
- 【HDU】 2883 kebab(最大流+时间段离散化)
- HDU 2883 kebab(离散化+最大流)
- hdu 2883 kebab