P1201-[USACO1.1]贪婪的送礼者Greedy Gift Givers

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define maxn 13003
#define _for(i,a,b) for(int i = (a);i < b;i ++)
typedef long long ll;
using namespace std;

inline ll read()
{
    ll ans = 0;
    char ch = getchar(), last = ' ';
    while(!isdigit(ch)) last = ch, ch = getchar();
    while(isdigit(ch)) ans = (ans << 1) + (ans << 3) + ch - '0', ch = getchar();
    if(last == '-') ans = -ans;
    return ans;
}
inline void write(ll x)
{
    if(x < 0) x = -x, putchar('-');
    if(x >= 10) write(x / 10);
    putchar(x % 10 + '0');
}
int NP;
map<string,int> m;
vector<string> v;
int main()
{
    NP = read();
    _for(i,0,NP)
    {
        string t;
        cin >> t;
        v.push_back(t);
        m[t] = 0;
    }
    
    _for(i,0,NP)
    {
        string t;
        cin >> t;
        auto iter = m.find(t);
        int a,b;
        cin >> a >> b;
        if(b)
            iter->second -= b*(a/b);
        _for(i,0,b)
        {
            string t2;
            cin >> t2;
            m[t2] += a/b;
        }
    }
    
    _for(i,0,NP)
    {
        auto iter = m.find(v[i]);
        cout << iter->first << " " << iter->second << endl; 
    }
    return 0;
}