157012025-02-21 21:30:31ansKombináció (50)cpp17Wrong answer 35/501ms508 KiB
#include <bits/stdc++.h>
#include <vector>
using namespace std;

int main(){
    int n, d;
    cin>>n>>d;
    vector<int>c(d+1);
    vector<int>eleje(d);
    vector<int>vege;
    for(int i=1; i<=d; i++) eleje[i-1]=i;
    for(int i=n; i>=(n-d+1); i--) vege.push_back(i);
    for(int i=1; i<=d; i++){
        cin>>c[i];
    }
    int h=d-1;
    int akt=d;
   while(c[akt]-1<=c[h] && akt!=1){
        akt--;
        h--;
    }
    if(akt==1) for(int x : vege) cout<<x<<" ";
    else{
        for(int i=1; i<=d; i++){
            if(i==akt) cout<<c[i]-1<<" ";
            else cout<<c[i]<<" ";
        }
    }
    cout<<endl;
    int akt2=-1;
    for(int i=1; i<d; i++) if(c[i]+1<c[i+1]) akt2=i;
    if(c[d]+1<=n) akt2=d;
    if(akt2!=-1){
        for(int i=1; i<=d; i++){
            if(i==akt2) cout<<c[i]+1<<" ";
            else cout<<c[i]<<" ";
        }
    }
    else{
        for(int x : eleje) cout<<x<<" ";
    }
}
SubtaskSumTestVerdictTimeMemory
base35/50
1Accepted0/01ms316 KiB
2Wrong answer0/01ms508 KiB
3Accepted2/21ms316 KiB
4Partially correct1/21ms316 KiB
5Partially correct1/21ms316 KiB
6Partially correct1/21ms316 KiB
7Partially correct1/21ms316 KiB
8Partially correct1/21ms396 KiB
9Partially correct1/21ms316 KiB
10Partially correct2/41ms316 KiB
11Accepted4/41ms316 KiB
12Accepted4/41ms388 KiB
13Partially correct2/41ms316 KiB
14Partially correct2/41ms316 KiB
15Accepted4/41ms316 KiB
16Accepted6/61ms316 KiB
17Partially correct3/61ms316 KiB