Submission #339145

#	Time	Username	Problem	Language	Result	Execution time	Memory
339145		alishahali1382	Tents (JOI18_tents)	C++14	100 / 100	116 ms	71020 KiB

tents

#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod=1000000007;
const int MAXN=3010, LOG=20;

int n, m, k, u, v, x, y, t, a, b, ans;
ll dp[MAXN][MAXN];

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>m;
	for (int i=0; i<MAXN; i++) dp[i][0]=dp[0][i]=1;
	for (int i=1; i<=n; i++){
		for (int j=1; j<=m; j++){
			dp[i][j]=(dp[i-1][j] + 4*j*dp[i-1][j-1])%mod;
			if (j>1) dp[i][j]=(dp[i][j] + dp[i-1][j-2]*j*(j-1)/2)%mod;
			if (i>1) dp[i][j]=(dp[i][j] + dp[i-2][j-1]*j*(i-1))%mod;
		}
	}
	cout<<dp[n][m]-1<<"\n";
	
	return 0;
}

• Subtask 1: 48 / 48
• Subtask 2: 52 / 52