oj.uz

Submission #859474

# Submission time Handle Problem Language Result Execution time Memory
859474 2023-10-10T08:08:24 Z naneosmic Kangaroo (CEOI16_kangaroo) C++14
6 / 100
 2000 ms 600 KB 
#include <bits/stdc++.h>
#define int long long
#define endl "\n"
using namespace std;
signed main(){
    int n,cs,cf;
    cin>>n>>cs>>cf;
    vector<int>arr(n);
    for(int i=0;i<n;i++)
        arr[i]=i+1;
        int ans=0;
    do{
        bool flag=false;
        if(arr[0]!=cs)continue;
        if(arr[n-1]!=cf)continue;
        for(int i=1;i<n-1;i++){
            bool a1=arr[i]<arr[i-1];
            bool a2=arr[i]<arr[i+1];
            if(a1!=a2){
                flag=true;
            }
        }
        if(flag)continue;
        ans++;
    }while(next_permutation(arr.begin(),arr.end()));
    cout<<ans;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Execution timed out 2044 ms 600 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Execution timed out 2044 ms 600 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Execution timed out 2044 ms 600 KB Time limit exceeded
4 Halted 0 ms 0 KB -