제출 #311221

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
311221		jainbot27	캥거루 (CEOI16_kangaroo)	C++17	6 / 100	2075 ms	384 KiB

kangaroo

#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()

#define FOR(x, y, z) for(int x = (y); x < (z); x++)
#define ROF(x, z, y) for(int x = (y-1); x >= (z); x--)
#define F0R(x, z) FOR(x, 0, z)
#define R0F(x, z) ROF(x, 0, z)
#define trav(x, y) for(auto&x:y)

using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;

template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const char nl = '\n';
const int mxN = 2e5 + 10;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;

int n, cs, cf; 

int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> cs >> cf;
    vi a(n); iota(all(a), 1);
    vector<vi> ans;
    do{
        if(a[0] != cs || a[n-1] != cf) continue;
        bool g = 1;
        FOR(i, 1, n-1){
            if((a[i] > a[i-1] && a[i] > a[i+1]) || (a[i] < a[i-1] && a[i] < a[i+1]))
                continue;
            g = 0;
        }
        if(g) ans.pb(a);
    } while(next_permutation(all(a)));
    cout << ans.size() << nl;
    return 0;
}

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