Submission #1863644

---

Source Code Expand

#include"bits/stdc++.h"


#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define iout(x) printf("%d\n",x)
#define lout(x) printf("%lld\n",x)
#define REP(x,l,u) for(int x = (l);x<=(u);x++)
#define RREP(x,l,u) for(int x = (l);x>=(u);x--)
#define mst(x,a) memset(x,a,sizeof(x))
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define MP make_pair
#define se second
#define fi first
#define dbg(x) cout<<#x<<" = "<<(x)<<endl;
#define sz(x) ((int)x.size())
#define cl(x) x.clear()

typedef  long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
using namespace std;

const int maxn = 100010;
const int mod = 1e9+7;
const int MAX = 1000000010;
const double eps = 1e-6;
const double PI = acos(-1);

template<typename T> inline void read(T &x){
x=0;T f=1;char ch;do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');do x=x*10+ch-'0',ch=getchar();while(ch<='9'&&ch>='0');x*=f;
}

template<typename A,typename B> inline void read(A&x,B&y){read(x);read(y);}
template<typename A,typename B,typename C> inline void read(A&x,B&y,C&z){read(x);read(y);read(z);}
template<typename A,typename B,typename C,typename D> inline void read(A&x,B&y,C&z,D&w){read(x);read(y);read(z);read(w);}
template<typename A,typename B> inline A fexp(A x,B p){A ans=1;for(;p;p>>=1,x=1LL*x*x%mod)if(p&1)ans=1LL*ans*x%mod;return ans;}
template<typename A,typename B> inline A fexp(A x,B p,A mo){A ans=1;for(;p;p>>=1,x=1LL*x*x%mo)if(p&1)ans=1LL*ans*x%mo;return ans;}

int n,m;

int A[maxn],has[maxn],cnt;

void Work(){
	if(cnt>2)return void(puts("Impossible"));
	if(m==1){
		if(n>1)printf("%d\n2\n%d %d\n",n,1,n-1);
		else printf("%d\n1\n%d\n",n,n);
		return;
	}
	if(cnt)swap(A[1],A[has[1]]);if(cnt>1)swap(A[m],A[has[2]]);
	REP(i,1,m)printf("%d ",A[i]);puts("");
	if(A[m]>1)printf("%d\n",m);else printf("%d\n",m-1);
	printf("%d ",A[1]+1);
	REP(i,2,m-1)printf("%d ",A[i]);
	if(A[m]>1)printf("%d ",A[m]-1);
}

void Init(){
	read(n,m);
	REP(i,1,m)read(A[i]);
	REP(i,1,m)if(A[i]&1)has[++cnt]=i;
}

int main(){
	Init();
	Work();
	return 0;
}

Submission Info

Judge Result