# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1034104 | anHiep | Tents (JOI18_tents) | C++14 | 1 ms | 348 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;
const int mod = 1e9 + 7;
int dp[3003][3003];
int dv;
int bp(int a, int b){
if(b == 0) return 1;
if(b == 1) return a;
int k = bp(a, b/2);
k = (k * k) % mod;
if(b % 2 == 0) return k;
return (a * k) % mod;
}
int cal(int i, int j){
if(i < 0 || j < 0) return 0;
if(dp[i][j] != 0) return dp[i][j];
int ans = 0;
ans = (ans + cal(i - 1, j)) % mod;
ans = (ans + cal(i - 1, j - 2) * j % mod * (j - 1) % mod * dv % mod);
ans = (ans + cal(i - 2, j - 1) * j % mod * (j - 1) % mod);
ans = (ans + cal(i - 1, j - 1) * j % mod * 4 % mod);
return dp[i][j] = ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |