oj.uz

Submission #316361

# Submission time Handle Problem Language Result Execution time Memory
316361 2020-10-26T06:50:56 Z BeanZ Kangaroo (CEOI16_kangaroo) C++14
100 / 100
 65 ms 31740 KB 
// I_Love_LPL
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
const int N = 105;
const int mod = 1e9 + 7;
ll dp[2005][2005];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    if (fopen("A.inp", "r")){
        freopen("test.inp", "r", stdin);
        freopen("test.out", "w", stdout);
    }
    ll n, cs, cf;
    cin >> n >> cs >> cf;
    // dp[i][j] la xet den thang thu i va dang co j nhom loai 1
    dp[0][0] = 1;
    for (int i = 1; i <= n; i++){
        for (int j = 0; j <= n; j++){
            if (cs == i){
                // mo mot nhom moi
                dp[i][j] = (dp[i][j] + dp[i - 1][j]) % mod;
                // ghep voi mot nhom loai 1
                dp[i][j] = (dp[i][j] + dp[i - 1][j + 1] * (j + 1)) % mod;
            } else if (cf == i){
                // mo mot nhom moi
                dp[i][j] = (dp[i][j] + dp[i - 1][j]) % mod;
                // ghep voi mot nhom loai 1
                dp[i][j] = (dp[i][j] + dp[i - 1][j + 1] * (j + 1)) % mod;
            } else {
                // mo mot nhom moi
                if (j > 0) dp[i][j] = (dp[i][j] + dp[i - 1][j - 1]) % mod;
                // ghep 2 nhom loai 1 voi nhau
                dp[i][j] = (dp[i][j] + dp[i - 1][j + 1] * (j + 1) * j) % mod;
                // ghep 1 nhom loai 1 va mot nhom loai 2
                if (i > cs) dp[i][j] = (dp[i][j] + dp[i - 1][j + 1] * (j + 1)) % mod;
                // ghep 1 nhom loai 1 va mot nhom loai 3
                if (i > cf) dp[i][j] = (dp[i][j] + dp[i - 1][j + 1] * (j + 1)) % mod;
            }
            //cout << dp[i][j] << " ";
        }
        //cout << endl;
    }
    cout << dp[n - 1][0];
}
/*
*/

Compilation message

kangaroo.cpp: In function 'int main()':
kangaroo.cpp:13:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   13 |         freopen("test.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
kangaroo.cpp:14:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   14 |         freopen("test.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 2 ms 1408 KB Output is correct
13 Correct 2 ms 1408 KB Output is correct
14 Correct 1 ms 1408 KB Output is correct
15 Correct 2 ms 1408 KB Output is correct
16 Correct 2 ms 1408 KB Output is correct
17 Correct 2 ms 1408 KB Output is correct
18 Correct 2 ms 1280 KB Output is correct
19 Correct 2 ms 1408 KB Output is correct
20 Correct 2 ms 1408 KB Output is correct
21 Correct 8 ms 6400 KB Output is correct
22 Correct 9 ms 7040 KB Output is correct
23 Correct 11 ms 7808 KB Output is correct
24 Correct 57 ms 31740 KB Output is correct
25 Correct 59 ms 31740 KB Output is correct
26 Correct 57 ms 31736 KB Output is correct
27 Correct 65 ms 31608 KB Output is correct
28 Correct 40 ms 23800 KB Output is correct