Heavy Transportation
Time Limit: 3000MS   Memory Limit: 30000K
Total Submissions: 21037   Accepted: 5569

Description

Background 

Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his customer has build his giant steel crane to the place where it is needed
on which all streets can carry the weight. 

Fortunately he already has a plan of the city with all streets and bridges and all the allowed weights.Unfortunately he has no idea how to find the the maximum weight capacity in order to tell his customer how heavy the crane may become. But you surely know. 



Problem 

You are given the plan of the city, described by the streets (with weight limits) between the crossings, which are numbered from 1 to n. Your task is to find the maximum weight that can be transported from crossing 1 (Hugo's place) to crossing n (the customer's
place). You may assume that there is at least one path. All streets can be travelled in both directions.

Input

The first line contains the number of scenarios (city plans). For each city the number n of street crossings (1 <= n <= 1000) and number m of streets are given on the first line. The following m lines contain triples of integers specifying start and end crossing
of the street and the maximum allowed weight, which is positive and not larger than 1000000. There will be at most one street between each pair of crossings.

Output

The output for every scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. Then print a single line containing the maximum allowed weight that Hugo can transport to the customer. Terminate the output for
the scenario with a blank line.

Sample Input

1
3 3
1 2 3
1 3 4
2 3 5

Sample Output

Scenario #1:
4

Source

TUD Programming Contest 2004, Darmstadt, Germany

题意:求点1到n的最小割。

先尝试了下DFS,结果TLE。

#include <stdio.h>
#include <string.h> #define maxn 1010
#define maxm maxn * maxn
#define inf 0x3f3f3f3f int head[maxn], n, m, id, ans, cas = 1;
struct Node {
int v, c, next;
} E[maxm];
bool vis[maxn]; void addEdge(int u, int v, int c) {
E[id].v = v; E[id].c = c;
E[id].next = head[u]; head[u] = id++; E[id].v = u; E[id].c = c;
E[id].next = head[v]; head[v] = id++;
} void getMap() {
int u, v, c; id = 0;
scanf("%d%d", &n, &m);
memset(head, -1, sizeof(int) * (n + 1));
while(m--) {
scanf("%d%d%d", &u, &v, &c);
addEdge(u, v, c);
}
} void DFS(int k, int dis) {
if(k == n) {
if(dis > ans) ans = dis;
return;
}
for(int i = head[k]; i != -1; i = E[i].next) {
if(!vis[E[i].v]) {
int pre = dis;
vis[E[i].v] = 1;
if(E[i].c < dis) dis = E[i].c;
DFS(E[i].v, dis);
dis = pre; vis[E[i].v] = 0;
}
}
} void solve() {
ans = 0;
memset(vis, 0, sizeof(bool) * (n + 1));
vis[1] = 1; DFS(1, inf);
printf("Scenario #%d:\n%d\n\n", cas++, ans);
} int main() {
// freopen("stdin.txt", "r", stdin);
int t;
scanf("%d", &t);
while(t--) {
getMap();
solve();
}
return 0;
}

然后尝试了下Dijkstra,过了..dis数组存储当前点到源点的最小割。

#include <stdio.h>
#include <string.h> #define maxn 1010
#define maxm maxn * maxn
#define inf 0x3f3f3f3f int head[maxn], n, m, id, ans, cas = 1;
struct Node {
int v, c, next;
} E[maxm];
int dis[maxn];
bool vis[maxn]; int max(int a, int b) {
return a > b ? a : b;
} int min(int a, int b) {
return a < b ? a : b;
} void addEdge(int u, int v, int c) {
E[id].v = v; E[id].c = c;
E[id].next = head[u]; head[u] = id++; E[id].v = u; E[id].c = c;
E[id].next = head[v]; head[v] = id++;
} void getMap() {
int u, v, c; id = 0;
scanf("%d%d", &n, &m);
memset(head, -1, sizeof(int) * (n + 1));
while(m--) {
scanf("%d%d%d", &u, &v, &c);
addEdge(u, v, c);
}
} int getNext() {
int pos = -1, val = 0;
for(int i = 1; i <= n; ++i)
if(dis[i] > val && !vis[i]) {
val = dis[i]; pos = i;
}
return pos;
} void Dijkstra(int start, int end) {
memset(dis, 0, sizeof(int) * (n + 1));
dis[start] = inf;
int i, u = start, v;
while(u != -1) {
vis[u] = 1;
if(u == end) return;
for(i = head[u]; i != -1; i = E[i].next) {
if(!vis[v = E[i].v]) dis[v] = max(dis[v], min(E[i].c, dis[u]));
}
u = getNext();
}
} void solve() {
memset(vis, 0, sizeof(bool) * (n + 1));
Dijkstra(1, n);
printf("Scenario #%d:\n%d\n\n", cas++, dis[n]);
} int main() {
// freopen("stdin.txt", "r", stdin);
int t;
scanf("%d", &t);
while(t--) {
getMap();
solve();
}
return 0;
}

