日本搞逼视频_黄色一级片免费在线观看_色99久久_性明星video另类hd_欧美77_综合在线视频

國內最全IT社區平臺 聯系我們 | 收藏本站
阿里云優惠2
您當前位置:首頁 > 互聯網 > POJ 3653 & ZOJ 2935 & HDU 2722 Here We Go(relians) Again(最短路dijstra)

POJ 3653 & ZOJ 2935 & HDU 2722 Here We Go(relians) Again(最短路dijstra)

來源:程序員人生   發布時間:2014-11-14 08:31:40 閱讀次數:1836次
題目鏈接:

PKU:http://poj.org/problem?id=3653

ZJU:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1934

HDU:http://acm.hdu.edu.cn/showproblem.php?pid=2722


Description

The Gorelians are a warlike race that travel the universe conquering new worlds as a form of recreation. Given their violent, fun-loving nature, keeping their leaders alive is of serious concern. Part of the Gorelian security plan involves changing the traffic patterns of their cities on a daily basis, and routing all Gorelian Government Officials to the Government Building by the fastest possible route.

Fortunately for the Gorelian Minister of Traffic (that would be you), all Gorelian cities are laid out as a rectangular grid of blocks, where each block is a square measuring 2520 rels per side (a rel is the Gorelian Official Unit of Distance). The speed limit between two adjacent intersections is always constant, and may range from 1 to 9 rels per blip (a blip, of course, being the Gorelian Official Unit of Time). Since Gorelians have outlawed decimal numbers as unholy (hey, if you're the dominant force in the known universe, you can outlaw whatever you want), speed limits are always integer values. This explains why Gorelian blocks are precisely 2520 rels in length: 2520 is the least common multiple of the integers 1 through 9. Thus, the time required to travel between two adjacent intersections is always an integer number of blips.

In all Gorelian cities, Government Housing is always at the northwest corner of the city, while the Government Building is always at the southeast corner. Streets between intersections might be one-way or two-way, or possibly even closed for repair (all this tinkering with traffic patterns causes a lot of accidents). Your job, given the details of speed limits, street directions, and street closures for a Gorelian city, is to determine the fastest route from Government Housing to the Government Building. (It is possible, due to street directions and closures, that no route exists, in which case a Gorelian Official Temporary Holiday is declared, and the Gorelian Officials take the day off.)

Gorelian city

The picture above shows a Gorelian City marked with speed limits, one way streets, and one closed street. It is assumed that streets are always traveled at the exact posted speed limit, and that turning a corner takes zero time. Under these conditions, you should be able to determine that the fastest route from Government Housing to the Government Building in this city is 1715 blips. And if the next day, the only change is that the closed road is opened to two way traffic at 9 rels per blip, the fastest route becomes 1295 blips. On the other hand, suppose the three one-way streets are switched from southbound to northbound (with the closed road remaining closed). In that case, no route would be possible and the day would be declared a holiday.

Input

The input consists of a set of cities for which you must find a fastest route if one exists. The first line of an input case contains two integers, which are the vertical and horizontal number of city blocks, respectively. The smallest city is a single block, or 1 by 1, and the largest city is 20 by 20 blocks. The remainder of the input specifies speed limits and traffic directions for streets between intersections, one row of street segments at a time. The first line of the input (after the dimensions line) contains the data for the northernmost east-west street segments. The next line contains the data for the northernmost row of north-south street segments. Then the next row of east-west streets, then north-south streets, and so on, until the southernmost row of east-west streets. Speed limits and directions of travel are specified in order from west to east, and each consists of an integer from 0 to 9 indicating speed limit, and a symbol indicating which direction traffic may flow. A zero speed limit means the road is closed. All digits and symbols are delimited by a single space. For east-west streets, the symbol will be an asterisk '*' which indicates travel is allowed in both directions, a less-than symbol '<' which indicates travel is allowed only in an east-to-west direction, or a greater-than symbol '>' which indicates travel is allowed only in a west-to-east direction. For north-south streets, an asterisk again indicates travel is allowed in either direction, a lowercase "vee" character 'v' indicates travel is allowed only in a north-to-south directions, and a caret symbol '^' indicates travel is allowed only in a south-to-north direction. A zero speed, indicating a closed road, is always followed by an asterisk. Input cities continue in this manner until a value of zero is specified for both the vertical and horizontal dimensions.

Output

For each input scenario, output a line specifying the integer number of blips of the shortest route, a space, and then the word "blips". For scenarios which have no route, output a line with the word "Holiday".

Sample Input

2 2 9 * 9 * 6 v 0 * 8 v 3 * 7 * 3 * 6 v 3 * 4 * 8 * 2 2 9 * 9 * 6 v 9 * 8 v 3 * 7 * 3 * 6 v 3 * 4 * 8 * 2 2 9 * 9 * 6 ^ 0 * 8 ^ 3 * 7 * 3 * 6 ^ 3 * 4 * 8 * 0 0

Sample Output

1715 blips 1295 blips Holiday

Source

Mid-Central USA 2007


PS:

題意比較惡心,輸入更惡心,還要分東南西北4個方向!

處理1下輸入,在隨意用1個最短路就行了!


代碼以下:

#include <cstdio> #include <cstring> #include <iostream> #include <algorithm> using namespace std; #define INF 0x3f3f3f3f const int maxn = 547; int mapp[maxn][maxn]; int dijkstra(int start,int n) { int dis[maxn]; int mark[maxn]; int k, min; memset(mark,0,sizeof(mark)); for(int i = 1; i <= n; i++) dis[i] = INF; dis[start] = 0; for(int i = 1; i <= n; i++) { min = INF; for(int j = 1; j <= n; j++) { if(!mark[j] && dis[j]<min) { min=dis[j]; k=j; } } mark[k] = 1; for(int j = 1; j <= n; j++) { if(mapp[k][j]!=0) { if(dis[j] > dis[k]+mapp[k][j]) dis[j] = dis[k]+mapp[k][j]; } } } return dis[n]; } int main() { int v, h, w; char dir; while(~scanf("%d%d",&v,&h)) { if(v==0 && h==0) break; memset(mapp,0,sizeof(mapp)); int a, b; for(int i = 0; i <= v; i++) { for(int j = 1; j <= h; j++) { scanf("%d %c",&w,&dir); if(w == 0) continue; a = i*(h+1)+j; b = a+1; int ti = 2520/w; if(dir == '*') mapp[a][b] = mapp[b][a] = ti; else if(dir == '>') mapp[a][b] = ti; else mapp[b][a] = ti; } if(i!=v)//不是最后1行 { for(int j = 1; j <= h+1; j++)//多1個 { scanf("%d %c",&w,&dir); if(w == 0) continue; a = i*(h+1)+j; b = a+h+1; int ti = 2520/w; if(dir == '*') mapp[a][b] = mapp[b][a] = ti; else if(dir == 'v') mapp[a][b] = ti; else mapp[b][a] = ti; } } } int tt = (v+1)*(h+1); int ans = dijkstra(1,tt); if(ans != INF) printf("%d blips ",ans); else printf("Holiday "); } return 0; }


生活不易,碼農辛苦
如果您覺得本網站對您的學習有所幫助,可以手機掃描二維碼進行捐贈
程序員人生
------分隔線----------------------------
分享到:
------分隔線----------------------------
關閉
程序員人生
主站蜘蛛池模板: 欧美色婷 | 久久亚洲美女 | 国产精品久久久久久久久久98 | 国产伊人精品 | 简单av网| 高清国产一区二区三区四区五区 | 欧美色图片一区二区 | 国产一区二区三区久久久 | 日韩免费一区二区 | 国产精品免费在线 | 久久亚洲国产视频 | 色就是色欧美亚洲 | 久操福利视频 | 久久久久国产一区二区三区四区 | 久久精品国产欧美亚洲人人爽 | 免费看v片| 精品无码久久久久久国产 | 成人aa| 成人精品在线观看 | 日韩精品在线观看视频 | 久久久久久精 | 精品动漫一区二区 | 成人免费视频国产 | 久久国产一区二区三区 | 99精品一区二区三区 | 国产精品久久久久久亚洲伦 | 免费精品视频 | 黄色毛片在线视频 | 欧美性猛交xxxx乱大交蜜桃 | av观看免费 | 日韩在线色 | 国产成人毛片 | 亚洲毛片| 日韩美女一区二区三区 | 狠狠v欧美v日韩v亚洲ⅴ | 精品国产一区二区三区久久 | 午夜一二三区 | 欧美日韩在线观看中文字幕 | 国产一区二区在线免费观看 | 不卡视频在线 | 免费看av的网址 |