oj.uz

Submission #24714

# Submission time Handle Problem Language Result Execution time Memory
24714 2017-06-12T05:26:55 Z dotorya Kangaroo (CEOI16_kangaroo) C++14
100 / 100
 9 ms 34852 KB 
#include <stdio.h>  
#include <algorithm>  
#include <assert.h>
#include <bitset>
#include <cmath>  
#include <complex>  
#include <deque>  
#include <functional>  
#include <iostream>  
#include <limits.h>  
#include <map>  
#include <math.h>  
#include <queue>  
#include <set>  
#include <stdlib.h>  
#include <string.h>  
#include <string>  
#include <time.h>  
#include <unordered_map>  
#include <unordered_set>  
#include <vector>  

#pragma warning(disable:4996)  
#pragma comment(linker, "/STACK:336777216")  
using namespace std;

#define mp make_pair  
#define Fi first  
#define Se second  
#define pb(x) push_back(x)  
#define szz(x) ((int)(x).size())  
#define rep(i, n) for(int i=0;i<n;i++)  
#define all(x) (x).begin(), (x).end()  
#define ldb ldouble  

typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <db, db> pdd;

int IT_MAX = 1 << 20;
const ll MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db ERR = 1E-11;

// Reference : http://blog.myungwoo.kr/105
ll dp[2050][2050];
int main() {
	int N, st, en, i, j;
	scanf("%d %d %d", &N, &st, &en);

	dp[0][0] = 1;
	int f = 0;
	for (i = 1; i <= N; i++) {
		for (j = 1; j <= i; j++) {
			if (i == st || i == en) dp[i][j] = (dp[i - 1][j] + dp[i - 1][j - 1]) % MOD;
			else dp[i][j] = (dp[i - 1][j + 1] * j + dp[i - 1][j - 1] * (j - f)) % MOD;
		}
		if (i == st || i == en) f++;
	}
	return !printf("%lld\n", dp[N][1]);
}

Compilation message

kangaroo.cpp:23:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning(disable:4996)  
 ^
kangaroo.cpp:24:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/STACK:336777216")  
 ^
kangaroo.cpp: In function 'int main()':
kangaroo.cpp:57:33: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d", &N, &st, &en);
                                 ^

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 34852 KB Output is correct
2 Correct 0 ms 34852 KB Output is correct
3 Correct 0 ms 34852 KB Output is correct
4 Correct 0 ms 34852 KB Output is correct
5 Correct 0 ms 34852 KB Output is correct
6 Correct 0 ms 34852 KB Output is correct
7 Correct 0 ms 34852 KB Output is correct
8 Correct 0 ms 34852 KB Output is correct
9 Correct 0 ms 34852 KB Output is correct
10 Correct 0 ms 34852 KB Output is correct
11 Correct 0 ms 34852 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 34852 KB Output is correct
2 Correct 0 ms 34852 KB Output is correct
3 Correct 0 ms 34852 KB Output is correct
4 Correct 0 ms 34852 KB Output is correct
5 Correct 0 ms 34852 KB Output is correct
6 Correct 0 ms 34852 KB Output is correct
7 Correct 0 ms 34852 KB Output is correct
8 Correct 0 ms 34852 KB Output is correct
9 Correct 0 ms 34852 KB Output is correct
10 Correct 0 ms 34852 KB Output is correct
11 Correct 0 ms 34852 KB Output is correct
12 Correct 0 ms 34852 KB Output is correct
13 Correct 0 ms 34852 KB Output is correct
14 Correct 0 ms 34852 KB Output is correct
15 Correct 0 ms 34852 KB Output is correct
16 Correct 0 ms 34852 KB Output is correct
17 Correct 0 ms 34852 KB Output is correct
18 Correct 0 ms 34852 KB Output is correct
19 Correct 0 ms 34852 KB Output is correct
20 Correct 0 ms 34852 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 34852 KB Output is correct
2 Correct 0 ms 34852 KB Output is correct
3 Correct 0 ms 34852 KB Output is correct
4 Correct 0 ms 34852 KB Output is correct
5 Correct 0 ms 34852 KB Output is correct
6 Correct 0 ms 34852 KB Output is correct
7 Correct 0 ms 34852 KB Output is correct
8 Correct 0 ms 34852 KB Output is correct
9 Correct 0 ms 34852 KB Output is correct
10 Correct 0 ms 34852 KB Output is correct
11 Correct 0 ms 34852 KB Output is correct
12 Correct 0 ms 34852 KB Output is correct
13 Correct 0 ms 34852 KB Output is correct
14 Correct 0 ms 34852 KB Output is correct
15 Correct 0 ms 34852 KB Output is correct
16 Correct 0 ms 34852 KB Output is correct
17 Correct 0 ms 34852 KB Output is correct
18 Correct 0 ms 34852 KB Output is correct
19 Correct 0 ms 34852 KB Output is correct
20 Correct 0 ms 34852 KB Output is correct
21 Correct 0 ms 34852 KB Output is correct
22 Correct 3 ms 34852 KB Output is correct
23 Correct 0 ms 34852 KB Output is correct
24 Correct 9 ms 34852 KB Output is correct
25 Correct 6 ms 34852 KB Output is correct
26 Correct 9 ms 34852 KB Output is correct
27 Correct 6 ms 34852 KB Output is correct
28 Correct 6 ms 34852 KB Output is correct