# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
899137 | penguin133 | Kangaroo (CEOI16_kangaroo) | C++17 | 2076 ms | 348 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>
using namespace std;
#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int ans = 0, P[10];
void solve(){
int n, x, y; cin >> n >> x>> y;
for(int i=1;i<=n;i++)P[i] = i;
do{
bool f = 1;
if(P[1] != x || P[n] != y)f = 0;
if(!f)continue;
int st = -1;
for(int i=2;i<=n;i++){
int sg = (P[i] > P[i-1]);
if(st == -1)st = sg;
else if(st == sg)f = 0;
st = sg;
}
if(f)ans++;
}while(next_permutation(P + 1, P + n + 1));
cout << ans;
}
main(){
ios::sync_with_stdio(0);cin.tie(0);
int tc = 1;
//cin >> tc;
for(int tc1=1;tc1<=tc;tc1++){
// cout << "Case #" << tc1 << ": ";
solve();
}
}
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... |