HDOJ 题目1546 Idiomatic Phrases Game(最短路径)
来源:互联网 发布:crm数据分析报告 编辑:程序博客网 时间:2024/04/29 23:40
Idiomatic Phrases Game
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2170 Accepted Submission(s): 710
Problem Description
Tom is playing a game called Idiomatic Phrases Game. An idiom consists of several Chinese characters and has a certain meaning. This game will give Tom two idioms. He should build a list of idioms and the list starts and ends with the two given idioms. For every two adjacent idioms, the last Chinese character of the former idiom should be the same as the first character of the latter one. For each time, Tom has a dictionary that he must pick idioms from and each idiom in the dictionary has a value indicates how long Tom will take to find the next proper idiom in the final list. Now you are asked to write a program to compute the shortest time Tom will take by giving you the idiom dictionary.
Input
The input consists of several test cases. Each test case contains an idiom dictionary. The dictionary is started by an integer N (0 < N < 1000) in one line. The following is N lines. Each line contains an integer T (the time Tom will take to work out) and an idiom. One idiom consists of several Chinese characters (at least 3) and one Chinese character consists of four hex digit (i.e., 0 to 9 and A to F). Note that the first and last idioms in the dictionary are the source and target idioms in the game. The input ends up with a case that N = 0. Do not process this case.
Output
One line for each case. Output an integer indicating the shortest time Tome will take. If the list can not be built, please output -1.
Sample Input
55 12345978ABCD23415 23415608ACBD34127 34125678AEFD412315 23415673ACC341234 41235673FBCD2156220 12345678ABCD30 DCBF5432167D0
Sample Output
17-1
Author
ZHOU, Ran
Source
Zhejiang Provincial Programming Contest 2006
Recommend
linle | We have carefully selected several similar problems for you: 1317 1535 3339 1245 1531
成语接龙,前边成语的后四个和后边成语的前四个一样可以接
ac代码
#include<stdio.h>#include<string.h>#define INF 0xfffffffint map[1010][1010],v[1010],dis[1010],n;struct s{char f[10],end[10];int time;}b[1010];void disj(int x){int i,j,min;memset(v,0,sizeof(v));for(i=1;i<=n;i++){dis[i]=map[x][i];}v[x]=1;for(i=1;i<=n;i++){int flag=-1;min=INF;for(j=1;j<=n;j++){if(!v[j]&&dis[j]<min){min=dis[j];flag=j;}}if(flag==-1)break;v[flag]=1;for(j=1;j<=n;j++){if(!v[j]&&dis[flag]+map[flag][j]<dis[j])dis[j]=map[flag][j]+dis[flag];}}}int main(){//int n;while(scanf("%d",&n)!=EOF,n){char str[100010];int i,j,k;for(i=1;i<=n;i++){int len;scanf("%d %s",&b[i].time,str);len=strlen(str);for(j=0,k=len-1;j<4;j++,k--){b[i].f[j]=str[j];b[i].end[3-j]=str[k];}b[i].f[4]=b[i].end[4]='\0';}for(i=1;i<=n;i++){for(j=1;j<=n;j++){map[i][j]=INF;if(i==j)map[i][j]=0;elseif(strcmp(b[i].end,b[j].f)==0)map[i][j]=b[i].time;}}disj(1);if(dis[n]!=INF){printf("%d\n",dis[n]);}elseprintf("-1\n");}}
0 0
- HDOJ 题目1546 Idiomatic Phrases Game(最短路径)
- ZOJ - 2750 Idiomatic Phrases Game (最短路径)
- zoj 2750 Idiomatic Phrases Game(最短路径)
- 杭电 hdu 1546 Idiomatic Phrases Game (最短路径 + Dijkstra)
- HDU 1546 Idiomatic Phrases Game(最短路径)DIJ算法
- HDU1546 Idiomatic Phrases Game 最短路径(Dijkstra算法)
- HDOJ 1546 Idiomatic Phrases Game
- hdu 1546 Idiomatic Phrases Game(最短路)
- hdu 1546 Idiomatic Phrases Game (最短路)
- 【HDU】1546 Idiomatic Phrases Game 最短路
- hdu 1546 Idiomatic Phrases Game 最短路
- HDU 1546 Idiomatic Phrases Game 最短路
- hdu 1546 Idiomatic Phrases Game (spfa)
- HDU 1546 Idiomatic Phrases Game
- hdu 1546 Idiomatic Phrases Game
- HDU 1546 Idiomatic Phrases Game
- HDU-1546 Idiomatic Phrases Game
- Idiomatic Phrases Game HDU 1546
- Android开发笔记之:Handler Runnable与Thread的区别详解
- 《数据结构》第四章 字符串和多维数组 问题收集站
- C语言实现单向链表及其各种排序(含快排,选择,插入,冒泡)
- android自定义权限的实现
- 揭开Socket编程的面纱
- HDOJ 题目1546 Idiomatic Phrases Game(最短路径)
- 基于 Android NDK 的学习之旅----- C调用Java
- JS HTML DOM对象和脚本函数的互调用(字符串标识)
- Android Fragment完全解析
- 求三角形的类型
- 3D打印与模块化:机器人产业新机会
- 【原创】《Linux高级程序设计》杨宗德著 - 进程管理与程序开发 - exec和system函数
- service Intent "com.baidu.location.f"错误解决
- eclipse中怎么让它有提示