Submission #810571

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>

using namespace std;

int main()
{
  int N, M;
  cin >> N >> M;
  int* A = new int[M];
  int cnt = 0;
  for(int i = 0; i < M; ++i)
  {
    cin >> A[i];
    if(A[i]%2==1) ++cnt;
  }

  if(cnt==0)
  {
    // sequence a
    for(int i = 0; i < M; ++i)
      cout << A[i] << " ";
    cout << "\n";

    if(M==1)
    {
      // length of sequence b
      cout << "2\n"
      // sequence b
           << "1 " << A[0]-1 << endl;
    }
    else
    {
      // length of sequence b
      cout << M << "\n";

      // sequence b
      cout << A[0]+1 << " ";
      for(int i = 1; i < M-1; ++i)
        cout << A[i] << " ";
      cout << A[M-1]-1 << endl;
    }
  }
  else if(cnt==1)
  {
    // sequence a
    int odd;
    for(int i = 0; i < M; ++i)
    {
      if(A[i]%2==0) cout << A[i] << " ";
      else odd = A[i];
    }
    cout << odd << "\n";

    if(N==odd)
    {
      if(odd==1) cout << "1\n" << "1" << endl;
      else
      {
        // length of sequence b
        cout << "2\n";

        // sequence b
        cout << "1 " << N-1 << endl;
      }
    }
    else
    {
      // length of sequence b
      cout << M << "\n";

      // sequence b
      cout << A[0]-1 << " ";
      for(int i = 1; i < M; ++i)
        if(A[i]%2==0) cout << A[i] << " ";
      cout << odd+1 << "\n";
    }
  }
  else if(cnt==2)
  {
    int odd1, odd2;
    bool flag = true;
    for(int i = 0; i < M; ++i)
    {
      if(A[i]%2!=0)
      {
        if(flag)
        {
          odd1 = A[i];
          flag = false;
        }
        else odd2 = A[i];
      }
    }

    if(odd1+odd2==N)
    {
      if(odd1==odd2 && odd1!=1)
      {
        cout << odd1 << " " << odd2 << "\n"
             << "2\n"
             << odd1-1 << " " << odd2+1 << endl;
      }
      else
      {
        cout << odd1 << " " << odd2 << "\n"
             << "1\n"
             << N << endl;
      }
    }
    else
    {
      // sequence a
      cout << odd1 << " ";
      for(int i = 0; i < M; ++i)
        if(A[i]%2==0) cout << A[i] << " ";
      cout << odd2 << "\n";

      if(odd2==1)
      {
        // length of sequence b
        cout << M-1 << "\n";

        // sequence b
        cout << odd1+1 << " ";
        for(int i = 0; i < M; ++i)
          if(A[i]%2==0) cout << A[i] << " ";
        cout << endl;
      }
      else
      {
        // length of sequence b
        cout << M << "\n";

        // sequence b
        cout << odd1+1 << " ";
        for(int i = 0; i < M; ++i)
          if(A[i]%2==0) cout << A[i] << " ";
        cout << odd2-1 << endl;
      }
    }
  }
  else  // cnt>2
  {
    cout << "Impossible" << endl;
  }

  delete[] A;
  
  return 0;
}

Submission Info

Judge Result