147982025-02-02 19:41:55szjKombináció (50)cpp17Partially correct 41/501ms332 KiB
#include <iostream>

using namespace std;

int main()
{
    int n, m, i;
    cin >> n >> m;
    int kov[m+1], el[m];
    for(i=0; i<m;i++)
    {
        cin >> kov[i];
        el[i] = kov[i];
    }
    kov[m] = n+1;
    for(i=m-1; i>-2; i--)if(kov[i]+1 < kov[i+1])break;
    if(i!=-2)
    {
        kov[i]++;
        for(i=i+1; i<m; i++)kov[i] = kov[i-1]+1;
    }

    for(i=m-1; i>-1; i--)if(el[i]-1 > el[i-1])break;
    if(i!=-1)
    {
        el[i]--;
        for(i=i+1; i<m; i++)el[i] = n-m+i+1;
    }
    else for(i=0; i<m; i++)el[i] = n-(i-1);
    for(i=0; i<m; i++)cout << el[i] << " ";
    cout << endl;
    for(i=0; i<m; i++)cout << kov[i] << ' ';
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base41/50
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Partially correct1/21ms316 KiB
4Accepted2/21ms316 KiB
5Partially correct1/21ms316 KiB
6Partially correct1/21ms316 KiB
7Accepted2/21ms316 KiB
8Partially correct1/21ms316 KiB
9Partially correct1/21ms316 KiB
10Partially correct2/41ms332 KiB
11Accepted4/41ms316 KiB
12Accepted4/41ms316 KiB
13Accepted4/41ms316 KiB
14Partially correct2/41ms316 KiB
15Accepted4/41ms316 KiB
16Accepted6/61ms316 KiB
17Accepted6/61ms316 KiB