제출 #421582

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
421582		Kerim	Tents (JOI18_tents)	C++17	48 / 100	370 ms	221144 KiB

tents

#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;
 
typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N=303;
int dp[N][N][N],c[N];
int mod(ll x){
	return (x%INF);
}
int rec(int row,int s,int empty){
	if(!row)return 1;
	int &ret=dp[row][s][empty];
	if(~ret)return ret;
	ret=rec(row-1,s,empty);
	//N
	if(s)
		ret=mod(ret+rec(row-1,s-1,empty)*1LL*s);
	if(empty){
		//E W N
		ret=mod(ret+rec(row-1,s,empty-1)*3LL*empty);
		//S
		ret=mod(ret+rec(row-1,s+1,empty-1)*1LL*empty);
	}
	//EW
	if(empty>=2)
		ret=mod(ret+rec(row-1,s,empty-2)*1LL*c[empty]);
	return ret;
}
int main(){
    //~ freopen("file.in", "r", stdin);
    memset(dp,-1,sizeof dp);
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
		c[i]=(i*(i-1))/2;
	printf("%d\n",mod(rec(n,0,m)-1+INF));
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

tents.cpp: In function 'int main()':
tents.cpp:48:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~

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