# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
306951 | 2020-09-26T15:06:19 Z | vipghn2003 | Tents (JOI18_tents) | C++14 | 1 ms | 384 KB |
#include<bits/stdc++.h> #define int long long using namespace std; const int N=3005; const int mod=1e9+7; int n,m,dp[N][N]; main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin>>n>>m; for(int j=0;j<=m;j++) dp[0][j]=1; for(int j=0;j<=n;j++) dp[j][0]=1; for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { dp[i][j]=(dp[i-1][j]+dp[i-1][j-1]*m*4)%mod; if(j>=2) dp[i][j]=(dp[i][j]+dp[i-1][j-2]*m*(m-1)/2)%mod; if(i>=2) dp[i][j]=(dp[i][j]+dp[i-2][j-1]*m*(n-1))%mod; } } cout<<(dp[n][m]-1+mod)%mod; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Incorrect | 1 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Incorrect | 1 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |