Submission #2558370

---

Source Code Expand

#include <bits/stdc++.h>
#define rf(x) (x)=0;while(*p<48)p++;while(47<*p)(x)=((x)<<3)+((x)<<1)+(*p++&15);
//#define rf(x) (x)=0;while(*p<48)im=*p=='-';while(47<*p)(x)=((x)<<3)+((x)<<1)+(*p++&15);if(im)(x)=-(x);
#define pb push_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define befv(V) ((V)[(sz(V)-2)])
#define sorv(V) sort(allv(V))
#define revv(V) reverse(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define clv(V) (V).clear()
#define upmin(a,b) (a)=min((a),(b))
#define upmax(a,b) (a)=max((a),(b))
#define rb(x) ((x)&(-(x)))
#define cb(x) (x)=(!(x))
#define INF (0x3f3f3f3f)
#define INFLL (0x3f3f3f3f3f3f3f3fll)
#define INFST (0x7f7f7f7f)
#define INFLLST (0x7f7f7f7f7f7f7f7fll)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ld, ld> pdd;
typedef complex<ld> base;
const ld EPS = (ld)1e-7;
const ld PI = acos(0) * 2;
bool isZero(const ld& x) { return abs(x) <= EPS; }
int sign(const ld& x) { return isZero(x) ? 0 : (0 < x ? 1 : -1); }
ll gcd(ll a, ll b) { for(;b;a%=b,swap(a,b)){} return abs(a); }
pll operator + (const pll& a, const pll& b) { return pll(a.first+b.first, a.second+b.second); }
pll operator - (const pll& a, const pll& b) { return pll(a.first-b.first, a.second-b.second); }
pll operator * (const pll& a, const ll& b) { return pll(a.first*b, a.second*b); }
ll operator * (const pll& a, const pll& b) { return a.first*b.second - b.first*a.second; }
ll ccw(const pll& a, const pll& b, const pll& c) { return a*b + b*c + c*a; }
void fg(vector<int> G[], int a, int b) { G[a].pb(b); G[b].pb(a); }
void fg(vector<pii> G[], int a, int b, int c) { G[a].pb({b, c}); G[b].pb({a, c}); }

const int MAXM = 105;

int A[MAXM];

int N, M;

int main() {
	cin >> N >> M;
	for(int i = 0; i < M; i++) cin >> A[i];
	if(1 == M) {
		cout << N << endl;
		if(1 == N) {
			cout << "1\n1" << endl;
		} else {
			cout << "2\n" << N-1 << " 1" << endl;
		}
	} else if(2 == M) {
		for(int i = 0; i < M; i++) cout << A[i] << " ";
		cout << endl;
		if(1 == A[0] || 1 == A[1]) {
			cout << "1\n" << N << endl;
		} else {
			cout << "2\n" << A[0]-1 << " " << A[1]+1 << endl;
		}
	} else {
		int c = 0;
		for(int i = 0; i < M; i++) c += (A[i]&1);
		if(1 < c) {
			puts("Impossible");
		} else {
			for(int i = 1; i < M; i++) if(A[i]&1) swap(A[0], A[i]);
			for(int i = 0; i < M; i++) cout << A[i] << " ";
			cout << endl;

			vector<int> V;
			V.pb(A[0]-1);
			for(int i = 1; i+1 < M; i++) V.pb(A[i]);
			V.pb(A[M-1]+1);

			{
				vector<int> Q;
				for(int v : V) if(v) Q.pb(v);
				swap(V, Q);
			}

			cout << sz(V) << endl;
			for(int v : V) cout << v << " ";
			cout << endl;
		}
	}
	return 0;
}

Submission Info

Judge Result