UVa 119 – Greedy Gift Givers


/*
User ID: turing_13
Link : http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=55
*/

#include <bits/stdc++.h>

#define pii pair <int,int>
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
#define ms(a,b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define MP make_pair
#define oo 1<<29
#define dd double
#define ll long long
#define EPS 10E-10
#define ff first
#define ss second
#define MAX 10000
#define SZ(a) (int)a.size()
#define getint(a) scanf("%d",&a)
#define loop(i,n) for(int i=0;i<n;i++)
#define all(a) a.begin(),a.end()
#define intlim 2147483648
#define inf 1000000
#define rtintlim 46340
#define llim 9223372036854775808
#define rtllim 3037000499
#define ull unsigned long long
#define I int

using namespace std;

struct data
{
    string name;
    int initial_value,final_value;
};

bool test=0;
int main()
{
    ///freopen("in.txt","r",stdin);
    //freopen("gift1.out","w",stdout);

    vector<data>v;
    map<string,int>mp;
    int n;
    data sample;

    while(cin>>n)
    {
        if(test)
            cout<<endl;
        test=1;
        for(int i=0; i<n; i++)
        {
            cin>>sample.name;
            sample.initial_value=0;
            sample.final_value=0;
            v.pb(sample);
            mp[sample.name]=i;
        }

        string str,str1;
        int a,b;

        for(int i=0; i<n; i++)
        {
            cin>>str>>a>>b;
            v[mp[str]].initial_value=a;
            int c=0;

            for(int j=0; j<b; j++)
            {
                cin>>str1;
                v[mp[str1]].final_value+=(a/b);
                c+=(a/b);
            }

            v[mp[str]].final_value+=(a-c);
        }

        for(int i=0; i<n; i++)
            cout<<v[i].name<<" "<<v[i].final_value-v[i].initial_value<<endl;
        v.clear();
        mp.clear();
        str.clear();
        str1.clear();
    }
    return 0;
}

0 0 votes
Article Rating
Subscribe
Notify of
guest
0 Comments
Inline Feedbacks
View all comments