Käännöt

input/code.cpp: In function 'int main()':
input/code.cpp:200:29: error: invalid conversion from 'int' to 'time_t*' {aka 'long int*'} [-fpermissive]
  200 |         srand(unsigned(time(1)));
      |                             ^
      |                             |
      |                             int
In file included from /usr/include/c++/11/ctime:42,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:49,
                 from input/code.cpp:1:
/usr/include/time.h:76:29: note:   initializing argument 1 of 'time_t time(time_t*)'
   76 | extern time_t time (time_t *__timer) __THROW;
      |                     ~~~~~~~~^~~~~~~

#include<bits/stdc++.h>
using namespace std;
 
int a[509];
int b[509];
int n,m,k,inv;
int ansList[1000009];
 
bool inOrder(){
	for(int i=1;i<=n;i++){
		if(a[i]!=i)return false;
	}
	return true;
}
 
//----------------k=2----------------//
void solve2(){
	cout<<"YES"<<endl;
	int pos;
	for(int i=1;i<=n;i++)if(a[i]!=i){
		for(int j=i+1;j<=n;j++){
			if(a[j]==i)pos=j;
		}
		for(int j=pos-1;j>=i;j--){
			m++;
			ansList[m]=j;
			swap(a[j],a[j+1]);
		}
	}
	cout<<m<<endl;
	for(int i=1;i<=m;i++){
		cout<<ansList[i]<<" ";
	}
}
//----------------k=3----------------//
void solve3(){
	for(int i=1;i<=n;i+=2){
		if(a[i]%2==0){
			cout<<"NO"<<endl;
			return;
		}
	}
	for(int i=2;i<=n;i+=2){
		if(a[i]%2==1){
			cout<<"NO"<<endl;
			return;
		}
	}
	cout<<"YES"<<endl;
	int pos;
	for(int i=1;i<=n;i+=2)if(a[i]!=i){
		for(int j=i+2;j<=n;j++){
			if(a[j]==i)pos=j;
		}
		for(int j=pos-2;j>=i;j-=2){
			m++;
			ansList[m]=j;
			swap(a[j],a[j+2]);
		}
	}
	for(int i=2;i<=n;i+=2)if(a[i]!=i){
		for(int j=i+2;j<=n;j++){
			if(a[j]==i)pos=j;
		}
		for(int j=pos-2;j>=i;j-=2){
			m++;
			ansList[m]=j;
			swap(a[j],a[j+2]);
		}
	}
	cout<<m<<endl;
	for(int i=1;i<=m;i++){
		cout<<ansList[i]<<" ";
	}
}
//----------------k=4----------------//
void reverse4(int p){
	swap(b[a[p]],b[a[p+3]]);
	swap(a[p],a[p+3]);
	swap(b[a[p+1]],b[a[p+2]]);
	swap(a[p+1],a[p+2]);
}
 
void debug(){
	for(int i=1;i<=n;i++)cout<<a[i]<<" ";
	cout<<endl;
	for(int i=1;i<=n;i++)cout<<b[i]<<" ";
	cout<<endl;
	cout<<endl;
}
 
void appendAns(int pos){
	m++;
	ansList[m]=pos;
//	Sleep(1000);
//	debug();
}
bool inOrderLast5(){
	for(int i=n-4;i<n;i++){
		if(a[i+1]<a[i])return false;
	}
	return true;
}
 
void shuffle(){
	for(int i=1;i<=n-3;i++){
		int pos=i;
		reverse4(pos);
		appendAns(pos);
	}
}
 
void solve4(){
	if(inv%2==1){
		cout<<"NO"<<endl;
		return;
	}
	int cmpM;
	while(!inOrder()){
		for(int i=1;i<=n-5;i++){
			if(b[i]==i)continue;
			while(b[i]-i>=4){
				int pos=b[i]-3;
				reverse4(pos);
				appendAns(pos);
			}
			if(b[i]-i==2){
				int pos=b[i]-1;
				reverse4(pos);
				appendAns(pos);
			}
			if(b[i]-i==1){
				int pos=b[i];
				reverse4(pos);
				appendAns(pos);
				ansList[m]=pos;
				pos=b[i]-2;
				reverse4(pos);
				appendAns(pos);
			}
			if(b[i]-i==3){
				reverse4(i);
				appendAns(i);
			}
		}
		
		int l=n-4;
		
		bool complete=false;
		for(int i=1;i<=3;i++){
			cmpM=m;
			for(int i=1;i<=5;i++){
				reverse4(l);
				appendAns(l);
				if(inOrderLast5()){
					complete=true;
					break;
				}
				reverse4(l+1);
				appendAns(l+1);
				if(inOrderLast5()){
					complete=true;
					break;
				}
			}
			if(complete)break;
			m=cmpM;
			reverse4(l-1);
			appendAns(l-1);
			reverse4(l);
			appendAns(l);
			reverse4(l-1);
			appendAns(l-1);
			reverse4(l);
			appendAns(l);
			reverse4(l+1);
			appendAns(l+1);
			reverse4(l-1);
			appendAns(l-1);
		}
		if(complete)break;
		shuffle();
	}
	
		
	
//	debug();
	cout<<"YES"<<endl;
	for(int i=1;i<=m;i++){
		cout<<ansList[i]<<" ";
	}
}
//----------------k=5----------------//
void solve5(){
	;
}
//-----------------------------------//
 
int main(){
	srand(unsigned(time(1)));
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		for(int j=1;j<i;j++){
			if(a[j]>a[i]){
				inv++;
			}
		}
		b[a[i]]=i;
	}
	
	if(k==2){
		solve2();
	}
	else if(k==3){
		solve3();
	}
	else if(k==4){
		solve4();
	}
	else{
		solve5();
	}
	return 0;
}