3994 | 2023. 03. 07 19:16:35 | horvathabel | Kombináció (50) | cpp17 | Wrong answer 34/50 | 3ms | 3688 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin>>n>>m;
vector<int> v;
for (int i=0; i<m;i++){
int x;
cin>>x;
v.push_back(x);
}
vector<int> z=v;
bool van=false;
for (int i=m-1;i>0;i--){
if (v[i]-1!=v[i-1]){
z[i]=z[i]-1;
int cnt=n;
for (int j=m-1; j>i;j--){
z[j]=cnt;
cnt--;
}
for (int h:z) cout<<h<<" ";
van=true;
break;
}
}
if (!van){
z[0]=z[0]-1;
for (int h:z) cout<<h<<" ";
}
cout<<endl;
bool van2=false;
if (v[m-1]!=n){
v[m-1]++;
for (int h:v) cout<<h<<" "; ;
}
else {
for (int i=m-2; i>=0;i--){
if (v[i]+1!=v[i+1]){
v[i]++;
for (int h:v) cout<<h<<" ";
van2=true;
break;
}
}
}
}
Subtask | Sum | Test | Verdict | Time | Memory | ||
---|---|---|---|---|---|---|---|
base | 34/50 | ||||||
1 | Accepted | 0/0 | 3ms | 1808 KiB | |||
2 | Accepted | 0/0 | 3ms | 2004 KiB | |||
3 | Wrong answer | 0/2 | 2ms | 2084 KiB | |||
4 | Accepted | 2/2 | 3ms | 2216 KiB | |||
5 | Partially correct | 1/2 | 2ms | 2300 KiB | |||
6 | Wrong answer | 0/2 | 2ms | 2296 KiB | |||
7 | Accepted | 2/2 | 3ms | 2428 KiB | |||
8 | Wrong answer | 0/2 | 2ms | 2512 KiB | |||
9 | Partially correct | 1/2 | 3ms | 2768 KiB | |||
10 | Wrong answer | 0/4 | 2ms | 2976 KiB | |||
11 | Accepted | 4/4 | 3ms | 3224 KiB | |||
12 | Accepted | 4/4 | 2ms | 3308 KiB | |||
13 | Accepted | 4/4 | 3ms | 3512 KiB | |||
14 | Wrong answer | 0/4 | 3ms | 3492 KiB | |||
15 | Accepted | 4/4 | 2ms | 3600 KiB | |||
16 | Accepted | 6/6 | 2ms | 3572 KiB | |||
17 | Accepted | 6/6 | 2ms | 3688 KiB |