제출 #312524

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
312524		YJU	Asceticism (JOI18_asceticism)	C++14	49 / 100	92 ms	41976 KiB

asceticism

#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=5e3+5;
const ld pi=3.14159265359;
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

ll n,m,dp[N][N];

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n>>m;
	dp[1][0]=1;
	REP1(i,n)REP(j,m+1){
		if(i==1)continue;
		dp[i][j]=(dp[i-1][j]*(j+1)+(j?dp[i-1][j-1]*(i-j):0))%MOD;
	}
	cout<<dp[n][m-1]<<"\n";
	return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 20 / 20
• Subtask 3: 25 / 25
• Subtask 4: 0 / 51