147792025-02-02 12:09:52szjKombináció (50)cpp17Partially correct 26/501ms508 KiB
#include <iostream>

using namespace std;

int main()
{
    int n, m, i;
    cin >> n >> m;
    int kov[m], el[m];
    for(i=0; i<m;i++)
    {
        cin >> kov[i];
        el[i] = kov[i];
    }
    for(i=m-1; i>=0; i--)if(kov[i]+1 < kov[i+1])break;
    kov[i]++;
    for(i=i+1; i<m; i++)kov[i] = kov[i-1]+1;
    for(i=m; i>0; i--)if(el[i]-1 > el[i-1])break;
    el[i]--;
    for(i=i+1; i<m; i++)el[i] = n-(m-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
base26/50
1Accepted0/01ms316 KiB
2Accepted0/01ms500 KiB
3Partially correct1/21ms316 KiB
4Partially correct1/21ms316 KiB
5Partially correct1/21ms316 KiB
6Partially correct1/21ms316 KiB
7Accepted2/21ms316 KiB
8Partially correct1/21ms316 KiB
9Partially correct1/21ms316 KiB
10Partially correct2/41ms316 KiB
11Partially correct2/41ms316 KiB
12Partially correct2/41ms316 KiB
13Partially correct2/41ms500 KiB
14Partially correct2/41ms508 KiB
15Partially correct2/41ms316 KiB
16Partially correct3/61ms400 KiB
17Partially correct3/61ms316 KiB