Submission #605124

#	Time	Username	Problem	Language	Result	Execution time	Memory
605124		UncoolAnon	Kangaroo (CEOI16_kangaroo)	C++14	0 / 100	1 ms	256 KiB

kangaroo

#include <bits/stdc++.h> 


#define pii pair<int,int> 
#define F first 
#define S second 
#define mp make_pair 

using namespace std; 

int main(){
	int n,s,f; 
	cin>>n>>s>>f; 
	vector<int> a; 
	for(int i=1;i<=n;i++) a.push_back(i); 
	int answer=0; 
	do{
		if(a[0]==s&&a.back()==f){
			bool yes=1;
			for(int i=1;i+1<n;i++)
				if((a[i]>a[i-1]&&a[i]>a[i+1])||(a[i]<a[i-1]&&a[i]<a[i+1]))
					yes=1; 
			answer+=yes; 
		}
	}while(next_permutation(a.begin(),a.end())); 
	cout<<answer; 
	return 0;
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 30
• Subtask 3: 0 / 15
• Subtask 4: 0 / 49