USER: Kevin Samuel [kevin_s1]
TASK: comehome
LANG: C++ Compiling...
Compile: OK Executing...
Test 1: TEST OK [0.003 secs, 3376 KB]
Test 2: TEST OK [0.005 secs, 3376 KB]
Test 3: TEST OK [0.005 secs, 3376 KB]
Test 4: TEST OK [0.005 secs, 3376 KB]
Test 5: TEST OK [0.011 secs, 3376 KB]
Test 6: TEST OK [0.019 secs, 3376 KB]
Test 7: TEST OK [0.035 secs, 3376 KB]
Test 8: TEST OK [0.005 secs, 3376 KB]
Test 9: TEST OK [0.008 secs, 3376 KB] All tests OK. YOUR PROGRAM ('comehome') WORKED FIRST TIME! That's fantastic
-- and a rare thing. Please accept these special automated congratulations. very easy, it's a shortest path problem 建图时直接以A-Z和a-z作为节点建图,我用了一个简单的Dijkstra算法,从Z 点反向找近期的点
/*
ID:kevin_s1
PROG:comehome
LANG:C++
*/ #include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <list>
#include <cmath> using namespace std; #define MAXN 53
#define INF 99999 //gobal variable==== int P;
int Graph[MAXN][MAXN];
int result;
int Dist[MAXN]; int visited[MAXN];
//================== //function==========
int Convert(char ch){
int index = -1;
if(ch >= 'A' && ch <= 'Z'){
index = ch - 'A' + 1;
}
else if(ch >= 'a' && ch <= 'z'){
index = ch - 'a' + 27;
}
else
index = -1;
return index;
} int Dijkstra(int v0){
int min;
int k;
//init
for(int i = 1; i < MAXN; i++){
visited[i] = false;
Dist[i] = Graph[v0][i];
}
Dist[v0] = 0;
visited[v0] = 1;
for(int v = 1; v < MAXN; v++){
min = INF;
for(int w = 1; w < MAXN; w++){
if(!visited[w] && (Dist[w] < min)){
min = Dist[w];
k = w;
}
}
visited[k] = 1;
for(int w = 1; w < MAXN; w++){
if(!visited[w] && (min + Graph[k][w] < Dist[w])){
Dist[w] = min + Graph[k][w];
}
}
}
int Min = INF;
for(int i = 1; i < MAXN; i++){
if(Dist[i] < Min && i >= 1 && i <= 26 && Dist[i] > 0){
Min = Dist[i];
result = i;
}
}
return Min;
} //================== int main(){
freopen("comehome.in","r",stdin);
freopen("comehome.out","w",stdout);
cin>>P; for(int i = 1; i < MAXN; i++){
Graph[i][i] = INF;
for(int j = 1; j < MAXN; j++){
Graph[i][j] = INF;
}
}
memset(visited, 0, sizeof(visited));
while(P--){
char chst, chen;
int dist;
cin>>chst>>chen>>dist;
int st = Convert(chst);
int en = Convert(chen);
if(dist < Graph[st][en]){
Graph[st][en] = dist;
Graph[en][st] = dist;
}
}
int ans = Dijkstra(26);
char chfarm = 'A' + result - 1;
cout<<chfarm<<" ";
cout<<ans<<endl;
return 0;
}

