oj.uz

Submission #47519

# Submission time Handle Problem Language Result Execution time Memory
47519 2018-05-04T14:11:55 Z qoo2p5 Tents (JOI18_tents) C++17
48 / 100
 2000 ms 700 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int INF = (int) 1e9 + 1e6 + 123;
const ll LINF = (ll) 1e18 + 1e9 + 123;

#define rep(i, s, t) for (auto i = (s); i < (t); ++(i))
#define per(i, s, t) for (auto i = (s); i >= (t); --(i))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back

bool mini(auto &x, const auto &y) {
    if (y < x) {
        x = y;
        return 1;
    }
    return 0;
}

bool maxi(auto &x, const auto &y) {
    if (y > x) {
        x = y;
        return 1;
    }
    return 0;
}

void run();

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    run();
    return 0;
}

const ll MOD = (ll) 1e9 + 7;

ll power(ll x, ll y) {
    if (y == 0) {
        return 1;
    }
    if (y % 2 == 0) {
        ll t = power(x, y / 2);
        return t * t % MOD;
    } else {
        return power(x, y - 1) * x % MOD;
    }
}

const int N = 3003;

int H, W;
ll f[N];
ll fact[N], rfact[N];

ll cnk(int n, int k) {
    return fact[n] * rfact[n - k] % MOD * rfact[k] % MOD;
}

ll calc2(int w, int h) {
    if ((w + h) % 3 != 0) {
        return 0;
    }
    int x = w - (w + h) / 3;
    int y = (w + h) / 3 - x;
    if (x < 0 || y < 0) {
        return 0;
    }
    ll res = cnk(w, y) * cnk(h, x) % MOD;
    res = res * f[x] % MOD;
    res = res * f[y] % MOD;
    return res;
}

ll calc1(int w, int h) {
    if (w < h) {
        swap(w, h);
    }
    ll res = 1;
    rep(cnt, 1, h + 1) {
        res = (res + cnk(w, cnt) * cnk(h, cnt) % MOD * fact[cnt] % MOD * power(4, cnt) % MOD) % MOD;
    }
    return res;
}

void run() {
    f[0] = 1;
    rep(i, 1, N) {
        f[i] = i * 1LL * (2 * i - 1) * f[i - 1] % MOD;
    }
    fact[0] = 1;
    rep(i, 1, N) {
        fact[i] = fact[i - 1] * i % MOD;
    }
    rep(i, 0, N) {
        rfact[i] = power(fact[i], MOD - 2);
    }
    
    ll ans = MOD - 1;
    
    cin >> H >> W;
    rep(h, 0, H + 1) {
        rep(w, 0, W + 1) {
            ll cur = calc2(w, h) * calc1(W - w, H - h) % MOD;
            cur = cur * cnk(W, w) % MOD;
            cur = cur * cnk(H, h) % MOD;
            ans = (ans + cur) % MOD;
        }
    }
    
    cout << ans << "\n";
}

Subtask #1
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 23 ms 532 KB Output is correct
6 Correct 39 ms 660 KB Output is correct
7 Correct 40 ms 660 KB Output is correct
8 Correct 20 ms 660 KB Output is correct
9 Correct 3 ms 660 KB Output is correct
10 Correct 131 ms 692 KB Output is correct
11 Correct 3 ms 692 KB Output is correct
12 Correct 592 ms 700 KB Output is correct

Subtask #2
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 23 ms 532 KB Output is correct
6 Correct 39 ms 660 KB Output is correct
7 Correct 40 ms 660 KB Output is correct
8 Correct 20 ms 660 KB Output is correct
9 Correct 3 ms 660 KB Output is correct
10 Correct 131 ms 692 KB Output is correct
11 Correct 3 ms 692 KB Output is correct
12 Correct 592 ms 700 KB Output is correct
13 Correct 3 ms 700 KB Output is correct
14 Correct 3 ms 700 KB Output is correct
15 Execution timed out 2060 ms 700 KB Time limit exceeded
16 Halted 0 ms 0 KB -