qt
查看原帖
qt
809708
whssy楼主2023/7/14 17:18
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1001;
int n,m;
int p[N];
int s[N];
int ta,tb,tc,td,a,h;bool e;
int r;
map<int,map<int,int>>excel,xs,cena;
int ct,lg;
map<int,map<int,bool>>vis;
signed main(){
	scanf("%lld%lld",&n,&m);
	for(int i=1;i<=n;i++)
		scanf("%lld",&p[i]);
	for(int i=1;i<=m;i++)
		scanf("%lld",&s[i]);
	scanf("%lld%lld%lld%lld%lld%lld%d",&ta,&tb,&tc,&td,&a,&h,&e);
	ct+=1ll*n*ta;
	lg+=1ll*n*ta;
	scanf("%lld",&r);
	while(r--){
		int pr,sr,sc;
		scanf("%lld%lld%lld",&pr,&sr,&sc);
		cena[sr][pr]+=tb;
		if(vis[sr][pr]) xs[sr][pr]+=tc;
		else{
			xs[sr][pr]+=ta+tc;
			vis[sr][pr]=1;
		}
		if(e)
			if(sc>excel[sr][pr]){
				excel[sr][pr]=sc;
				cena[sr][pr]+=td;
				xs[sr][pr]+=td;
			}
		lg+=tc;
	}
	lg=lg*100.0/a;
	lg+=h;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			ct+=min(cena[s[i]][p[j]],xs[s[i]][p[j]]);
	printf("%lld\n%lld\n",ct,lg);
	if(lg<ct) puts("Use Luogu!");
	else puts("Forget it...");
	return 0;
}
2023/7/14 17:18
加载中...