oj.uz

Submission #987821

# Submission time Handle Problem Language Result Execution time Memory
987821 2024-05-23T16:06:57 Z LOLOLO Kangaroo (CEOI16_kangaroo) C++17
0 / 100
 2 ms 4444 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 + 1; k <= len; 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
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Incorrect 1 ms 4440 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Incorrect 1 ms 4440 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Incorrect 1 ms 4440 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Incorrect 1 ms 4440 KB Output isn't correct
3 Halted 0 ms 0 KB -