# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
892711 | box | Tents (JOI18_tents) | C++17 | 124 ms | 89104 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ar array
#define sz(v) int(std::size(v))
using i64 = long long;
const int N = 3000;
const i64 MOD = 1e9 + 7;
int h, w;
int take[N + 1][N + 1];
i64 roll[N + 1];
i64 fac[N + 1], ifac[N + 1], p4[N + 1];
i64 dp[N + 1][N + 1];
i64 inv(i64 a) {
return a == 1 ? 1 : inv(MOD % a) * (MOD - MOD / a) % MOD;
}
i64 nck(int n, int k) {
if (n < k || k < 0) return 0;
return fac[n] * ifac[k] % MOD * ifac[n - k] % MOD;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
roll[1] = 1;
for (int i = 3; i <= N; i += 2) roll[i] = roll[i - 2] * i % MOD;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |