-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathA.cpp
74 lines (64 loc) · 1.31 KB
/
A.cpp
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
74
/*
Author: Aditya Tomar
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define mod 1000000007
#define e "\n"
#define len(x) x.size()
#define gcd(a, b) __gcd(a, b)
#define ste(v) v.begin(), v.end()
#define stea(arr, n) arr, arr+n
void solve(){
// Solve here
int n;
cin>>n;
int v[3][n];
for(int i=0;i<3;i++) {
for(int j=0;j<n;j++) {
cin>>v[i][j];
}
}
vector<int> ans;
for(int i=0;i<n;i++) {
if(i==0) ans.pb(v[0][0]);
else if(i<n-1){
for(int j=0;j<3;j++) {
if(v[j][i] != ans[i-1]) {
ans.pb(v[j][i]);
break;
}
}
} else {
for(int j=0;j<3;j++) {
if(v[j][i] != ans[i-1] and v[j][i] != ans[0]) {
ans.pb(v[j][i]);
break;
}
}
}
}
for(auto i:ans) {
cout<<i<<" ";
}
cout<<e;
ans.clear();
}
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
int t;
cin>>t;
while(t--){
solve();
}
return 0;
}