```cpp
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<map>
#define ll long long
#define re register
#define il inline
#define fp(i,a,b) for(register int i=a;i<=b;i++)
#define fq(i,a,b) for(register int i=a;i>=b;i--)
using namespace std;
map<int,int>t,x;
int n,m,r,ta,tb,tc,td,a,h,e,c,j[2005]={},g=0,f[2005]={};
ll ans1=0,ans2=0;
int s1,s2;
il int gi()
{
re short int t=1;
re int x=0;
re char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-') ch=getchar();
if(ch=='-') t=-1,ch=getchar();
while(ch>='0'&&ch<='9') x=x*10+ch-48,ch=getchar();
return x*t;
}
int main()
{
n=gi();m=gi();
fp(i,1,n)
t[i]=gi();
fp(i,1,m)
x[i]=gi();
ta=gi();tb=gi();tc=gi();td=gi();a=gi();h=gi();e=gi();r=gi();
ans1+=n*ta;ans2+=n*ta;
fp(i,1,r)
{
s1=gi();s2=gi();c=gi();
int w=0;
fp(k,1,m)
if(x[k]==s2) {w=k;break;}
j[w]++;
fp(k,1,m)
if(t[k]==s1) {w=k;break;}
if(e&&c>f[w]) f[w]=c,g+=td;
}
fp(i,1,m)
{
int p=tb*j[i],z=ta+tc*j[i];
if(p>z) ans1+=z;
else ans1+=p;
}
ans1+=g;
ans2=(int)((ans2+r*tc)/(a/100.0))+h;
printf("%lld\n%lld\n",ans1,ans2);
if(ans1<=ans2) printf("Forget it...\n");
else printf("Use Luogu!\n");
return 0;
}
```
by ysner @ 2017-07-31 21:16:37
@[zhouyonglong](/space/show?uid=9433)
by ysner @ 2017-07-31 21:21:44
@[燕山楠](/space/show?uid=21534) 已修复，请重新提交。
by FlierKing @ 2017-07-31 21:51:05
惊现潜水管理
by Maxrage @ 2019-11-03 19:37:42
考古
by smy2006 @ 2019-12-15 11:45:25
考古
by Ryo_Yamada @ 2020-01-30 12:31:21