oj.uz

Submission #127773

# Submission time Handle Problem Language Result Execution time Memory
127773 2019-07-10T05:55:32 Z BThero Asceticism (JOI18_asceticism) C++17
24 / 100
 447 ms 116316 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)3e2 + 5;
const int MOD = (int)1e9 + 7;

int dp[MAXN][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);

    for (int a = 0; a < n; ++a) {
        dp[1][0][a] = 1;
    }

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

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

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

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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 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 11 ms 6776 KB Output is correct
12 Correct 109 ms 55324 KB Output is correct
13 Correct 102 ms 55288 KB Output is correct
14 Correct 114 ms 55348 KB Output is correct
15 Correct 104 ms 55416 KB Output is correct
16 Correct 104 ms 55444 KB Output is correct
17 Correct 40 ms 24824 KB Output is correct
18 Correct 79 ms 39672 KB Output is correct
19 Correct 19 ms 11768 KB Output is correct
20 Correct 2 ms 504 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 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 11 ms 6776 KB Output is correct
12 Correct 109 ms 55324 KB Output is correct
13 Correct 102 ms 55288 KB Output is correct
14 Correct 114 ms 55348 KB Output is correct
15 Correct 104 ms 55416 KB Output is correct
16 Correct 104 ms 55444 KB Output is correct
17 Correct 40 ms 24824 KB Output is correct
18 Correct 79 ms 39672 KB Output is correct
19 Correct 19 ms 11768 KB Output is correct
20 Correct 2 ms 504 KB Output is correct
21 Runtime error 447 ms 116316 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 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 11 ms 6776 KB Output is correct
12 Correct 109 ms 55324 KB Output is correct
13 Correct 102 ms 55288 KB Output is correct
14 Correct 114 ms 55348 KB Output is correct
15 Correct 104 ms 55416 KB Output is correct
16 Correct 104 ms 55444 KB Output is correct
17 Correct 40 ms 24824 KB Output is correct
18 Correct 79 ms 39672 KB Output is correct
19 Correct 19 ms 11768 KB Output is correct
20 Correct 2 ms 504 KB Output is correct
21 Runtime error 447 ms 116316 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -