// 修改前
// A1087.cpp: 主项目文件。
#include "stdafx.h"
#include <map>
#include <vector>
#include <stack>
using namespace std;
const int inf=0x7f7f7f7f;
int st,ed,s_num,s_sort;
int happy[210];
map <char*,int> hash;
map <int,char*> rhash;
stack<int> stck;
struct Node{
int t,w;
}p;
vector <Node> node[210];
struct Ans{
int sum,num;
}ans;
vector <int> path;
int cct,n;
int dis[210],vis[210],pro[210];
void dijk(int s,int t){
memset(vis,0,sizeof vis);
memset(dis,0x7f,sizeof dis);
for(int i=0;i<n;i++) pro[i]=s;
for(int i=0;i<node[s].size();i++){
if(node[s][i].t==t){
ans.sum=happy[node[s][t].t];
ans.num=1;
path.push_back(node[s][i].t);
}
dis[node[s][i].t]=node[s][i].w;
}
int T=n-1;vis[s]=1,dis[s]=0;
while(T--){
int id,Max=inf;
for(int i=0;i<n;i++){
if(Max>dis[i]&&!vis[i]) id=i,Max=dis[i];
}
vis[id]=1;
for(int i=0;i<node[id].size();i++){
int to=node[id][i].t;
int cost=node[id][i].w;
if(dis[to]>=dis[id]+cost){
dis[to]=dis[id]+cost;
pro[to]=id;
if(to==t){
int f=t;
int sum0=0,num=0;
while(f!=s){
stck.push(f);
num++;sum0+=happy[f];
f=pro[f];
}
if(sum0>ans.sum||(sum0==ans.sum&&ans.num<num)){
path.clear();
ans.sum=sum0;
ans.num=num;
cct=1;
while(!stck.empty()){
path.push_back(stck.top());
stck.pop();
path.push_back(0);
}
}
}
if(dis[to]==dis[id]+cost) cct++;
}
}
}
printf("%d%d%d%d\n",cct,dis[ed],ans.sum,ans.sum*1.0/ans.num-0.5);
for(int i=0;i<path.size();i++){
printf("%s%s",rhash[path[i]],i==(path.size()-1)?"\n":"->");
}
}
int main()
{
int cnt=0,k,cost;
char* city,*city1,*city2,*start;
st=0;
scanf("%d%d%s",&n,&k,&start);
hash[start]=cnt,rhash[cnt++]=start;
for(int i=0;i<n-1;i++){
scanf("%s%d",&city,&happy[cnt]);
if(city=="ROM") ed=cnt;
hash[city]=cnt,rhash[cnt++]=city;
}
for(int i=0;i<k;i++){
scanf("%s%s%d",&city1,&city2,&cost);
int s=hash[city1],t=hash[city2];
p.t=t,p.w=cost;
node[s].push_back(p);
p.t=s;node[t].push_back(p);
}
dijk(st,ed);
while(1){}
return 0;
}
--------------------------------------------------------------------------------------------------
// 修改后
// A1087_CYB.cpp: 主项目文件。
#include "stdafx.h"
#include <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cstdlib>
#include <climits>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
const int MAXN = 200 + 5;
const int MAXM = 10000 + 5;
const int INF = 0x7f7f7f7f;
const int MOD = 1000000007;
template <class XSD> inline XSD f_min(XSD a, XSD b) { if (a > b) a = b; return a; }
template <class XSD> inline XSD f_max(XSD a, XSD b) { if (a < b) a = b; return a; }
template<class XSD> XSD f_gcd(XSD a, XSD b) { return b?f_gcd(b,a%b):a;}
template <class XSD> inline XSD f_abs(XSD a) { return a<0?(-a):a; }
int n, m;
///最短路变形
int rom;
struct NODE{
char id[10];
int hap;
}node[MAXN];
int cost[MAXN][MAXN];
void Getdata(){
rom=-1;
scanf(" %s", node[1].id);
node[1].hap=0;
memset(cost, 0x7f, sizeof cost);cost[1][1]=0;
for(int i=2; i<=n; i++){
cost[i][i]=0;
scanf(" %s%d", node[i].id, &node[i].hap);
if(strcmp(node[i].id, "ROM")==0) rom=i;
}
while(m--){
char s[10], t[10];
int u, v, c;
scanf(" %s%s%d", s, t, &c);
for(int i=1; i<=n; i++){
if(strcmp(node[i].id, s)==0) u=i;
if(strcmp(node[i].id, t)==0) v=i;
}
cost[u][v]=c, cost[v][u]=c;
}
}
int dist[MAXN], deep[MAXN], happiness[MAXN], pre[MAXN], cnt[MAXN];
bool vis[MAXN];
void dijk(int s, int t){
memset(cnt, 0, sizeof cnt);
memset(vis, false, sizeof vis);
memset(dist, 0x7f, sizeof dist);
memset(deep, 0x7f, sizeof deep);
memset(happiness, 0, sizeof happiness);
for(int i=1; i<=n; i++){
dist[i]=cost[s][i];cnt[i]=1;
if(dist[i]!=INF) deep[i]=1, happiness[i]=node[i].hap, pre[i]=s;
}
deep[s]=0, vis[s]=true, dist[s]=0, happiness[s]=0;
int T=n-1;
while(T--){
int min_=INF, pos=s;
for(int i=1; i<=n; i++){
if(min_>dist[i] && !vis[i]){
min_=dist[i];
pos=i;
}
}
vis[pos]=true;
for(int i=1; i<=n; i++){
if(!vis[i]){
if(dist[pos]+cost[pos][i]==dist[i]) cnt[i]+=cnt[pos];
bool flag=true;
if(dist[i]>dist[pos]+cost[pos][i]){
dist[i]=dist[pos]+cost[pos][i];
happiness[i]=happiness[pos]+node[i].hap;
cnt[i]=cnt[pos];
}
else if(dist[pos]+cost[pos][i]==dist[i] && happiness[i]<(happiness[pos]+node[i].hap)){
happiness[i]=happiness[pos]+node[i].hap;
}
else if(dist[pos]+cost[pos][i]==dist[i] && happiness[i]==(happiness[pos]+node[i].hap) && deep[pos]+1<deep[i]){
}
else flag=false;
if(flag) pre[i]=pos, deep[i]=deep[pos]+1;
}
}
}
}
void Solve(){
dijk(1, rom);
///输出
printf("%d %d %d %d\n", cnt[rom], dist[rom], happiness[rom], happiness[rom]/deep[rom]);
int u=1, v=rom;
stack<char*>sta;
sta.push("ROM");
while(pre[v]!=u){
sta.push(node[pre[v]].id);
v=pre[v];
}
sta.push(node[1].id);
while(!sta.empty()){
int l=sta.size();
printf("%s", sta.top());
printf("%s", l==1?"\n":"->");
sta.pop();
}
}
int main(){
while(~scanf("%d%d", &n, &m)){
Getdata();
Solve();
}
return 0;
}