Submission #811778

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
int n,m;
const int maxn=1e5+10;
int a[maxn],b[maxn];
int main(){
    cin>>n>>m;
    int f=0;
    for(int i=1;i<=m;i++){
        cin>>a[i];
        if(a[i]%2){
            f++;
        }
    }
    if(f>2){
        cout<<"Impossible";
        return 0;
    }
    int p=0;
    if(m==1){
        if(a[1]!=1){
            b[++p]=a[1]-1;
        }
        b[++p]=1;
    }
    else if(m==2){
        if(a[1]!=1){
            b[++p]=a[1]-1;
        }
        b[++p]=a[2]+1;
    }else{
        int k=1;
        for(int i=1;i<m;i++){
            if(a[i]%2==1){
                if(k==1){
                    swap(a[i],a[1]);
                }
                else swap(a[i],a[m]);
                k++;
            }
        }
        for(int i=1;i<=m;i++){
            if(i==1){
                if(a[i]-1!=0){
                    b[++p]=a[i]-1;
                }
            }
            else {
                b[++p]=a[i];
            }
        }
        b[p]++;
    }
    for(int i=1;i<=m;i++){
        cout<<a[i];
        if(i!=m) cout<<" ";
        else cout<<endl;
    }
    cout<<p<<endl;
    for(int i=1;i<=p;i++){
        cout<<b[i];
        if(i!=p) cout<<" ";
        else cout<<endl;
    }
    return 0;
}

Submission Info

Judge Result