oj.uz

Submission #315741

# Submission time Handle Problem Language Result Execution time Memory
315741 2020-10-23T21:07:24 Z fadi57 Kangaroo (CEOI16_kangaroo) C++14
0 / 100
 28 ms 47352 KB 
#include <bits/stdc++.h>
using namespace std;
const int mx=2000;
typedef long long ll;
int n,m;
int st,en;
//(i,x,state);
map<int,int>mp;
int dp[mx][mx][3];
int solve(int i,int x,int dir){
    if(i==en){
       if(x==n){
        return 1;}
        return 0;
    }
   int &ret=dp[i][x][dir];
   if(ret!=-1){return ret;}
     ret=0;
    if(dir==0){
        for(int j=i+1;j<=n;j++){
            if(mp[j]){continue;}
            
            mp[j]=1;
            ret+=solve(j,x+1,dir^1);
            mp[j]=0;
        }
        
    }else{
         for(int j=i-1;j>=1;j--){
            if(mp[j]){continue;}
            mp[j]=1;
            ret+=solve(j,x+1,dir^1);
            mp[j]=0;
        }
    }return ret;
    
}
int main() {
   
  cin>>n>>st>>en;
  memset(dp,-1,sizeof(dp));
  
  mp[st]=1;
  cout<<solve(st,1,0)+solve(st,1,1);

 
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 47232 KB Output is correct
2 Incorrect 28 ms 47352 KB Output isn't correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 47232 KB Output is correct
2 Incorrect 28 ms 47352 KB Output isn't correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 47232 KB Output is correct
2 Incorrect 28 ms 47352 KB Output isn't correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 47232 KB Output is correct
2 Incorrect 28 ms 47352 KB Output isn't correct