oj.uz

Submission #501132

# Submission time Handle Problem Language Result Execution time Memory
501132 2022-01-02T12:25:53 Z codr0 Kangaroo (CEOI16_kangaroo) C++14
51 / 100
 2000 ms 62140 KB 
// Code by Parsa Eslami

#include <bits/stdc++.h>	
#define int long long
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORR(i,a,b) for(int i=a;i>=b;i--)
#define S second
#define F first
#define pb push_back
#define SZ(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define err(x) cout<<#x<<": "<<x<<'\n';

using namespace std;
const int N=2000+5;
const int MOD=1e9+7;
int C[N][N];
int dp[N][N][2];//st t 
int ps[N][2];//st

	void pre(){
		FOR(i,0,N-1) C[0][i]=1;
		FOR(i,1,N-1) FOR(j,i,N-1) C[i][j]=(C[i][j-1]+C[i-1][j-1])%MOD;
		dp[1][1][0]=1;
		dp[1][1][1]=1;
		FOR(i0,0,1) FOR(st,1,N-1){
			ps[st][i0]=ps[st-1][i0]+dp[st][1][i0];
		}
		FOR(t,2,N-1){
			FOR(st,1,t){
				dp[st][t][0]=ps[st-1][1]%MOD;
				dp[st][t][1]=(ps[t][0]-ps[st-1][0])%MOD;
			}
			FOR(i0,0,1) FOR(st,1,N-1){
				ps[st][i0]=(ps[st-1][i0]+dp[st][t][i0])%MOD;
			}
		}
	}

	int32_t main() {
	ios_base::sync_with_stdio(0); cin.tie(0);	
	
	pre();
	int ans=0;
	int n,st,en; cin>>n>>st>>en;
	if(en<st) swap(en,st);
	if(st==1){
		ans=dp[en-1][n-1][(n&1)];
	}else{
		FOR(i,0,st-2) FOR(j,0,en-st-1) FOR(w,0,n-en){
			int t1=st-2-i;
			int t2=en-st-1-j;
			int t3=n-en-w;
			ans+=((((C[i][st-2]*C[j][en-st-1])%MOD)*C[w][n-en]%MOD)*dp[i+1][(i+j+w+2-1)][(i+j+w+2)&1]%MOD)*dp[t1+t2+1][t1+t2+t3+2-1][(t1+t2+t3)&1];
			ans%=MOD;
		}
	}

	ans=((ans%MOD)+MOD)%MOD;
	cout<<ans<<'\n';

	return 0;
    }

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 62140 KB Output is correct
2 Correct 135 ms 61960 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 62140 KB Output is correct
2 Correct 135 ms 61960 KB Output is correct
3 Correct 139 ms 61984 KB Output is correct
4 Correct 147 ms 61960 KB Output is correct
5 Correct 137 ms 62020 KB Output is correct
6 Correct 133 ms 62084 KB Output is correct
7 Correct 142 ms 62040 KB Output is correct
8 Correct 135 ms 61936 KB Output is correct
9 Correct 137 ms 61992 KB Output is correct
10 Correct 177 ms 62032 KB Output is correct
11 Correct 134 ms 61944 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 62140 KB Output is correct
2 Correct 135 ms 61960 KB Output is correct
3 Correct 139 ms 61984 KB Output is correct
4 Correct 147 ms 61960 KB Output is correct
5 Correct 137 ms 62020 KB Output is correct
6 Correct 133 ms 62084 KB Output is correct
7 Correct 142 ms 62040 KB Output is correct
8 Correct 135 ms 61936 KB Output is correct
9 Correct 137 ms 61992 KB Output is correct
10 Correct 177 ms 62032 KB Output is correct
11 Correct 134 ms 61944 KB Output is correct
12 Correct 147 ms 61936 KB Output is correct
13 Correct 157 ms 61976 KB Output is correct
14 Correct 145 ms 62004 KB Output is correct
15 Correct 135 ms 61940 KB Output is correct
16 Correct 139 ms 62092 KB Output is correct
17 Correct 157 ms 62036 KB Output is correct
18 Correct 129 ms 62020 KB Output is correct
19 Correct 140 ms 62004 KB Output is correct
20 Correct 138 ms 61912 KB Output is correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 62140 KB Output is correct
2 Correct 135 ms 61960 KB Output is correct
3 Correct 139 ms 61984 KB Output is correct
4 Correct 147 ms 61960 KB Output is correct
5 Correct 137 ms 62020 KB Output is correct
6 Correct 133 ms 62084 KB Output is correct
7 Correct 142 ms 62040 KB Output is correct
8 Correct 135 ms 61936 KB Output is correct
9 Correct 137 ms 61992 KB Output is correct
10 Correct 177 ms 62032 KB Output is correct
11 Correct 134 ms 61944 KB Output is correct
12 Correct 147 ms 61936 KB Output is correct
13 Correct 157 ms 61976 KB Output is correct
14 Correct 145 ms 62004 KB Output is correct
15 Correct 135 ms 61940 KB Output is correct
16 Correct 139 ms 62092 KB Output is correct
17 Correct 157 ms 62036 KB Output is correct
18 Correct 129 ms 62020 KB Output is correct
19 Correct 140 ms 62004 KB Output is correct
20 Correct 138 ms 61912 KB Output is correct
21 Correct 219 ms 62036 KB Output is correct
22 Correct 208 ms 61920 KB Output is correct
23 Correct 277 ms 62140 KB Output is correct
24 Execution timed out 2071 ms 62016 KB Time limit exceeded
25 Halted 0 ms 0 KB -