Submission #2560399


Source Code Expand

#include<cstdio>
int N,M,A[110],a[110],b[110],n;
void ins(int x){if(x)b[n++]=x;}
int main(){
	scanf("%d%d",&N,&M);
	int os[2],oc=0;
	for(int i=0;i<M;i++){
		scanf("%d",A+i);
		if(A[i]%2){
			if(oc>1)return puts("Impossible"),0;
			os[oc++]=A[i];
		}
	}
	if(oc<2){
		a[0]=os[0];
		for(int i=0;i<M;i++)if(A[i]%2==0)a[oc++]=A[i];
		for(int i=0;i<M;i++)ins(a[i]-!i);
		ins(1);
	}
	else{
		a[0]=os[0];a[M-1]=os[--oc];
		for(int i=0;i<M;i++)if(A[i]%2==0)a[oc++]=A[i];
		for(int i=0;i<M;i++)ins(a[i]-!i+(i==M-1));
	}
	for(int i=0;i<M;i++)printf("%d%c",a[i]," \n"[i==M-1]);
	printf("%d\n",n);
	for(int i=0;i<n;i++)printf("%d%c",b[i]," \n"[i==n-1]);
}

Submission Info

Submission Time
Task D - Arrays and Palindrome
User mn3twe
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 669 Byte
Status AC
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:5:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&N,&M);
                     ^
./Main.cpp:8:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",A+i);
                  ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 3
AC × 31
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 128 KB
01-02.txt AC 1 ms 128 KB
01-03.txt AC 1 ms 128 KB
01-04.txt AC 0 ms 128 KB
01-05.txt AC 1 ms 128 KB
01-06.txt AC 1 ms 128 KB
01-07.txt AC 1 ms 128 KB
01-08.txt AC 0 ms 128 KB
01-09.txt AC 1 ms 128 KB
01-10.txt AC 1 ms 128 KB
01-11.txt AC 1 ms 128 KB
01-12.txt AC 1 ms 128 KB
01-13.txt AC 1 ms 128 KB
01-14.txt AC 1 ms 128 KB
01-15.txt AC 1 ms 128 KB
01-16.txt AC 1 ms 128 KB
01-17.txt AC 1 ms 128 KB
01-18.txt AC 1 ms 128 KB
01-19.txt AC 1 ms 128 KB
01-20.txt AC 1 ms 128 KB
01-21.txt AC 1 ms 128 KB
01-22.txt AC 1 ms 128 KB
01-23.txt AC 1 ms 128 KB
01-24.txt AC 1 ms 128 KB
01-25.txt AC 1 ms 128 KB
sample-01.txt AC 1 ms 128 KB
sample-02.txt AC 1 ms 128 KB
sample-03.txt AC 1 ms 128 KB