搜索
2016-03-12 11:00
288 查看
B - 下沙小面的(2)Crawling in process...Crawling failedTime Limit:1000MSMemory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 1572Description前文再续,书接上一题。话说当上小面的司机的Lele在施行他的那一套拉客法则以后,由于走的路线太长,油费又贵,不久便亏本了。(真可怜~)于是他又想了一个拉客的办法。对于每一次拉客活动,他一次性把乘客都拉上车(当然也不会超过7个,因为位置只有7个)。然后,Lele计算出一条路线(出于某些目的,Lele只把车上乘客的目的地作为这条路线上的站点),把所有乘客都送到目的地(在这路线上不拉上其他乘客),并且使总路线长度最短。不过Lele每次都要花很多时间来想路线,你能写个程序帮他嘛?Input本题目包含多组测试。最后一组测试后有一个0代表结束。每组测试第一行有一个整数NCity(3<=NCity<=30)表示下沙一共有多少个站点(站点从0开始标号)。然后给你一个 NCity * NCity 的矩阵,表示站点间的两两距离。即这个矩阵中第 i 行 第 j 列的元素表示站点 i 和站点 j 的距离。(0<=距离<=1000)再然后有一个整数K(1<=K<=7),表示Lele拉上车的人数。接下来的一行里包括 K 个整数,代表上车的人分别要去的站点。(0<站点<NCity)注意:对于每组测试,Lele都是在站点0拉上乘客的。Output对于每一组测试,在一行内输出一个整数,表示最短路线的长度。Sample Input
RankIDSolvePenaltyABCDEFGHIJKLMNOPRankIDSolvePenaltyABCDEFGHIJKLMNOP11406915013155536324:11:32(-1)53:39:20(-6)55:59:38 26:15:08 59:42:52 126:37:58 50:22:24(-9)32:34:51 27:37:34 48:02:17 24:46:51 73:13:12(-2)129:26:35(-5)150:04:00 30:09:22(-7)2lizhaoqiang157358024:04:28 58:32:27 119:57:25 29:10:45(-5)63:11:13 126:29:04(-1)96:13:33(-8)54:08:43(-6)30:36:39 59:31:21 98:28:54(-2)86:47:47(-1)146:41:08(-2)169:14:43(-3)49:12:23(-14)3OJT157406426:54:36(-4)57:01:54(-3)98:28:54(-3)59:52:27(-10)72:26:46 126:10:25 73:33:21 55:15:40(-2)33:24:53 59:50:40(-5)82:52:00(-2)121:03:30(-7)152:26:55(-7)151:30:32(-2)48:31:53 4wu1667629529(wurong)1551241923:33:57 24:16:00 30:04:39 32:20:09(-9)121:46:33 199:13:21(-1) 34:23:11 (-2) 555661314246624:23:22(-1)30:08:17 168:25:16 77:35:51(-4)170:50:48 129:34:49(-2)106:27:55(-3)80:13:07 47:53:20(-1)96:59:22 121:03:06 56:23:30(-1)6wuyang1002431655(吴杨)12886363 (-1) (-6) (-1) (-1) (-6)7268186116173124:14:38(-1)29:52:28(-1)170:36:41 59:52:37(-7)155:05:38(-3)125:53:54(-5)96:42:43(-1)48:19:14(-1)102:46:17(-3)129:50:07(-1)76:37:27(-4)8zhangb924438326:26:13(-4)32:57:37(-2)77:51:13(-2) (-11)53:20:57 58:45:06(-7) (-1)72:01:15(-4)9naogoulemei(sad)398948170:41:23 194:21:01(-1) 10810747525(过客)2959478:04:00 81:50:45 11516108736(孙春风)1290148:21:37 12NYOJ_TEMP(黄金鑫)19294154:54:10 139568174306 (-2)14bq11301897(JTR)00 (-1) 10/2245% 10/2343% 6/966% 8/4517% 7/887% 9/1656% 8/5215% 8/1747% 9/1850% 8/1747% 8/1553% 4/1428% 5/2123% 5/1050% 8/4418% 113/33134% 10/2245% 10/2343% 6/966% 8/4517% 7/887% 9/1656% 8/5215% 8/1747% 9/1850% 8/1747% 8/1553% 4/1428% 5/2123% 5/1050% 8/4418% 113/33134%Please enable JavaScript to view the <a href="http://disqus.com/?ref_noscript">comments powered by Disqus.</a>
3 0 1 2 1 0 3 2 3 0 3 1 1 2 0Sample Output
4
#include<stdio.h> #include<string.h> int a[100][100]; int n; int b[100],k,cn,ma; void dfs(int s,int cnt,int k) { int i; if(cnt==cn) { if(k<ma) ma=k; return; } for(i=1;i<n;i++) { if(b[i]) { b[i]=0; dfs(i,cnt+1,k+a[s][i]); b[i]=1; } } } int main() { int i,j,m,p; while(scanf("%d",&n)&&n) { memset(b,0,sizeof(b)); for(i=0;i<n;i++) { for(j=0;j<n;j++) { scanf("%d",&a[i][j]); } } cn=0; ma=1000000; scanf("%d",&m); for(i=1;i<=m;i++) {scanf("%d",&p); if(b[p]==0) { cn++;//记录不重复的站台有几个 b[p]=1; } } dfs(0,0,0); printf("%d\n",ma); } return 0; }HintPrevious12345…500000NextProcessing...
RunID | User | ProblemAll A - Kill the monster B - 下沙小面的(2)C - Fire Net D - 胜利大逃亡E - Knight Moves F - NightmareG - 诡异的楼梯 H - RescueI - Red and Black J - Dungeon MasterK - 棋盘问题 L - Chocolate M - A Knight's JourneyN - Children of the Candy CornO - Pots P - Catch That Cow All | ResultAll Accepted Presentation ErrorWrong Answer Time Limit ExceedMemory Limit Exceed Output Limit ExceedRuntime Error Compile ErrorUnknown Error Submit ErrorQueuing && Judging All | Memory(KB) | Time(ms) | LanguageAll C++ CJava Pascal PythonC# RubyOther All | Length(Bytes) | Submit Time |
---|---|---|---|---|---|---|---|---|
5634123 | 268186 | B | Accepted | 1424KB | 15 ms | G++ | 836 | 35 sec ago |
5634004 | 268186 | B | Wrong Answer | G++ | 878 | 11 min ago | ||
5633998 | 268186 | A | Time Limit Exceeded | G++ | 878 | 12 min ago | ||
5633993 | 268186 | C | Wrong Answer | G++ | 878 | 12 min ago | ||
5631146 | naogoulemei | E | Accepted | 2656 | 530 | C++ | 1127 | 15 hr ago |
5630409 | wuyang1002431655 | N | Accepted | 752 | 16 | G++ | 3434 | 16 hr ago |
5627747 | zhangb | K | Accepted | 388 | 32 | G++ | 718 | 1 days ago |
5627742 | zhangb | K | Wrong Answer | G++ | 674 | 1 days ago | ||
5627615 | wuyang1002431655 | E | Accepted | 1736 | 62 | C++ | 1777 | 1 days ago |
5627610 | wuyang1002431655 | E | Output Limit Exceeded | C++ | 1785 | 1 days ago | ||
5625967 | 5566 | O | Compile Error | G++ | 2137 | 2 days ago | ||
5625939 | 5566 | O | Accepted | 768 | 32 | G++ | 2692 | 2 days ago |
5625737 | zhangb | F | Accepted | 1492 | 0 | G++ | 1559 | 2 days ago |
5625482 | wuyang1002431655 | G | Accepted | 1736 | 0 | C++ | 4075 | 2 days ago |
5625416 | wuyang1002431655 | G | Wrong Answer | C++ | 3460 | 2 days ago | ||
5625345 | wuyang1002431655 | G | Wrong Answer | C++ | 3461 | 2 days ago | ||
5625339 | wuyang1002431655 | G | Wrong Answer | C++ | 3461 | 2 days ago | ||
5625133 | wuyang1002431655 | G | Wrong Answer | C++ | 3459 | 2 days ago | ||
5625071 | wuyang1002431655 | G | Wrong Answer | C++ | 3459 | 2 days ago | ||
5624987 | wuyang1002431655 | G | Wrong Answer | C++ | 3253 | 2 days ago |
相关文章推荐
- 输入一个整数,将其个位数字颠倒顺序后输出
- rabitmq 分析
- 【数据结构队列的应用】用队列打印杨辉三角
- jquery的ajax.beforeSend事件失效
- GCD使用经验与技巧浅谈
- 单、复利计算程序
- Linux内核的启动过程分析
- IEEE的latex模板的单双栏设置方法
- find 命令格式与用法
- java学习---char和int的类型转换问题
- 神似 Win10!Linux LXQt 16.03 系统正式发布下载
- SQOOP 基础及安装
- 虚拟机service network restart没有反应解决方法
- 关于KMeans的评价及聚簇结果的得到
- Linux基础:shell中正则表达式grep,egrep的基础用法
- 使用application类定义全局变量传递参数
- android模拟器无法访问本地的tomcat
- 哈夫曼树和哈夫曼编码基本概念及构造(上篇)
- 单链表创建
- 2013下半年软件评測师真题考试分析-3