-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathA.cpp
40 lines (37 loc) · 1.07 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
#include <bits/stdc++.h>
#define fi first
#define se second
#define db double
#define U unsigned
#define P std::pair<int,int>
#define LL long long
#define pb push_back
#define MP std::make_pair
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;++i)
#define ROF(i,a,b) for(int i = a;i >= b;--i)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl
const int MAXN = 100+5;
int a[MAXN],b[MAXN],c[MAXN],n;
int d[MAXN];
int main(){
int T;scanf("%d",&T);
while(T--){
scanf("%d",&n);
FOR(i,1,n) scanf("%d",a+i);
FOR(i,1,n) scanf("%d",b+i);
FOR(i,1,n) scanf("%d",c+i);
d[1] = a[1];
FOR(i,2,n-1){
if(a[i] != d[i-1]) d[i] = a[i];
else if(b[i] != d[i-1]) d[i] = b[i];
else d[i] = c[i];
}
if(a[n] != d[n-1] && a[n] != d[1]) d[n] = a[n];
else if(b[n] != d[n-1] && b[n] != d[1]) d[n] = b[n];
else d[n] = c[n];
FOR(i,1,n) printf("%d ",d[i]);puts("");
}
return 0;
}