oj.uz

Submission #45227

# Submission time Handle Problem Language Result Execution time Memory
45227 2018-04-12T00:11:17 Z sorry_Benq Kangaroo (CEOI16_kangaroo) C++17
51 / 100
 107 ms 2168 KB 
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;

int DPplusfirst[205][205];
int DPplussecond[205][205];
int DPminusfirst[205][205];
int DPminussecond[205][205];

void cpy(){
	for (int i = 0; i < 205; i++){
		for (int j = 0; j < 205; j++){
			DPplusfirst[i][j] = DPplussecond[i][j];
			DPminusfirst[i][j] = DPminussecond[i][j];	
		}
	}
}

int main(){
	int N, cs, cf; cin >> N >> cs >> cf;
	DPplussecond[1][2] = 1LL;
	DPminussecond[2][1] = 1LL;
	for (int i = 3; i <= N; i++){
		cpy();
		for (int k = 1; k <= i; k++){
			bool vis[2];
			vis[0] = false;
			vis[1] = false;
			for (int j = 1; j <= i; j++){
				if (k == j) continue;
				DPplussecond[j][k] = 0LL;
				DPminussecond[j][k] = 0LL;
				int eps = (k > j);
				if (vis[eps]){
					DPminussecond[j][k] = DPminussecond[j-1][k] + DPplusfirst[j-1][k-eps];
					DPminussecond[j][k] %= MOD;
					DPplussecond[j][k] = DPplussecond[j-1][k] + (MOD - DPminusfirst[j-1][k-eps]);
					DPplussecond[j][k] %= MOD; 
				}
				else{
					vis[eps] = true;
					for (int l = 1; l <= j - 1; l++){
						DPminussecond[j][k] += DPplusfirst[l][k - eps];
						DPminussecond[j][k] %= MOD;
					}
					for (int l = j + 1; l <= i; l++){
						DPplussecond[j][k] += DPminusfirst[l - 1][k - eps];
						DPplussecond[j][k] %= MOD; 
					}
				}
			
			}
		}
	}
	cout << (DPplussecond[cs][cf] + DPminussecond[cs][cf]) % MOD << endl;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 4 ms 776 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 5 ms 1056 KB Output is correct
6 Correct 5 ms 1076 KB Output is correct
7 Correct 5 ms 1076 KB Output is correct
8 Correct 5 ms 1076 KB Output is correct
9 Correct 5 ms 1132 KB Output is correct
10 Correct 5 ms 1132 KB Output is correct
11 Correct 5 ms 1132 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 4 ms 776 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 5 ms 1056 KB Output is correct
6 Correct 5 ms 1076 KB Output is correct
7 Correct 5 ms 1076 KB Output is correct
8 Correct 5 ms 1076 KB Output is correct
9 Correct 5 ms 1132 KB Output is correct
10 Correct 5 ms 1132 KB Output is correct
11 Correct 5 ms 1132 KB Output is correct
12 Correct 64 ms 1276 KB Output is correct
13 Correct 55 ms 1276 KB Output is correct
14 Correct 64 ms 1276 KB Output is correct
15 Correct 63 ms 1276 KB Output is correct
16 Correct 65 ms 1276 KB Output is correct
17 Correct 67 ms 1344 KB Output is correct
18 Correct 48 ms 1348 KB Output is correct
19 Correct 63 ms 1352 KB Output is correct
20 Correct 65 ms 1352 KB Output is correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 4 ms 776 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 5 ms 1056 KB Output is correct
6 Correct 5 ms 1076 KB Output is correct
7 Correct 5 ms 1076 KB Output is correct
8 Correct 5 ms 1076 KB Output is correct
9 Correct 5 ms 1132 KB Output is correct
10 Correct 5 ms 1132 KB Output is correct
11 Correct 5 ms 1132 KB Output is correct
12 Correct 64 ms 1276 KB Output is correct
13 Correct 55 ms 1276 KB Output is correct
14 Correct 64 ms 1276 KB Output is correct
15 Correct 63 ms 1276 KB Output is correct
16 Correct 65 ms 1276 KB Output is correct
17 Correct 67 ms 1344 KB Output is correct
18 Correct 48 ms 1348 KB Output is correct
19 Correct 63 ms 1352 KB Output is correct
20 Correct 65 ms 1352 KB Output is correct
21 Runtime error 107 ms 2168 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -