oj.uz

Submission #222691

# Submission time Handle Problem Language Result Execution time Memory
222691 2020-04-13T17:22:05 Z Minnakhmetov Kangaroo (CEOI16_kangaroo) C++14
36 / 100
 2000 ms 31004 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define all(aaa) aaa.begin(), aaa.end()

const int N = 205, MOD = 1e9 + 7;
int dp[N][N][N][2];

void add(int &a, int b) {
	a += b;
	if (a >= MOD)
		a -= MOD;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, cs, cf;
    cin >> n >> cs >> cf;

    cs--, cf--;

    dp[2][0][1][1]++;
    dp[2][1][0][0]++;

    for (int i = 3; i <= n; i++) {
    	for (int j = 0; j < i; j++) {
    		for (int k = 0; k < i; k++) {
    			if (j != k) {
	    			for (int h = 0; h < j; h++) {
	    				if (h != k)
	    					add(dp[i][j][k][0], dp[i - 1][h][k - (k > j)][1]);
	    			}
	    			for (int h = j + 1; h < n; h++) {
	    				if (h != k)
	    					add(dp[i][j][k][1], dp[i - 1][h - 1][k - (k > j)][0]);
	    			}
    			}
    		}
    	}
    }

    int ans = (dp[n][cs][cf][0] + dp[n][cs][cf][1]) % MOD;

    cout << ans;

    return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 1024 KB Output is correct
4 Correct 10 ms 1792 KB Output is correct
5 Correct 9 ms 1664 KB Output is correct
6 Correct 9 ms 1792 KB Output is correct
7 Correct 8 ms 1536 KB Output is correct
8 Correct 9 ms 1664 KB Output is correct
9 Correct 9 ms 1792 KB Output is correct
10 Correct 10 ms 1792 KB Output is correct
11 Correct 9 ms 1664 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 1024 KB Output is correct
4 Correct 10 ms 1792 KB Output is correct
5 Correct 9 ms 1664 KB Output is correct
6 Correct 9 ms 1792 KB Output is correct
7 Correct 8 ms 1536 KB Output is correct
8 Correct 9 ms 1664 KB Output is correct
9 Correct 9 ms 1792 KB Output is correct
10 Correct 10 ms 1792 KB Output is correct
11 Correct 9 ms 1664 KB Output is correct
12 Execution timed out 2078 ms 31004 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 1024 KB Output is correct
4 Correct 10 ms 1792 KB Output is correct
5 Correct 9 ms 1664 KB Output is correct
6 Correct 9 ms 1792 KB Output is correct
7 Correct 8 ms 1536 KB Output is correct
8 Correct 9 ms 1664 KB Output is correct
9 Correct 9 ms 1792 KB Output is correct
10 Correct 10 ms 1792 KB Output is correct
11 Correct 9 ms 1664 KB Output is correct
12 Execution timed out 2078 ms 31004 KB Time limit exceeded
13 Halted 0 ms 0 KB -