oj.uz

Submission #893645

# Submission time Handle Problem Language Result Execution time Memory
893645 2023-12-27T08:36:44 Z vjudge1 Kangaroo (CEOI16_kangaroo) C++17
51 / 100
 1982 ms 524288 KB 
#include<bits/stdc++.h>

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
#define int ll
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mispertion ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define F first
#define S second
#define getlast(s) (*s.rbegin())
#define debg cout << "OK\n"

const ld PI = 3.1415926535;
const int N = 2e5 + 2;
const int M = 7e6 + 1;
int mod = 1e9+7;
const int infi = INT_MAX;
const ll infl = LLONG_MAX;
const int P = 31;

int mult(int a, int b) {
    return a * 1LL * b % mod;
}

int sum(int a, int b) {
    a %= mod; 
    if (a + b < 0)
        return a + b + mod;
    if (a + b >= mod)
        return a + b - mod;
    return a + b;
}

ll binpow(ll a, ll n) {
    if (n == 0)
        return 1;
    if (n % 2 == 1) {
        return binpow(a, n - 1) * a % mod;
    } else {
        ll b = binpow(a, n / 2);
        return b * b % mod;
    }
}


void solve(){
    int n, cs, cf;
    cin >> n >> cs >> cf;
    int a[n + 1][n + 1][n + 1];
    int d[n + 1][n + 1][n + 1];
    memset(a, 0, sizeof a);
    memset(d, 0, sizeof d);
    a[2][1][2] = 1;
    d[2][2][1] = 1;
    for(int i = 3; i <= n; i++){
        for(int s = 1; s <= i; s++){
            for(int f = 1; f <= i; f++){
                if(s == f)
                    continue;
                for(int f1 = 1; f1 < f; f1++){
                    if(s > f){
                        a[i][s][f] = sum(a[i][s][f], d[i - 1][s - 1][f1]);
                    }else{
                        a[i][s][f] = sum(a[i][s][f], d[i - 1][s][f1]);
                    }
                }
                for(int f1 = f; f1 <= i; f1++){
                    if(s > f){
                        d[i][s][f] = sum(d[i][s][f], a[i - 1][s - 1][f1]);
                    }else{
                        d[i][s][f] = sum(d[i][s][f], a[i - 1][s][f1]);
                    }
                }
            }
        }
    }
    cout << sum(d[n][cs][cf], a[n][cs][cf]) << '\n';
}   

signed main() {
    mispertion;
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 748 KB Output is correct
4 Correct 4 ms 1372 KB Output is correct
5 Correct 4 ms 1368 KB Output is correct
6 Correct 4 ms 1372 KB Output is correct
7 Correct 3 ms 1116 KB Output is correct
8 Correct 4 ms 1372 KB Output is correct
9 Correct 4 ms 1528 KB Output is correct
10 Correct 4 ms 1372 KB Output is correct
11 Correct 4 ms 1372 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 748 KB Output is correct
4 Correct 4 ms 1372 KB Output is correct
5 Correct 4 ms 1368 KB Output is correct
6 Correct 4 ms 1372 KB Output is correct
7 Correct 3 ms 1116 KB Output is correct
8 Correct 4 ms 1372 KB Output is correct
9 Correct 4 ms 1528 KB Output is correct
10 Correct 4 ms 1372 KB Output is correct
11 Correct 4 ms 1372 KB Output is correct
12 Correct 1929 ms 125680 KB Output is correct
13 Correct 1504 ms 104456 KB Output is correct
14 Correct 1928 ms 125680 KB Output is correct
15 Correct 1966 ms 127564 KB Output is correct
16 Correct 1928 ms 125680 KB Output is correct
17 Correct 1982 ms 127572 KB Output is correct
18 Correct 1236 ms 90452 KB Output is correct
19 Correct 1848 ms 121776 KB Output is correct
20 Correct 1967 ms 127568 KB Output is correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 748 KB Output is correct
4 Correct 4 ms 1372 KB Output is correct
5 Correct 4 ms 1368 KB Output is correct
6 Correct 4 ms 1372 KB Output is correct
7 Correct 3 ms 1116 KB Output is correct
8 Correct 4 ms 1372 KB Output is correct
9 Correct 4 ms 1528 KB Output is correct
10 Correct 4 ms 1372 KB Output is correct
11 Correct 4 ms 1372 KB Output is correct
12 Correct 1929 ms 125680 KB Output is correct
13 Correct 1504 ms 104456 KB Output is correct
14 Correct 1928 ms 125680 KB Output is correct
15 Correct 1966 ms 127564 KB Output is correct
16 Correct 1928 ms 125680 KB Output is correct
17 Correct 1982 ms 127572 KB Output is correct
18 Correct 1236 ms 90452 KB Output is correct
19 Correct 1848 ms 121776 KB Output is correct
20 Correct 1967 ms 127568 KB Output is correct
21 Runtime error 259 ms 524288 KB Execution killed with signal 9
22 Halted 0 ms 0 KB -