oj.uz

답안 #127782

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
127782 2019-07-10T06:04:59 Z BThero Asceticism (JOI18_asceticism) C++17
49 / 100
 112 ms 56472 KB 
// Why am I so dumb? :c
// chrono::system_clock::now().time_since_epoch().count()

//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

#define pb push_back
#define mp make_pair

#define all(x) (x).begin(), (x).end()

#define fi first
#define se second

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;   
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int MAXN = (int)3e3 + 5;
const int MOD = (int)1e9 + 7;

int dp[MAXN][MAXN];

int n, k;

int addMod(int a, int b, int m = MOD) {
    a += b;

    if (m <= a) {
        a -= m;
    }

    return a;
}

int mulMod(int a, int b, int m = MOD) {
    return a * 1ll * b % m;
}

void solve() {
    scanf("%d %d", &n, &k);
    dp[1][0] = 1;

    for (int i = 1; i <= n; ++i) {
        for (int j = 0; j < i; ++j) {
            dp[i + 1][j] = addMod(dp[i + 1][j], mulMod(dp[i][j], j + 1));
            dp[i + 1][j + 1] = addMod(dp[i + 1][j + 1], mulMod(dp[i][j], i - j)); 
        }
    }

    printf("%d\n", dp[n][k - 1]);
}

int main() {
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);

    int tt = 1;

    while (tt--) {
        solve();
    }

    return 0;
}

Compilation message

asceticism.cpp: In function 'void solve()':
asceticism.cpp:47:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &k);
     ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 252 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 252 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 808 KB Output is correct
12 Correct 4 ms 1784 KB Output is correct
13 Correct 4 ms 1656 KB Output is correct
14 Correct 4 ms 1784 KB Output is correct
15 Correct 4 ms 1656 KB Output is correct
16 Correct 4 ms 1656 KB Output is correct
17 Correct 3 ms 1272 KB Output is correct
18 Correct 3 ms 1400 KB Output is correct
19 Correct 3 ms 888 KB Output is correct
20 Correct 2 ms 376 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 252 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 808 KB Output is correct
12 Correct 4 ms 1784 KB Output is correct
13 Correct 4 ms 1656 KB Output is correct
14 Correct 4 ms 1784 KB Output is correct
15 Correct 4 ms 1656 KB Output is correct
16 Correct 4 ms 1656 KB Output is correct
17 Correct 3 ms 1272 KB Output is correct
18 Correct 3 ms 1400 KB Output is correct
19 Correct 3 ms 888 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 12 ms 6236 KB Output is correct
22 Correct 13 ms 6264 KB Output is correct
23 Correct 15 ms 6264 KB Output is correct
24 Correct 11 ms 6264 KB Output is correct
25 Correct 12 ms 6312 KB Output is correct
26 Correct 12 ms 6264 KB Output is correct
27 Correct 15 ms 6264 KB Output is correct
28 Correct 8 ms 3448 KB Output is correct
29 Correct 3 ms 1144 KB Output is correct
30 Correct 12 ms 6264 KB Output is correct

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 252 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 808 KB Output is correct
12 Correct 4 ms 1784 KB Output is correct
13 Correct 4 ms 1656 KB Output is correct
14 Correct 4 ms 1784 KB Output is correct
15 Correct 4 ms 1656 KB Output is correct
16 Correct 4 ms 1656 KB Output is correct
17 Correct 3 ms 1272 KB Output is correct
18 Correct 3 ms 1400 KB Output is correct
19 Correct 3 ms 888 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 12 ms 6236 KB Output is correct
22 Correct 13 ms 6264 KB Output is correct
23 Correct 15 ms 6264 KB Output is correct
24 Correct 11 ms 6264 KB Output is correct
25 Correct 12 ms 6312 KB Output is correct
26 Correct 12 ms 6264 KB Output is correct
27 Correct 15 ms 6264 KB Output is correct
28 Correct 8 ms 3448 KB Output is correct
29 Correct 3 ms 1144 KB Output is correct
30 Correct 12 ms 6264 KB Output is correct
31 Runtime error 112 ms 56472 KB Execution killed with signal 11 (could be triggered by violating memory limits)
32 Halted 0 ms 0 KB -