baoshuo/OI-codes
baoshuo/OI-codes
0
1
Fork 0
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-30 18:36:27 +00:00
Code Releases Activity

P1193 洛谷团队训练VS传统团队训练

Browse Source 
R52404449
This commit is contained in:
Baoshuo Ren 2021-07-05 08:01:35 +08:00 committed by Baoshuo Ren
parent 42092af198
commit 0d24c79482
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68
1 changed files with 38 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

38
Luogu/problem/P1193/P1193.cpp Normal file
View File

@ -0,0 +1,38 @@
#include <bits/stdc++.h>
using namespace std;
int n, m, p[1005], s[1005], ta, tb, tc, td, a, h, e, r, pr, sr, sc, ans1, ans2;
map<int, map<int, int>> m1, m2;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < m; i++) {
cin >> s[i];
for (int i = 0; i < n; i++) {
m1[s[i]][p[i]] = 0;
}
}
cin >> ta >> tb >> tc >> td >> a >> h >> e >> r;
ans2 = (ta * n + tc * r) * 100 / a + h;
ans1 = n * ta;
for (int i = 0; i < r; i++) {
cin >> pr >> sr >> sc;
m2[sr][pr]++;
if (e && m1[sr][pr] < sc) ans1 += td, m1[sr][pr] = sc;
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (m2[s[i]][p[j]]) {
ans1 += min(m2[s[i]][p[j]] * tb, ta + m2[s[i]][p[j]] * tc);
}
}
}
cout << ans1 << endl
<< ans2 << endl
<< (ans1 > ans2 ? "Use Luogu!" : "Forget it...") << endl;
return 0;
}