Run ID | 作者 | 问题 | 语言 | 测评结果 | 分数 | 时间 | 内存 | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|---|
120942 | 廖悦扬 | 互送礼物 | C++ | 通过 | 100 | 0 MS | 264 KB | 971 | 2024-01-21 14:03:08 |
#include <bits/stdc++.h> using namespace std; const int maxn = 10 + 5; int money[maxn], n; unordered_map<string, int> people; string names[maxn]; signed main() { scanf("%d", &n); for (int i=1; i<=n; i++) { char buffer[1024]; scanf("%s", buffer); string s(buffer); people[s] = i; names[i] = s; } for (int i=1; i<=n; i++) { char buffer[1024]; scanf("%s", buffer); string s(buffer); int id = people[s]; int cash, person; scanf("%d%d", &cash, &person); for (int j=1; j<=person; j++) { scanf("%s", buffer); string per(buffer); money[people[per]] += cash/person; } if (person) { money[id] -= cash; money[id] += cash % person; } } for (int i=1; i<=n; i++) { printf("%s %d\n", names[i].c_str(), money[i]); } return 0; }