Submission #1216784

#	Time	Username	Problem	Language	Result	Execution time	Memory
1216784		ggeerrggoo	Kangaroo (CEOI16_kangaroo)	C++20	6 / 100	2096 ms	324 KiB

kangaroo

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


int main()
{
        int n, cs, cf; cin >> n >> cs >> cf;
        int ans=0;

        vector<int> a(n+1);
        for(int i=1;i<=n;i++) a[i] = i;

        do
        {
            if(a[1]!=cs || a[n]!=cf) continue;
            bool dir = (a[1] < a[2]);
            bool gud=1;
            for(int i=2;i<n;i++)
            {
                if( (a[i] < a[i+1]) == dir)
                {
                    gud=0;break;
                }
                dir=!dir;
            }
            ans += gud;
            
        } while (next_permutation(a.begin()+1, a.end()));
        cout << ans;
}

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