Submission #1118051

#	Time	Username	Problem	Language	Result	Execution time	Memory
1118051		vjudge1	Kangaroo (CEOI16_kangaroo)	C++17	100 / 100	33 ms	31908 KiB

kangaroo

//Desinged by AzeTurk810 Open source
#include <bits/stdc++.h>
using namespace std;

# define ull unsigned long long
# define hurryup ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
# define endl '\n'
# define pb push_back
# define INF 1e10
# define vbol vector<bool>
# define vint vector<int>
# define ll long long
# define int long long
# define mod 1000000007

signed main()
{
    int n,cs,cf,fixed = 0;
    cin>>n>>cs>>cf;
    vector<vector<int>>dp (n + 3,vector<int>(n + 3,0));
    dp[1][1] = 1;
    for(int i=1;i<=n;i++)
    {
   		if(cs == i || cf == i) fixed++;
    	for(int j=1;j < i;j++)
    	{
    		if(cs == i || cf == i)
    		{
    			dp[i][j + 1] += (dp[i - 1][j])%mod; 	// yeni birsey kimi elave etmek
    			dp[i][j] += (dp[i - 1][j])%mod;		// evvele ve ya sola birlesdirmek
    			dp[i][j] %= mod;
    			dp[i][j + 1] %= mod;
    		}
    		else
    		{
    			dp[i][j + 1] += (dp[i - 1][ j ] * (j-fixed + 1))%mod;	//Yenii bir sey kimi elave etmek
    			dp[i][ j -1] +=( dp[i -1 ][j] *(j - 1))%mod;	//iki seyi birlesdirmek
    			dp[i][j + 1]%= mod;
    			dp[i][j - 1]%=mod;
    		}
    		
    	}
    }
    cout<<dp[n][1] % mod<<endl;
}

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