记录编号	581180	评测结果	AAAAA
题目名称	21.[HAOI 2005]希望小学	最终得分	100
用户昵称	┭┮﹏┭┮	是否通过	通过
代码语言	C++	运行时间	0.000 s
提交时间	2023-07-30 20:42:28	内存使用	0.00 MiB

#include <bits/stdc++.h>
using namespace std;
const int N = 110,M = 310;
int n,m,b1,b2,b3,g1,g2,g3;
int b[N],g[N];
struct node{
	int st,up,dn;
};
struct made{
	int ver,nx;
	node ed;
}e[M];
int hd[N],v[N],d[N],ds[N][N],tot,ans = INT_MAX,s1;
void add_(int x,int y,node z){
	tot++;
	e[tot].ver = y,e[tot].ed = z,e[tot].nx = hd[x],hd[x] = tot;
}
void init(){
	scanf("%d%d%d%d%d%d%d",&n,&b1,&b2,&b3,&g1,&g2,&g3);
	for(int i = 1;i <= n;i++)scanf("%d",&b[i]);
	for(int i = 1;i <= n;i++)scanf("%d",&g[i]);
	scanf("%d",&m);
	for(int i = 1;i <= m;i++){
		int x,y;node z,zz;
		scanf("%d%d%d%d%d",&x,&y,&z.st,&z.up,&z.dn);
		zz.st = z.st,zz.up = z.dn,zz.dn = z.up;
		add_(x,y,z);
		add_(y,x,zz);
	}
}
int time_(int x,node z){
	return b[x] * b1 * z.st + b[x] * b2 * z.up + b[x] * b3 * z.dn + g[x] * g1 * z.st + g[x] * g2 * z.up + g[x] * g3 * z.dn;
}
void spfa(int x){
	memset(v,0,sizeof(v));
	for(int i = 1;i <= n;i++)d[i] = INT_MAX;
	queue<int>q;
	d[x] = 0,v[x] = 1;
	q.push(x);
	while(!q.empty()){
		int x = q.front();q.pop();
		v[x] = 0;
		for(int i = hd[x];i;i = e[i].nx){
			int y = e[i].ver;node z = e[i].ed;
			int su = time_(x,z);
			if(d[x] + su < d[y]){
				d[y] = d[x] + su;
				if(!v[y])q.push(y),v[y] = 1;
			}
			
		}
	}
}
int main(){
	freopen("hopeschool.in","r",stdin);
	freopen("hopeschool.out","w",stdout);
	init();
	for(int i = 1;i <= n;i++){
		spfa(i);
		for(int j = 1;j <= n;j++){
			ds[i][j] = d[j];
		}
	}
	for(int i = 1;i <= n;i++){
		int s = 0;
		for(int j = 1;j <= n;j++){
		    s += ds[j][i];
		}
		if(s < ans){
			ans = s,s1 = i;
		}
	}
	printf("%d\n",s1);
	
	return 0;
	
}