147812025-02-02 12:27:27szjKombináció (50)cpp17Wrong answer 37/501ms512 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>=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-1; 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
base37/50
1Accepted0/01ms316 KiB
2Accepted0/01ms320 KiB
3Wrong answer0/21ms508 KiB
4Accepted2/21ms316 KiB
5Partially correct1/21ms316 KiB
6Partially correct1/21ms316 KiB
7Accepted2/21ms508 KiB
8Wrong answer0/21ms316 KiB
9Partially correct1/21ms316 KiB
10Wrong answer0/41ms316 KiB
11Accepted4/41ms316 KiB
12Accepted4/41ms316 KiB
13Accepted4/41ms316 KiB
14Partially correct2/41ms500 KiB
15Accepted4/41ms512 KiB
16Accepted6/61ms316 KiB
17Accepted6/61ms324 KiB