141602025-01-10 07:52:51KissCsongor777Kombináció (50)cpp17Wrong answer 25/501ms508 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;*/
    for(int i=1; i<=m; i++)cout<<6979543<<" ";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
base25/50
1Wrong answer0/01ms316 KiB
2Wrong answer0/01ms316 KiB
3Partially correct1/21ms316 KiB
4Partially correct1/21ms316 KiB
5Partially correct1/21ms316 KiB
6Partially correct1/21ms316 KiB
7Partially correct1/21ms376 KiB
8Partially correct1/21ms316 KiB
9Partially correct1/21ms316 KiB
10Partially correct2/41ms316 KiB
11Partially correct2/41ms316 KiB
12Partially correct2/41ms316 KiB
13Partially correct2/41ms316 KiB
14Partially correct2/41ms508 KiB
15Partially correct2/41ms316 KiB
16Partially correct3/61ms316 KiB
17Partially correct3/61ms316 KiB