oj.uz

Submission #987824

# Submission time Handle Problem Language Result Execution time Memory
987824 2024-05-23T16:10:26 Z LOLOLO Kangaroo (CEOI16_kangaroo) C++17
51 / 100
 2000 ms 81756 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 210;
int mod = 1e9 + 7;
int A[N][N][N], D[N][N][N];

void add(int &a, int b) { 
    a += b;
    while (a >= mod)
        a -= mod;
}  

int solve() {
    int n, cs, cf;
    cin >> n >> cs >> cf;

    A[2][1][2] = D[2][2][1] = 1;
    for (int len = 3; len <= n; len++) {
        for (int i = 1; i <= len; i++) {
            for (int j = 1; j <= len; j++) {
                if (i == j)
                    continue;
                
                for (int k = 1; k < i; k++) {
                    add(D[len][i][j], A[len - 1][k][j - bool(j > i)]);
                }

                for (int k = i; k <= len - 1; k++) {
                    add(A[len][i][j], D[len - 1][k][j - bool(j > i)]);
                }
            }

        }
    }

    return (A[n][cs][cf] + D[n][cs][cf]) % mod;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    //cin >> t;

    while (t--) {
        cout << solve() << '\n';
    }

    return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 4 ms 5980 KB Output is correct
5 Correct 4 ms 5720 KB Output is correct
6 Correct 5 ms 5840 KB Output is correct
7 Correct 4 ms 5720 KB Output is correct
8 Correct 4 ms 5724 KB Output is correct
9 Correct 4 ms 5980 KB Output is correct
10 Correct 5 ms 5980 KB Output is correct
11 Correct 6 ms 5724 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 4 ms 5980 KB Output is correct
5 Correct 4 ms 5720 KB Output is correct
6 Correct 5 ms 5840 KB Output is correct
7 Correct 4 ms 5720 KB Output is correct
8 Correct 4 ms 5724 KB Output is correct
9 Correct 4 ms 5980 KB Output is correct
10 Correct 5 ms 5980 KB Output is correct
11 Correct 6 ms 5724 KB Output is correct
12 Correct 1630 ms 38132 KB Output is correct
13 Correct 1289 ms 34308 KB Output is correct
14 Correct 1639 ms 38164 KB Output is correct
15 Correct 1687 ms 38368 KB Output is correct
16 Correct 1624 ms 38200 KB Output is correct
17 Correct 1673 ms 38620 KB Output is correct
18 Correct 1076 ms 31640 KB Output is correct
19 Correct 1591 ms 37972 KB Output is correct
20 Correct 1707 ms 38664 KB Output is correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 4 ms 5980 KB Output is correct
5 Correct 4 ms 5720 KB Output is correct
6 Correct 5 ms 5840 KB Output is correct
7 Correct 4 ms 5720 KB Output is correct
8 Correct 4 ms 5724 KB Output is correct
9 Correct 4 ms 5980 KB Output is correct
10 Correct 5 ms 5980 KB Output is correct
11 Correct 6 ms 5724 KB Output is correct
12 Correct 1630 ms 38132 KB Output is correct
13 Correct 1289 ms 34308 KB Output is correct
14 Correct 1639 ms 38164 KB Output is correct
15 Correct 1687 ms 38368 KB Output is correct
16 Correct 1624 ms 38200 KB Output is correct
17 Correct 1673 ms 38620 KB Output is correct
18 Correct 1076 ms 31640 KB Output is correct
19 Correct 1591 ms 37972 KB Output is correct
20 Correct 1707 ms 38664 KB Output is correct
21 Execution timed out 2021 ms 81756 KB Time limit exceeded
22 Halted 0 ms 0 KB -