USACO comehome Dijkstra的更多相关文章

  1. Cogs 309. [USACO 3.2] 香甜的黄油 dijkstra,堆,最短路,floyd

    题目:http://cojs.tk/cogs/problem/problem.php?pid=309 309. [USACO 3.2] 香甜的黄油 ★★   输入文件:butter.in   输出文件 ...

  2. cogs 176. [USACO Feb07] 奶牛聚会 dijkstra

    176. [USACO Feb07] 奶牛聚会 ★☆   输入文件:sparty.in   输出文件:sparty.out   简单对比时间限制:3 s   内存限制:16 MB 译: zqzas N ...

  3. cogs 397. [USACO Oct09] 热浪 Dijkstra

    397. [USACO Oct09] 热浪 ★☆   输入文件:heatwvx.in   输出文件:heatwvx.out   简单对比时间限制:1 s   内存限制:128 MB 德克薩斯純樸的民眾 ...

  4. USACO 2008 January Silver Telephone Lines /// 二分最短路 邻接表dijkstra oj22924

    题目大意: 一共有N (1 ≤ N ≤ 1,000)个电线杆,有P P (1 ≤ P ≤ 10,000)对电线杆是可以连接的, 用几条线连接在一起的电线杆之间都可相互通信,现在想要使得电线杆1和电线杆 ...

  5. 【USACO 2.4 】Bessie Come Home

    题意:给出n条有权的双向边(10000),求到达Z最近的大写字母,及其距离. 题解:即求Z出发的最短路,用dijstra就可以了,注意边要开到20000以上. /* TASK: comehome LA ...

  6. 洛谷 P1529 回家 Bessie Come Home Label:Dijkstra最短路 && 乱搞

    题目描述 现在是晚餐时间,而母牛们在外面分散的牧场中. 农民约翰按响了电铃,所以她们开始向谷仓走去. 你的工作是要指出哪只母牛会最先到达谷仓(在给出的测试数据中,总会有且只有一只最快的母牛). 在挤奶 ...

  7. TYVJ P1031 热浪 Label:dijkstra 最短路

    背景 USACO OCT09 9TH 描述 德克萨斯纯朴的民眾们这个夏天正在遭受巨大的热浪!!!他们的德克萨斯长角牛吃起来不错,可是他们并不是很擅长生產富含奶油的乳製品.Farmer John此时以先 ...

  8. 8.8-8.10 usaco

    summary:44 没救了...整天刷水迟早药丸! ❤bzoj3892: 区间dp.我原来的思路是dp[i][j]表示前i个数跳过了j次,那么转移可以前k个数转移了j-1次,枚举k就好了,但是这样是 ...

  9. usaco silver

    大神们都在刷usaco,我也来水一水 1606: [Usaco2008 Dec]Hay For Sale 购买干草   裸背包 1607: [Usaco2008 Dec]Patting Heads 轻 ...

随机推荐

  1. php运行

    运行命令: $php 1.php php教程: http://www.w3school.com.cn/php/php_variables.asp

  2. 在gfs2中关闭selinux

    在构建iSCSI存储集群时,请勿在gfs2中使用selinux

  3. 最短路知识点总结(Dijkstra,Floyd,SPFA,Bellman-Ford)

    Dijkstra算法: 解决的问题: 带权重的有向图上单源最短路径问题.且权重都为非负值.如果采用的实现方法合适,Dijkstra运行时间要低于Bellman-Ford算法. 思路: 如果存在一条从i ...

  4. How to Design Programs, Second Edition

    How to Design Programs, Second Edition How to Design Programs, Second Edition

  5. 如何下载和编译Android4.0内核源代码goldfish(图像)

    如何下载Android4.0源代码.请参阅我的博客文章中有(同样是图文教程): http://blog.csdn.net/flydream0/article/details/7036156 怎样编译A ...

  6. [Android]ADT Run时候报错:The connection to adb is down, and a severe error has occured

    The connection to adb is down, and a severe error has occured. 之 ..\sdk\platform-tools\adb.exe and c ...

  7. 高逼格UI-ASD(Android Support Design)

    绪 今年的Google IO给我们android开发着带来了三样非常屌非常屌的library: ASD(Android Support Design) APL(Android Percent Layo ...

  8. ZXing拍摄代码扫描之后以区分一维码、二维码、其他代码

    我怎么有二维码没有联系,最近遇到一个问题,,如何推断条码扫描到一维代码或者二维代码,辛苦了一个下午下班后自己,加上网上跟踪信息. 总结出两种方式能够解决该问题(推荐採用另外一种方式): 1.改动源代码 ...

  9. 在后台运行erlang;在需要时连回交互模式

    * 1. 启动后台运行的erlang环境 按以下命令: erl -detached -name a@127.0.0.1 注意,-name的值必须是xxxx@ip的形式.其中xxxx是英文名,ip必须是 ...

  10. ubuntu 经常使用软件及环境

    安装完系统后,更新系统 sudo apt-get update # 更新源索引 sudo apt-get dist-upgrade # 更新系统 sudo apt-get autoremove 1安装 ...