UvaSolution/uva10152 - ShellSort.cpp at master · Masum95/UvaSolution · 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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
#include<bits/stdc++.h>
#include <functional>
#define pb(n) push_back(n)
#define bug cout<<"bug";
#define all(c) c.begin(),c.end()
#define fr(i,n) for(i=0;i<n;i++)
#define sf(n) scanf("%d",&n)
#define mst(n) memset(n,0,sizeof(n))
#define nl printf("\n")
#define lli long long int
#define tr(container,it) \
    for (auto it = container.begin(); it != container.end() ; ++it)

#define INF INT_MAX
#define mp(i,j) make_pair(i,j)
#define mstn(n) memset(n,-1,sizeof(n))
#define infile freopen("in.txt","r",stdin)
#define outfile freopen("out.txt","w",stdout)
#define ull unsigned long long
#define V 1000001
#define sz 1005
#define MOD 1000000007
using namespace std;

int main()
{
    int test,kase = 1;
    sf(test);
    while(test--)
    {
        int num;
        sf(num);
        getchar();
        string str;
        vector<string> given;
        map<string,int> imap;

        for(int i=1; i<=num; i++)
        {
            getline(cin,str);
            imap[str] = num-i;
            given.push_back(str);
        }
        reverse(all(given));

        int req[num],ordering[num];
        for(int i=num-1; i>=0; i--)
        {
            getline(cin,str);
            req[imap[str]] = i;
            ordering[i] = imap[str];
        }
        int cnt = 0;
        vector<int> stk;

        for(int i=0;i<num;i++)
        {
            if(imap[given[i]]-cnt<req[imap[given[i]]])
            {
                cnt++;
                stk.push_back(req[imap[given[i]]]);
            }
        }
        sort(all(stk));

        for(int i=0; i<stk.size(); i++)
        {
            printf("%s\n",given[ordering[stk[i]]].c_str());
        }
        nl;
    }

}