# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
604754 | Hazem | Kangaroo (CEOI16_kangaroo) | C++14 | 2085 ms | 212 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define LL long long
using namespace std;
const int N = 2e5+10;
int a[N];
int main()
{
int n,s,f;
scanf("%d%d%d",&n,&s,&f);
for(int i=1;i<=n;i++)
a[i] = i;
int ans = 0;
do{
bool q = 1;
q &= a[1]==s;
q &= a[n]==f;
for(int i=3;i<=n;i++)
q &= (a[i]>a[i-1])^(a[i-1]>a[i-2]);
ans += q;
}while(next_permutation(a+1,a+n+1));
printf("%d\n",ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |