oj.uz

Submission #205157

# Submission time Handle Problem Language Result Execution time Memory
205157 2020-02-28T08:21:27 Z Atill83 Asceticism (JOI18_asceticism) C++14
49 / 100
 50 ms 25080 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e3+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n, k;
ll dp[MAXN][MAXN];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
    #endif

    cin>>n>>k;
    dp[1][0] = 1;
    for(int i = 2; i <= n; i++){
        dp[i][0] = 1;
        for(int j = 1; j < k; j++){
            dp[i][j] = ((i - j)*dp[i - 1][j - 1] + dp[i - 1][j]*(j + 1))%mod;
        }
    }
    cout<<dp[n][k - 1]<<endl;

    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Subtask #1
4.0 / 4.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 380 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 760 KB Output is correct
12 Correct 5 ms 1528 KB Output is correct
13 Correct 5 ms 1528 KB Output is correct
14 Correct 5 ms 1784 KB Output is correct
15 Correct 6 ms 2168 KB Output is correct
16 Correct 7 ms 2296 KB Output is correct
17 Correct 5 ms 1144 KB Output is correct
18 Correct 5 ms 1656 KB Output is correct
19 Correct 6 ms 1016 KB Output is correct
20 Correct 5 ms 376 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 380 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 760 KB Output is correct
12 Correct 5 ms 1528 KB Output is correct
13 Correct 5 ms 1528 KB Output is correct
14 Correct 5 ms 1784 KB Output is correct
15 Correct 6 ms 2168 KB Output is correct
16 Correct 7 ms 2296 KB Output is correct
17 Correct 5 ms 1144 KB Output is correct
18 Correct 5 ms 1656 KB Output is correct
19 Correct 6 ms 1016 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 6 ms 4344 KB Output is correct
22 Correct 7 ms 4344 KB Output is correct
23 Correct 9 ms 7928 KB Output is correct
24 Correct 10 ms 8312 KB Output is correct
25 Correct 13 ms 11772 KB Output is correct
26 Correct 13 ms 12152 KB Output is correct
27 Correct 14 ms 12152 KB Output is correct
28 Correct 8 ms 5368 KB Output is correct
29 Correct 5 ms 1272 KB Output is correct
30 Correct 14 ms 11896 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 380 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 760 KB Output is correct
12 Correct 5 ms 1528 KB Output is correct
13 Correct 5 ms 1528 KB Output is correct
14 Correct 5 ms 1784 KB Output is correct
15 Correct 6 ms 2168 KB Output is correct
16 Correct 7 ms 2296 KB Output is correct
17 Correct 5 ms 1144 KB Output is correct
18 Correct 5 ms 1656 KB Output is correct
19 Correct 6 ms 1016 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 6 ms 4344 KB Output is correct
22 Correct 7 ms 4344 KB Output is correct
23 Correct 9 ms 7928 KB Output is correct
24 Correct 10 ms 8312 KB Output is correct
25 Correct 13 ms 11772 KB Output is correct
26 Correct 13 ms 12152 KB Output is correct
27 Correct 14 ms 12152 KB Output is correct
28 Correct 8 ms 5368 KB Output is correct
29 Correct 5 ms 1272 KB Output is correct
30 Correct 14 ms 11896 KB Output is correct
31 Runtime error 50 ms 25080 KB Execution killed with signal 11 (could be triggered by violating memory limits)
32 Halted 0 ms 0 KB -