141562025-01-10 07:45:33KissCsongor777Kombináció (50)cpp17Wrong answer 46/501ms500 KiB
#include <iostream>
#include <vector>
using namespace std;

int main()
{
    int n,m,x;
    cin>>n>>m;
    vector<int> ules(m+1,0), ulesn(m+1,0);
    ulesn.push_back(2147483647);
    ules[0]=0;
    for(int i=1; i<=m; i++)
    {
        cin>>ules[i];
        ulesn[i]=ules[i];
    }
    x=m;
    bool t=false;
    while(x>=1 && !t)
    {
        if(ules[x]>ules[x-1]+1)
        {
            ules[x]--;
            t=true;
        }
        else x--;
    }
    if(t)for(int i=1; i<=m; i++)cout<<ules[i]<<" ";
    else for(int i=n-m+1; i<=n; i++)cout<<i<<" ";
    cout<<endl;
    x=m;
    t=false;
    while(x>=1 && !t)
    {
        if(ulesn[x]<n && ulesn[x]+1<ulesn[x+1])
        {
                ulesn[x]++;
                t=true;
        }
        else x--;
    }
    if(t)for(int i=1; i<=m; i++)cout<<ulesn[i]<<" ";
    else for(int i=1; i<=m; i++)cout<<i<<" ";
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base46/50
1Accepted0/01ms500 KiB
2Wrong answer0/01ms316 KiB
3Accepted2/21ms500 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms328 KiB
6Accepted2/21ms316 KiB
7Partially correct1/21ms316 KiB
8Accepted2/21ms500 KiB
9Accepted2/21ms500 KiB
10Accepted4/41ms316 KiB
11Accepted4/41ms316 KiB
12Accepted4/41ms368 KiB
13Accepted4/41ms316 KiB
14Accepted4/41ms316 KiB
15Accepted4/41ms316 KiB
16Accepted6/61ms316 KiB
17Partially correct3/61ms316 KiB