Submission #604738

#	Time	Username	Problem	Language	Result	Execution time	Memory
604738		ACGN	Kangaroo (CEOI16_kangaroo)	C++17	6 / 100	2069 ms	212 KiB

kangaroo

#pragma GCC optimize("O3")
#include<algorithm>
#include<iostream>
using namespace std;
int main() {
    //freopen("kangaroo.in","r",stdin);
    //freopen("kangaroo.out","w",stdout);
    int n,cs,cf;
    cin>>n>>cs>>cf;
    int R[n];for (int i=0;i<n;i++) R[i]=i+1;
    int M=0;
    do {
        if ((R[0]==cs)&&(R[n-1]==cf)) {
            int sm = 1;
            for (int i=0;i<n-2;i++) {
                if ((R[i]-R[i+1])*(R[i+1]-R[i+2])>0) sm=0;
            }
            M+=sm;
        }
    } while (next_permutation(R,R+n));
    cout<<M<<endl;
}

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