2+8+9+10 wa 好久不写题手生了求调

#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read()
{
    int x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9')
    {
        if(ch=='-')
            f=-1;
        ch=getchar();
    }
    while(ch>='0' && ch<='9')
        x=x*10+ch-'0',ch=getchar();
    return x*f;
}
void write(int x)
{
    if(x<0)
        putchar('-'),x=-x;
    if(x>9)
        write(x/10);
    putchar(x%10+'0');
    return;
}
const int maxN = 2E3+10;
int n,m,ta,tb,tc,td,a,h,e,r,pr,sr,sc,sum1,sum2,sum[maxN][maxN],F[maxN][maxN];
map<int,int> tid,uid;
signed main(){
	n=read(); m=read();
	for(int i=1; i<=n; ++i) tid[read()]=i;
	for(int i=1; i<=m; ++i) uid[read()]=i;
	ta=read(); tb=read(); tc=read(); td=read(); a=read(); h=read(); e=read(); r=read();
	sum1=n*ta; sum2=n*ta+r*tc;
	for(int i=1; i<=r; ++i){
		pr=read(); sr=read(); sc=read();
		int u=tid[pr],v=uid[sr];
		++sum[u][v];
		sum1+=(e&&F[u][v]<sc)*td; F[u][v]=(e&&F[u][v]<sc)*sc;
	}
	for(int i=1; i<=n; ++i) for(int j=1; j<=m; ++j) sum1+=min(ta+tc*sum[i][j],tb*sum[i][j]);
	sum2=(int)(sum2/(a/100.0))+h;
	write(sum1);
	cout<<endl;
	write(sum2);
	cout<<endl<<(sum2<sum1?"Use Luogu!\n":"Forget it...\n");
	return 0;
}