POJ Remmarguts' Date A*搜索+spfa
来源:互联网 发布:双三次插值算法 编辑:程序博客网 时间:2024/05/21 12:49
Remmarguts' Date
Time Limit: 4000MS Memory Limit: 65536KTotal Submissions: 30202 Accepted: 8211
Description
"Good man never makes girls wait or breaks an appointment!" said the mandarin duck father. Softly touching his little ducks' head, he told them a story.
"Prince Remmarguts lives in his kingdom UDF – United Delta of Freedom. One day their neighboring country sent them Princess Uyuw on a diplomatic mission."
"Erenow, the princess sent Remmarguts a letter, informing him that she would come to the hall and hold commercial talks with UDF if and only if the prince go and meet her via the K-th shortest path. (in fact, Uyuw does not want to come at all)"
Being interested in the trade development and such a lovely girl, Prince Remmarguts really became enamored. He needs you - the prime minister's help!
DETAILS: UDF's capital consists of N stations. The hall is numbered S, while the station numbered T denotes prince' current place. M muddy directed sideways connect some of the stations. Remmarguts' path to welcome the princess might include the same station twice or more than twice, even it is the station with number S or T. Different paths with same length will be considered disparate.
"Prince Remmarguts lives in his kingdom UDF – United Delta of Freedom. One day their neighboring country sent them Princess Uyuw on a diplomatic mission."
"Erenow, the princess sent Remmarguts a letter, informing him that she would come to the hall and hold commercial talks with UDF if and only if the prince go and meet her via the K-th shortest path. (in fact, Uyuw does not want to come at all)"
Being interested in the trade development and such a lovely girl, Prince Remmarguts really became enamored. He needs you - the prime minister's help!
DETAILS: UDF's capital consists of N stations. The hall is numbered S, while the station numbered T denotes prince' current place. M muddy directed sideways connect some of the stations. Remmarguts' path to welcome the princess might include the same station twice or more than twice, even it is the station with number S or T. Different paths with same length will be considered disparate.
Input
The first line contains two integer numbers N and M (1 <= N <= 1000, 0 <= M <= 100000). Stations are numbered from 1 to N. Each of the following M lines contains three integer numbers A, B and T (1 <= A, B <= N, 1 <= T <= 100). It shows that there is a directed sideway from A-th station to B-th station with time T.
The last line consists of three integer numbers S, T and K (1 <= S, T <= N, 1 <= K <= 1000).
The last line consists of three integer numbers S, T and K (1 <= S, T <= N, 1 <= K <= 1000).
Output
A single line consisting of a single integer number: the length (time required) to welcome Princess Uyuw using the K-th shortest path. If K-th shortest path does not exist, you should output "-1" (without quotes) instead.
Sample Input
2 21 2 52 1 41 2 2
Sample Output
14
https://hrbust-acm-team.gitbooks.io/acm-book/content/search/a_star_search.html
#include<stdio.h>#include<algorithm>#include<string.h>#include<vector>#include<queue>using namespace std;const int maxm = 10005;const int INF = 1000000000;struct node{int v, w;};vector<node>v[maxm];vector<node>p[maxm];struct A{int f, g, v;bool operator<(const A &r)const{if (f != r.f) return r.f < f;return r.g < g;}};int dis[maxm], k, n, vis[maxm];void spfa(int s);int astar(int s, int t);int main(){int i, j, sum, m, x, y, z, s, t;node temp;while (scanf("%d%d", &n, &m) != EOF){for (i = 1;i <= n;i++)v[i].clear(), p[i].clear();for (i = 1;i <= m;i++){scanf("%d%d%d", &x, &y, &z);temp.v = y, temp.w = z;v[x].push_back(temp);temp.v = x;p[y].push_back(temp);}scanf("%d%d%d", &s, &t, &k);spfa(t);printf("%d\n", astar(s, t));}return 0;}void spfa(int s){for (int i = 1;i <= n;i++) dis[i] = INF;memset(vis, 0, sizeof(vis));queue<int>q;dis[s] = 0;vis[s] = 1;q.push(s);while (!q.empty()){int xx = q.front();q.pop();vis[xx] = 0;for (int i = 0;i < p[xx].size();i++){if (dis[p[xx][i].v] > dis[xx] + p[xx][i].w){dis[p[xx][i].v] = dis[xx] + p[xx][i].w;if (!vis[p[xx][i].v]){q.push(p[xx][i].v);vis[p[xx][i].v] = 1;}}}}}int astar(int s, int t){int cnt = 0;if (dis[s] == INF) return -1;if (s == t) k++;priority_queue<A>q;A now, temp;now.v = s, now.g = 0, now.f = dis[s] + now.g;q.push(now);while (!q.empty()){temp = q.top(), q.pop();if (temp.v == t){cnt++;if (cnt == k) return temp.g;}for (int i = 0;i < v[temp.v].size();i++){node xx = v[temp.v][i];now.v = xx.v;now.g = temp.g + xx.w;now.f = now.g + dis[xx.v];q.push(now);}}return -1;}
阅读全文
0 0
- POJ Remmarguts' Date A*搜索+spfa
- poj Remmarguts' Date A*+ spfa
- POJ 2449 Remmarguts' Date【SPFA】【A*】
- POJ 2449-Remmarguts' Date(A*+spfa)
- POJ 2449 Remmarguts' Date(A* + spfa)
- [POJ 2449] Remmarguts' Date [A*搜索]
- POJ 2449 Remmarguts' Date(第k短路+spfa+A*搜索)
- poj2449 Remmarguts' Date (spfa+A*)
- POJ 2449 Remmarguts' Date 第K短路 A* + SPFA
- poj 2449 Remmarguts' Date--k短路--spfa+A*
- poj 2449 Remmarguts' Date(K短路 Spfa+A*)
- POJ 2449 Remmarguts' Date(A*+SPFA)K短路问题
- POJ 题目2449 Remmarguts' Date(K短路,A*+spfa)
- poj 2449 Remmarguts' Date A*+spfa求第k短路
- POJ 2448(K短路,A*+SPFA) Remmarguts' Date
- POJ 2447 Remmarguts' Date【k短路 SPFA+A* 模板题】
- POJ——2449Remmarguts' Date(A*+SPFA)
- POj 2449 Remmarguts' Date K短路 A*+SPFA
- L2-011. 玩转二叉树
- 长连接转短链接
- 组合数
- Android几种进程
- 剑指offer--反转链表
- POJ Remmarguts' Date A*搜索+spfa
- 如何解决WebBrowser.DocumentCompleted事件的多次调用
- JS高级程序设计——BOM
- Python3网络爬虫(十三):王者荣耀那些事!(Fiddler之手机APP爬取)
- ssh 本地和远端端口转发
- 根据压缩包路径读取此压缩包内文件个数
- Android马赛克效果MosaicView
- volatile 关键字作用
- 指针加减运算