POJ2387
题意:有1到N编号连续的N个地点,有T条路,每条路有相应的起点和终点以及所花费的时间,求从1到N所花最短时间
题解:Dijkstra算法模板题,注意是无向图
#include<iostream>
#include<string>
using namespace std;
const int MAX = 1005;
const int INF = 1e9;
int vis[MAX], dist[MAX][MAX], dis[MAX];
int main()
{
int n, t;
while (cin >> t >> n) {
int i, j;
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
if (i == j)dist[i][j] = 0;
else dist[i][j] = INF;
}
}
int a, b, c, u, v;
for (i = 0; i < t; i++) {
cin >> a >> b >> c;
if (dist[a][b] > c) {
dist[a][b] = dist[b][a] = c;
}
}
for (i = 1; i <= n; i++) {
dis[i] = dist[1][i];
}
memset(vis, 0, sizeof(vis));
vis[1] = 1;
for (i = 0; i < n - 1; i++) {
int Min = INF;
for (j = 2; j <= n; j++) {
if (vis[j] == 0 && dis[j] < Min) {
Min = dis[j];
u = j;
}
}
vis[u] = 1;
for (v = 2; v <= n; v++) {
if (dis[v] > dist[u][v] + dis[u] && !vis[v])
dis[v] = dist[u][v] + dis[u];
}
}
cout << dis[n] << endl;
}
return 0;
}
POJ2253
题意:池塘上有一些石头,青蛙能在石头之前跳跃,现青蛙A在某个石头上,青蛙B在另一个石头上,求从A到B的所有路径中,青蛙在最大单步跳跃距离的最小值。(石头位置由坐标确定)
题解:Dijkstra算法,用结构体数组储存石头坐标,该图是一个强连通图(因为任意两石头的距离总能计算出来),只需把松弛操作改为取最大值即可。
#include<iostream>
#include<cmath>
#include<string>
#include<algorithm>
using namespace std;
typedef double dd;
const int MAX = 205;
const dd INF = 1000000000.0;
dd dist[MAX][MAX];
dd dis[MAX];
int vis[MAX];
int n;
struct node {
dd x, y;
}map[MAX];
inline dd getdis(node a, node b)
{
dd dx = abs(a.x - b.x);
dd dy = abs(a.y - b.y);
return sqrt(dx * dx + dy * dy);
}
inline void init()
{
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
dist[i][j] = dist[j][i] = getdis(map[i], map[j]);
}
}
}
void dij()
{
memset(vis, 0, sizeof(vis));
int i, j, u, v;
for (i = 1; i <= n; i++)
dis[i] = dist[1][i];
vis[1] = 1;
for (i = 0; i < n - 1; i++) {
dd min = INF;
for (j = 2; j <= n; j++) {
if (dis[j] < min && vis[j] == 0) {
min = dis[j];
u = j;
}
}
vis[u] = 1;
for (v = 2; v <= n; v++) {
if (dis[v] > max(dis[u], dist[u][v]))
dis[v] = max(dis[u], dist[u][v]);
}
}
}
int main()
{
int i;
int I = 1;
while (cin >> n && n) {
for (i = 1; i <= n; i++) {
scanf("%lf%lf", &map[i].x, &map[i].y);
}
init();
dij();
printf("Scenario #%d\n", I);
printf("Frog Distance = %.3lf\n", dis[2]);
cout << endl;
I++;
}
return 0;
}
POJ1797
题意:有n个地点(从1到n),m条路,每条路径有最大承重,求从1到n所能运输的最大重量
题解:依旧是dijkstra算法,松弛操作相应改为取最小值即可
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
const int MAX = 1005;
int n, m;
int dist[MAX][MAX], dis[MAX];
int vis[MAX];
void dk()
{
memset(vis, 0, sizeof(vis));
int i, j, u, v;
vis[1] = 1;
for (i = 0; i < n - 1; i++) {
int max = 0;
for (j = 2; j <= n; j++) {
if (!vis[j] && dis[j] > max) {
max = dis[j];
u = j;
}
}
vis[u] = 1;
for (v = 2; v <= n; v++) {
if (dis[v] < min(dis[u], dist[u][v]))
dis[v] = min(dis[u], dist[u][v]);
}
}
}
int main()
{
int I, t;
cin >> t;
for (I = 1; I <= t; I++) {
scanf("%d%d", &n, &m);
int i, j, a, b, c;
memset(dist, 0, sizeof(dist));
for (i = 0; i < m; i++) {
scanf("%d%d%d", &a, &b, &c);
if (dist[a][b] < c)
dist[a][b] = dist[b][a] = c;
}
for (i = 1; i <= n; i++)
dis[i] = dist[1][i];
dk();
printf("Scenario #%d:\n", I);
printf("%d\n\n", dis[n]);
}
return 0;
}
POJ3268
题意:给定一个 n个点,m条边的有向图,指定一个点 x,求每个点 i->x+x->i的最短路之中的最大值是多少。
题解:dijkstra算法,对每一个案例,需dijkstra两次,第一次对dist矩阵(此时dis代表以x为起点),第二次对dist的转置矩阵(此时dis代表以x为终点)
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
const int MAX = 1005;
const int INF = 0x3f3f3f3f;
int dist[MAX][MAX], dis[MAX], change[MAX];
int vis[MAX];
int n, m, x;
void dk()
{
memset(dis, INF, sizeof(dis));
memset(vis, 0, sizeof(vis));
dis[x] = 0;
int i, j, u;
for (i = 0; i < n; i++) {
int MAX = INF;
for (j = 1; j <= n; j++) {
if (!vis[j] && dis[j] < MAX) {
MAX = dis[j];
u = j;
}
}
vis[u] = 1;
for (j = 1; j <= n; j++)
dis[j] = min(dis[j], dis[u] + dist[u][j]);
}
}
int main()
{
cin >> n >> m >> x;
memset(dist, INF, sizeof(dist));
int a, b, c;
while (m--) {
cin >> a >> b >> c;
if (dist[a][b] > c)
dist[a][b] = c;
}
dk();
int i, j;
for (i = 1; i <= n; i++)change[i] = dis[i];
for (i = 1; i <= n; i++) {
for (j = i + 1; j <= n; j++) {
swap(dist[i][j], dist[j][i]);
}
}
dk();
int ans = 0;
for (i = 1; i <= n; i++) {
ans = max(ans, dis[i] + change[i]);
}
cout << ans << endl;
return 0;
}
POJ1860
题意:有n种货币和m个货币兑换点,每个兑换点兑换两种货币且需要收一定手续费,求是否有一种兑换方法能让手中货币价值一直增加
题解:Bellman-Ford算法,判断是否有负权回路即可
#include<iostream>
#include<string>
using namespace std;
typedef double dd;
int u[210], v[210];
dd c[210], r[210];
dd dis[210];
int n, M, s;
dd V;
int bf(int m)
{
int i, j;
dis[s] = V;
for (i = 0; i < n - 1; i++) {
int x = 0;
for (j = 1; j <= m; j++) {
dd tmp = (dis[u[j]] - c[j]) * r[j];
if (tmp > dis[v[j]]) {
dis[v[j]] = tmp;
x = 1;
}
}
if (x == 0)return 0;
}
for (j = 1; j <= m; j++) {
dd tmp = (dis[u[j]] - c[j]) * r[j];
if (tmp > dis[v[j]])
return 1;
}
return 0;
}
int main()
{
while (scanf("%d%d%d%lf", &n, &M, &s, &V) != EOF) {
memset(dis, 0, sizeof(dis));
int cnt = 0;
int i;
for (i = 0; i < M; i++) {
cnt++;
int A, B;
dd RAB, CAB, RBA, CBA;
scanf("%d%d%lf%lf%lf%lf", &A, &B, &RAB, &CAB, &RBA, &CBA);
u[cnt] = A; v[cnt] = B; r[cnt] = RAB; c[cnt] = CAB;
cnt++;
u[cnt] = B; v[cnt] = A; r[cnt] = RBA; c[cnt] = CBA;
}
if (bf(cnt))
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
}
POJ3259
题意:有n个地点,以及一些路径(其中,有些属于正常路径,可双向通过且需花费一定时间;有些属于“虫洞”,只能单向通过且能回到过去),求是否有某条回路能使你从一个地点出发再回到这个地点的时刻早于出发时刻
题解:Bellman-Ford算法,判断是否有负权回路即可
#include<iostream>
#include<string>
using namespace std;
const int MAX = 5500;
const int INF = 0x3f3f3f3f;
struct node {
int u, v;
int t;
}p[MAX];
int dis[550];
int n, m, w;
int bf(int m)
{
memset(dis, INF, sizeof(dis));
dis[1] = 0;
int i, j;
for (i = 0; i < n - 1; i++) {
for (j = 1; j <= m; j++) {
if (dis[p[j].u] + p[j].t < dis[p[j].v])
dis[p[j].v] = dis[p[j].u] + p[j].t;
}
}
for (j = 1; j <= m; j++) {
if (dis[p[j].u] + p[j].t < dis[p[j].v])
return 1;
}
return 0;
}
int main()
{
int t;
cin >> t;
while (t--) {
int i, cnt = 1;
int a, b, c;
cin >> n >> m >> w;
for (i = 0; i < m; i++) {
cin >> a >> b >> c;
p[cnt].u = a; p[cnt].v = b; p[cnt++].t = c;
p[cnt].u = b; p[cnt].v = a; p[cnt++].t = c;
}
for (i = 0; i < w; i++) {
cin >> a >> b >> c;
p[cnt].u = a; p[cnt].v = b; p[cnt++].t = -c;
}
int ans = bf(cnt - 1);
if (ans)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
}
POJ3414
题意:有两个杯子(编号是1、2),容量分别为A和B,可以经行三种操作:FILL(i):将i号杯倒满;DROP(i):将i号杯的水全部倒掉;POUR(i, j):将i号杯的水倒到j号杯中——有两种情况,若i号杯有盈余,则继续留在里面。求能使某个杯子中的水达到C的最短步骤,打印出其中所有步骤
题解:bfs,关于打印路径,在node结构中加入step数组,由于是两个杯子,访问数组需要建立二维的。
#include<iostream>
#include<queue>
#include<string>
using namespace std;
const int MAX = 105;
int a, b, c;
int v[MAX][MAX];
struct node {
int a, b, t;
int step[MAX];
};
string path[] = {
"FILL(1)"
,"FILL(2)"
,"DROP(1)"
,"DROP(2)"
,"POUR(1,2)"
,"POUR(2,1)"
};
void putans(int t, int step[])
{
cout << t << endl;
for (int i = 0; i < t; i++) {
cout << path[step[i]] << endl;
}
}
void bfs()
{
queue<node>q;
memset(v, 0, sizeof(v));
node f;
f.a = 0; f.b = 0; f.t = 0;
memset(f.step, 0, sizeof(f.step));
v[0][0] = 1;
q.push(f);
while (!q.empty()) {
f = q.front();
q.pop();
if (f.a == c || f.b == c) {
putans(f.t, f.step);
return;
}
node s = f;
s.t++;
if (a - f.a > 0) {
s.a = a;
s.b = f.b;
if (!v[s.a][s.b]) {
s.step[f.t] = 0;
q.push(s);
v[s.a][s.b] = 1;
}
}
if (b - f.b > 0) {
s.a = f.a;
s.b = b;
if (!v[s.a][s.b]) {
s.step[f.t] = 1;
q.push(s);
v[s.a][s.b] = 1;
}
}
if (f.a) {
s.a = 0;
s.b = f.b;
if (!v[s.a][s.b]) {
s.step[f.t] = 2;
q.push(s);
v[s.a][s.b] = 1;
}
}
if (f.b) {
s.a = f.a;
s.b = 0;
if (!v[s.a][s.b]) {
s.step[f.t] = 3;
q.push(s);
v[s.a][s.b] = 1;
}
}
if (f.a && f.b < b) {
if (b - f.b >= f.a) {
s.a = 0;
s.b = f.b + f.a;
}
else {
s.a = f.a - b + f.b;
s.b = b;
}
if (!v[s.a][s.b]) {
s.step[f.t] = 4;
q.push(s);
v[s.a][s.b] = 1;
}
}
if (f.b && f.a < a) {
if (a - f.a >= f.b) {
s.a = f.a + f.b;
s.b = 0;
}
else {
s.a = a;
s.b = f.b - a + f.a;
}
if (!v[s.a][s.b]) {
s.step[f.t] = 5;
q.push(s);
v[s.a][s.b] = 1;
}
}
}
cout << "impossible" << endl;
}
int main()
{
cin >> a >> b >> c;
bfs();
return 0;
}