Problem Link : https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=2897

Solution Idea:

This is an interesting simulation problem. Read the problem statement carefully and try to simulate the problem using programming.

/*
         +-+ +-+ +-+
         |R| |.| |S|
         +-+ +-+ +-+
*/

#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 db              double
#define ll              long long
#define EPS             10E-10
#define ff              first
#define ss              second
#define sqr(x)          (x)*(x)
#define D(x)            cout<<#x " = "<<(x)<<endl
#define VI              vector <int>
#define DBG             pf("Hi\n")
#define MOD             100007
#define MAX             10000
#define CIN             ios_base::sync_with_stdio(0); cin.tie(0)
#define SZ(a)           (int)a.size()
#define sf(a)           scanf("%d",&a)
#define sfl(a)          scanf("%lld",&a)
#define sff(a,b)        scanf("%d %d",&a,&b)
#define sffl(a,b)       scanf("%lld %lld",&a,&b)
#define sfff(a,b,c)     scanf("%d %d %d",&a,&b,&c)
#define sfffl(a,b,c)    scanf("%lld %lld %lld",&a,&b,&c)
#define loop(i,n)       for(int i=0;i<n;i++)
#define REP(i,a,b)      for(int i=a;i<b;i++)
#define TEST_CASE(t)    for(int z=1;z<=t;z++)
#define PRINT_CASE      printf("Case %d: ",z)
#define CASE_PRINT      cout<<"Case "<<z<<":"<<endl;
#define all(a)          a.begin(),a.end()
#define intlim          2147483648
#define inf             1000000
#define ull             unsigned long long

using namespace std;


/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

/*-----------------------Bitmask------------------*/
//int Set(int N,int pos){return N=N | (1<<pos);}
//int reset(int N,int pos){return N= N & ~(1<<pos);}
//bool check(int N,int pos){return (bool)(N & (1<<pos));}
/*------------------------------------------------*/

int ara[10];

string sss[7]={"Ja", "Sam", "Sha", "Sid", "Tan"};

int main()
{
    CIN;
    ///freopen("in.txt","r",stdin);
    ///freopen("out.txt","w",stdout);

    map<string, int>mp;
    mp["Ja"]=0;
    mp["Sam"]=1;
    mp["Sha"]=2;
    mp["Sid"]=3;
    mp["Tan"]=4;

    int t;
    cin>>t;
    TEST_CASE(t)
    {
        ms(ara,0);
        int m,n;
        string str;
        cin>>m>>n>>str;
        deque<string> Q[6];
        loop(i,5)
        {
            int k;
            cin>>k;
            loop(j,k)
            {
                string s1;
                cin>>s1;
                Q[i].push_back(s1);
            }
        }
        while(n>0)
        {
            if(m>n)
            {
                ara[mp[str]]+=n;
                n=0;
                break;
            }
            else
            {
                int xx=mp[str];
                ara[xx]+=m;
                n-=m;
                n-=2;
                str=Q[xx].front();
                Q[xx].push_back(Q[xx].front());
                Q[xx].pop_front();
            }
        }

        CASE_PRINT;
        for(int i=0;i<5;i++)
        {
            cout<<sss[i]<<" "<<ara[i]<<endl;
        }

        loop(i,6) Q[i].clear();

    }
    return 0;
}