HDU 4940 Destroy Transportation system (瞎搞)
2014-08-13 10:37
363 查看
解题思路:
题目要求是否存在集合S使得 Y < X ,因此让T集合中点数目尽量少,使得Y尽量小,枚举即可。
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <map>
#include <algorithm>
#define LL long long
#define FOR(i,x,y) for(int i=x;i<=y;i++)
using namespace std;
const int maxn = 200 + 10;
int B[maxn][maxn];
int D[maxn][maxn];
int main()
{
int T , kcase = 1;
int N , M;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&N,&M);
memset(B,0,sizeof(B));
memset(D,0,sizeof(D));
int u , v , b , d;
for(int i=1;i<=M;i++)
{
scanf("%d%d%d%d",&u,&v,&b,&d);
B[u][v] = b;
D[u][v] = d;
}
int F = 0;
for(int i=1;i<=N;i++)
{
int x = 0 , y = 0;
for(int j=1;j<=N;j++)
{
x += B[i][j] + D[i][j];
y += B[j][i];
}
if(x < y) { F = 1; break;}
}
if(F) printf("Case #%d: unhappy\n",kcase++);
else printf("Case #%d: happy\n",kcase++);
}
return 0;
}
题目要求是否存在集合S使得 Y < X ,因此让T集合中点数目尽量少,使得Y尽量小,枚举即可。
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <map>
#include <algorithm>
#define LL long long
#define FOR(i,x,y) for(int i=x;i<=y;i++)
using namespace std;
const int maxn = 200 + 10;
int B[maxn][maxn];
int D[maxn][maxn];
int main()
{
int T , kcase = 1;
int N , M;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&N,&M);
memset(B,0,sizeof(B));
memset(D,0,sizeof(D));
int u , v , b , d;
for(int i=1;i<=M;i++)
{
scanf("%d%d%d%d",&u,&v,&b,&d);
B[u][v] = b;
D[u][v] = d;
}
int F = 0;
for(int i=1;i<=N;i++)
{
int x = 0 , y = 0;
for(int j=1;j<=N;j++)
{
x += B[i][j] + D[i][j];
y += B[j][i];
}
if(x < y) { F = 1; break;}
}
if(F) printf("Case #%d: unhappy\n",kcase++);
else printf("Case #%d: happy\n",kcase++);
}
return 0;
}
相关文章推荐
- HDU 4940(杭电多校#7 1006) Destroy Transportation system(瞎搞)
- HDU 4940 Destroy Transportation system 规律题
- HDU 4940 Destroy Transportation system(上下界网络流)
- HDU 4940 Destroy Transportation system 无源汇有上下界的网络流
- hdu 4940 Destroy Transportation system( 无源汇上下界网络流的可行流判断 )
- HDU 4940 Destroy Transportation system(2014 Multi-University Training Contest 7)
- HDU-4940-Destroy Transportation system
- HDU 4940(杭电更多的学校#7 1006) Destroy Transportation system(到处乱混)
- HDU 4940 Destroy Transportation system(图论)
- hdu 4940 Destroy Transportation system (无源汇上下界可行流)
- 【HDU 4940】Destroy Transportation system(无源无汇带上下界可行流)
- hdu 4940 Destroy Transportation system(sap dfs)
- hdu 4940 Destroy Transportation system( 无源汇上下界网络流的可行流推断 )
- hdu 4940 Destroy Transportation system(水过)
- HDU 4940 - Destroy Transportation system(网络流)
- HDU 4940 Destroy Transportation system(无源汇有上下界最大流)
- [HDOJ 4940] Destroy Transportation system [最大流]
- HDU Destroy Transportation system(有上下界的可行流)
- hdu4940 Destroy Transportation system(2014多校联合第七场)
- hdu4940 Destroy Transportation system