Submission #3430647
Source Code Expand
#include<bits/stdc++.h> const int MN=100000+5; using namespace std; typedef long long ll; template<typename T>T&IN(T&in){ in=0;char c=getchar();int f=1; while(!isdigit(c)){if(c=='-')f=-1;c=getchar();} while(isdigit(c))in=in*10+c-'0',c=getchar(); in*=f;return in; } int n,m; int a[MN],b[MN],c[MN]; void input(){ IN(n),IN(m); for(int i=1;i<=m;++i){ IN(a[i]); if(a[i]%2)b[++b[0]]=a[i]; } if(m==1&&a[1]!=1)return printf("%d\n%d\n%d %d",a[1],2,a[1]-1,1),void(); if(b[0]>2)return puts("Impossible"),void(); if(b[0])printf("%d ",b[b[0]]),c[++c[0]]=b[b[0]]+1; else c[++c[0]]=1; for(int i=1;i<=m;++i)if(a[i]%2==0)printf("%d ",a[i]),c[++c[0]]=a[i]; if(b[0]==2)printf("%d\n",b[1]),c[++c[0]]=b[1]-1; else c[c[0]]--,puts(""); while(!c[c[0]]&&c[0]>1)c[0]--; int s=0; for(int i=1;i<=c[0];++i)s+=c[i]; if(s!=n)c[++c[0]]=1; printf("%d\n",c[0]); for(int i=1;i<=c[0];++i)printf("%d ",c[i]); } int main(){ input(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Arrays and Palindrome |
User | tense |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 967 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1000 / 1000 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample-01.txt, sample-02.txt, sample-03.txt |
All | sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, sample-01.txt, sample-02.txt, sample-03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 1 ms | 256 KB |
01-02.txt | AC | 1 ms | 256 KB |
01-03.txt | AC | 1 ms | 256 KB |
01-04.txt | AC | 1 ms | 256 KB |
01-05.txt | AC | 1 ms | 256 KB |
01-06.txt | AC | 1 ms | 256 KB |
01-07.txt | AC | 1 ms | 256 KB |
01-08.txt | AC | 1 ms | 256 KB |
01-09.txt | AC | 1 ms | 256 KB |
01-10.txt | AC | 1 ms | 256 KB |
01-11.txt | AC | 1 ms | 256 KB |
01-12.txt | AC | 1 ms | 256 KB |
01-13.txt | AC | 2 ms | 256 KB |
01-14.txt | AC | 1 ms | 256 KB |
01-15.txt | AC | 1 ms | 256 KB |
01-16.txt | AC | 1 ms | 256 KB |
01-17.txt | AC | 1 ms | 256 KB |
01-18.txt | AC | 1 ms | 256 KB |
01-19.txt | AC | 1 ms | 256 KB |
01-20.txt | AC | 1 ms | 256 KB |
01-21.txt | AC | 1 ms | 256 KB |
01-22.txt | AC | 1 ms | 256 KB |
01-23.txt | AC | 1 ms | 256 KB |
01-24.txt | AC | 1 ms | 256 KB |
01-25.txt | AC | 1 ms | 256 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |
sample-03.txt | AC | 1 ms | 256 KB |