POJ1797 Heavy Transportation 【Dijkstra】的更多相关文章

  1. POJ--1797 Heavy Transportation (最短路)

    题目电波: POJ--1797 Heavy Transportation n点m条边, 求1到n最短边最大的路径的最短边长度 改进dijikstra,dist[i]数组保存源点到i点的最短边最大的路径 ...

  2. POJ 1797 ——Heavy Transportation——————【最短路、Dijkstra、最短边最大化】

    Heavy Transportation Time Limit:3000MS     Memory Limit:30000KB     64bit IO Format:%I64d & %I64 ...

  3. (Dijkstra) POJ1797 Heavy Transportation

    Heavy Transportation Time Limit: 3000MS   Memory Limit: 30000K Total Submissions: 53170   Accepted:  ...

  4. POJ 1797 Heavy Transportation (Dijkstra变形)

    F - Heavy Transportation Time Limit:3000MS     Memory Limit:30000KB     64bit IO Format:%I64d & ...

  5. 【Dijkstra】

    [摘自]:华山大师兄,推荐他的过程动画~   myth_HG 定义 Dijkstra算法是典型的单源最短路径算法,用于计算一个节点到其他所有节点的最短路径.主要特点是以起始点为中心向外层层扩展,直到扩 ...

  6. POJ 1797 Heavy Transportation (dijkstra 最小边最大)

    Heavy Transportation 题目链接: http://acm.hust.edu.cn/vjudge/contest/66569#problem/A Description Backgro ...

  7. POJ1797 Heavy Transportation —— 最短路变形

    题目链接:http://poj.org/problem?id=1797 Heavy Transportation Time Limit: 3000MS   Memory Limit: 30000K T ...

  8. POJ1797 Heavy Transportation (堆优化的Dijkstra变形)

    Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand bus ...

  9. POJ 1797 Heavy Transportation 【最大生成树的最小边/最小瓶颈树】

    Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand bus ...

随机推荐

  1. C++_基础_运算符重载

    内容: (1)输入输出运算符重载 (2)友元类和友元函数 (3)双目运算符重载 (4)单目运算符重载 (5)不能被重载的运算符 (6)只能定义为成员形式的运算符 1.输入输出运算符重载如: int n ...

  2. HTML禁止使用右键

    <html> <script type="text/javascript"> <!-- document.oncontextmenu=function ...

  3. jQuery.validationEngine前端验证

    引入相关文件: <script src="https://ajax.googleapis.com/ajax/libs/jquery/1.4.4/jquery.js" type ...

  4. 1 2 5 10 20 --> 800

    用1元 2元 5元 10元 20元的钞票凑成800元的方法种数计算,使用了动态规划. 结果没打出来,只是保留在函数里各个vector中,调试可看所有结果. 优点:快 缺点:占空间占内存 耗时时间测试: ...

  5. 解析Tensorflow官方PTB模型的demo

    RNN 模型作为一个可以学习时间序列的模型被认为是深度学习中比较重要的一类模型.在Tensorflow的官方教程中,有两个与之相关的模型被实现出来.第一个模型是围绕着Zaremba的论文Recurre ...

  6. RTTI-CLASS

    package com.xt.test; interface Test1Interface { } interface Test2Interface { } class Test1 implement ...

  7. QR Code於台灣各行業的行銷應用案例介紹

    當走在東京的大街小巷時,在五花八門的廣告看板.雜誌.護照簽證.海關.宣傳品.廣告.旅遊和導覽手冊.產品包裝.甚至在餐廳菜單上,皆可看到上面有一組黑色神秘二維條碼圖案:QR Code,當看到有興趣的商品 ...

  8. cluster maintain manager Software群集管理软件

    1,ocfs2 2,crmsh(cluster management shell,)==crm shell [pacemaker OpenAIS,heartbeat,corosync,crmsh] 3 ...

  9. Good Luck in CET-4 Everybody!(博弈)

    Good Luck in CET-4 Everybody! Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K ...

  10. Echoprint系列--Android编译与调用

    在Echoprint系列--编译中编译了源代码,这次将Echoprint移植到Android平台并測试识别歌曲功能. 一.编译库 1.环境准备 Android NDK,我的是android-ndk-r ...