250852026-02-17 20:41:21KristófKombináció (50)cpp17Accepted 50/501ms500 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int m,n;
    cin>>n>>m;
    vector<int> a(m+2);
    for(int i=1;i<=m;i++)
        {
        cin>>a[i];
        }
    a[0]=0;
    a[m+1]=n+1;
    int i=m;
    while(i>0 && a[i-1]+1==a[i])i--;
    for(int j=1;j<i;j++)cout<<a[j]<<" ";
    if(i!=0)cout<<a[i]-1<<" ";
    for(int j=i+1;j<=m;j++)cout<<n-m+j<<" ";
    cout<<"\n";
    i=m;
    while(i>0 && a[i+1]-1==a[i])i--;
    for(int j=1;j<i;j++)cout<<a[j]<<" ";
    int k=a[i]+1;
    if(i==0)i++;
    for(int j=i;j<=m;j++){cout<<k<<" ";k++;}
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/01ms500 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted4/41ms324 KiB
11Accepted4/41ms316 KiB
12Accepted4/41ms500 KiB
13Accepted4/41ms356 KiB
14Accepted4/41ms400 KiB
15Accepted4/41ms316 KiB
16Accepted6/61ms332 KiB
17Accepted6/61ms316 KiB