序列seq （各种特判）

思路：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#define N 58283333
#define LL long long
using namespace std;

int n, wa1, wa2, wb1, wb2, flag, a1, a2, b1, b2;
int a[N], b[N], c[N], vis[N];

void print(){
    for(int i=1; i<=n; i++)
    printf("%d\n", c[i]);
}

int main(){
    freopen ("seq.in", "r", stdin);
    freopen ("seq.out", "w", stdout);
    scanf("%d", &n);
    for(int i=1; i<=n; i++){
        scanf("%d", &a[i]);
        if(vis[a[i]] && wa1) flag = 1;
        if(vis[a[i]]){
            wa1 = vis[a[i]];
            wa2 = i;
        }
        else vis[a[i]] = i;
    }
    a1 = a[wa1];
    for(int i=1; i<=n; i++)
    if( !vis[i] ){ a2 = i; break;}
    memset(vis, 0, sizeof(vis));
    for(int i=1; i<=n; i++){
        scanf("%d", &b[i]);
        if(vis[b[i]] && wb1) flag = 1;
        if(vis[b[i]]){
            wb1 = vis[b[i]]; 
            wb2 = i;
        }
        else vis[b[i]] = i;
    }
    b1 = b[wb1];
    for(int i=1; i<=n; i++)
    if( !vis[i] ){ b2 = i; break;}
    if(wa1==0 || wb1==0 || flag){
        printf("Impossible\n");
        return 0;
    }
    memset(vis, 0, sizeof(vis));
    for(int i=1; i<=n; i++){
        if(i==wa1 || i==wa2) continue;
        c[i] = a[i];
        vis[a[i]] = 1;
    }
    for(int i=1; i<=n; i++){
        if(i==wb1 || i==wb2) continue;
        if( !c[i] ){
            if( vis[b[i]] ){
                printf("Impossible\n");
                return 0;
            }
            else {
                c[i] = b[i];
                vis[b[i]] = 1;
            }
        }
        else if(c[i] != b[i]){
            printf("Impossible\n");
            return 0;
        }
    }
    if(wa1!=wb1 && wa1!=wb2 && wa2!=wb1 && wa2!=wb2){
        print();
        return 0;
    }
    if(wa1!=wb1 && wa1!=wb2){
        if(c[wa1] == a1) c[wa2] = a2;
        else c[wa2] = a1;
        print();
        return 0;
    }
    if(wa2 != wb1 && wa2 != wb2){
        if(c[wa2] == a1) c[wa1] = a2;
        else c[wa1] = a1;
        print();
        return 0;
    }
    c[wa1] = min(a1, a2);
    c[wa2] = max(a1, a2);
    print();
    return 0;
}