oj.uz

Submission #528840

# Submission time Handle Problem Language Result Execution time Memory
528840 2022-02-21T14:57:20 Z Lobo Asceticism (JOI18_asceticism) C++17
49 / 100
 46 ms 27468 KB 
#include<bits/stdc++.h>
using namespace std;

const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

#define maxn 3300

int n, k, dp[maxn][maxn];
int mod = 1e9+7;

void solve() {
    cin >> n >> k;

    //dp[i][j] = ja colocou ate o i e esta ocupando j dias
    dp[1][1] = 1;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= k; j++) {
            // cout << i << " " << j << " " << dp[i][j] << endl;
            dp[i][j]%= mod;

            dp[i+1][j]+= dp[i][j]*j;
            // cout << i << " " << j << " -> " << i+1 << " " << j << " -=- " << dp[i][j] << endl;
            dp[i+1][j+1]+= dp[i][j]*(i+1-j);
            // cout << i << " " << j << " -> " << i+1 << " " << j+1 << " -=- " << dp[i][j]*i << endl;
        }
    }

    cout << dp[n][k]<< endl;


}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", "r", stdin);
    //freopen("out.out", "w", stdout);

    int tt = 1;
    // cin >> tt;
    while(tt--) solve();

}

Subtask #1
4.0 / 4.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 716 KB Output is correct
12 Correct 1 ms 1484 KB Output is correct
13 Correct 1 ms 1484 KB Output is correct
14 Correct 2 ms 1740 KB Output is correct
15 Correct 2 ms 2124 KB Output is correct
16 Correct 2 ms 2124 KB Output is correct
17 Correct 1 ms 1100 KB Output is correct
18 Correct 1 ms 1612 KB Output is correct
19 Correct 1 ms 972 KB Output is correct
20 Correct 0 ms 332 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 716 KB Output is correct
12 Correct 1 ms 1484 KB Output is correct
13 Correct 1 ms 1484 KB Output is correct
14 Correct 2 ms 1740 KB Output is correct
15 Correct 2 ms 2124 KB Output is correct
16 Correct 2 ms 2124 KB Output is correct
17 Correct 1 ms 1100 KB Output is correct
18 Correct 1 ms 1612 KB Output is correct
19 Correct 1 ms 972 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 2 ms 4300 KB Output is correct
22 Correct 2 ms 4300 KB Output is correct
23 Correct 6 ms 7884 KB Output is correct
24 Correct 6 ms 8268 KB Output is correct
25 Correct 10 ms 11740 KB Output is correct
26 Correct 10 ms 12104 KB Output is correct
27 Correct 10 ms 12092 KB Output is correct
28 Correct 4 ms 5196 KB Output is correct
29 Correct 1 ms 1228 KB Output is correct
30 Correct 11 ms 11852 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 716 KB Output is correct
12 Correct 1 ms 1484 KB Output is correct
13 Correct 1 ms 1484 KB Output is correct
14 Correct 2 ms 1740 KB Output is correct
15 Correct 2 ms 2124 KB Output is correct
16 Correct 2 ms 2124 KB Output is correct
17 Correct 1 ms 1100 KB Output is correct
18 Correct 1 ms 1612 KB Output is correct
19 Correct 1 ms 972 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 2 ms 4300 KB Output is correct
22 Correct 2 ms 4300 KB Output is correct
23 Correct 6 ms 7884 KB Output is correct
24 Correct 6 ms 8268 KB Output is correct
25 Correct 10 ms 11740 KB Output is correct
26 Correct 10 ms 12104 KB Output is correct
27 Correct 10 ms 12092 KB Output is correct
28 Correct 4 ms 5196 KB Output is correct
29 Correct 1 ms 1228 KB Output is correct
30 Correct 11 ms 11852 KB Output is correct
31 Runtime error 46 ms 27468 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -