Submission #810358
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
vector<int> ev,od,ans;
int main() {
int m,n;
scanf("%d %d",&n,&m);
for (int i=0;i<m;i++) {
int x;
scanf("%d",&x);
if (x%2) od.push_back(x);
else ev.push_back(x);
}
if (od.size() > 2) {
printf("Impossible\n");
return 0;
}
if (m == 1 && n == 1) {
printf("1\n1\n1\n");
return 0;
}
if (m == 1) {
printf("%d\n",n);
printf("2\n1 %d",n-1);
return 0;
}
if (od.size() > 0) ans.push_back(od[0]);
for (int i=0;i<ev.size();i++) ans.push_back(ev[i]);
if (od.size() == 2) ans.push_back(od[1]);
for (int i=0;i<m;i++) {
if (i > 0) printf(" ");
printf("%d",ans[i]);
}
printf("\n");
printf("%d\n",ans[0] > 1 ? m : m-1);
if (ans[0] > 1) {
printf("%d ",ans[0]-1);
for (int i=1;i<m-1;i++) printf("%d ",ans[i]);
printf("%d\n",ans[m-1]+1);
}
else {
for (int i=1;i<m-1;i++) printf("%d ",ans[i]);
printf("%d\n",ans[m-1]+1);
}
return 0;
}
Submission Info
Submission Time
2016-07-17 02:02:41+0900
Task
D - Arrays and Palindrome
User
tcchung
Language
C++14 (GCC 5.4.1)
Score
1000
Code Size
983 Byte
Status
AC
Exec Time
4 ms
Memory
256 KiB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:6:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&n,&m);
^
./Main.cpp:9:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&x);
^
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
Case Name
Status
Exec Time
Memory
01-01.txt
AC
4 ms
256 KiB
01-02.txt
AC
4 ms
256 KiB
01-03.txt
AC
4 ms
256 KiB
01-04.txt
AC
4 ms
256 KiB
01-05.txt
AC
4 ms
256 KiB
01-06.txt
AC
4 ms
256 KiB
01-07.txt
AC
4 ms
256 KiB
01-08.txt
AC
4 ms
256 KiB
01-09.txt
AC
4 ms
256 KiB
01-10.txt
AC
4 ms
256 KiB
01-11.txt
AC
4 ms
256 KiB
01-12.txt
AC
4 ms
256 KiB
01-13.txt
AC
4 ms
256 KiB
01-14.txt
AC
4 ms
256 KiB
01-15.txt
AC
4 ms
256 KiB
01-16.txt
AC
4 ms
256 KiB
01-17.txt
AC
4 ms
256 KiB
01-18.txt
AC
4 ms
256 KiB
01-19.txt
AC
4 ms
256 KiB
01-20.txt
AC
4 ms
256 KiB
01-21.txt
AC
4 ms
256 KiB
01-22.txt
AC
4 ms
256 KiB
01-23.txt
AC
4 ms
256 KiB
01-24.txt
AC
4 ms
256 KiB
01-25.txt
AC
4 ms
256 KiB
sample-01.txt
AC
4 ms
256 KiB
sample-02.txt
AC
4 ms
256 KiB
sample-03.txt
AC
4 ms
256 KiB