Codeforces-solution/WordGame.cpp at main · KmKalpana/Codeforces-solution · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
void solve()
{
    int n;
    cin>>n;
    vector<vector<string>>v(3,vector<string>(n,""));
    unordered_map<string,int>mp;
    for(int i=0; i<3; i++)
    {

           for(int j=0; j<n; j++)
           {
                string s;
               cin>>s;
                mp[s]++;
               v[i][j]=s;
           }
    }
    int cost=0;
    for(int i=0; i<3; i++)
    {
        for(int j=0; j<n; j++)
        {
               if(mp[v[i][j]]==1)
               {
                cost+=3;
               }
               else if(mp[v[i][j]]==2)
               {
                cost+=1;
               }
               else
               {
                cost+=0;
               }
        }
        cout<<cost<<" ";
        cost=0;
    }
    cout<<endl;

}
int main()
{
    int n;
    cin>>n;
    while(n--)
    {
        solve();
    }
    return 0;
}