제출 #66988

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
66988	2018-08-13 06:59:31	Diuven	Tents (JOI18_tents)	C++11	48 / 100	2076 ms	28556 KiB

tents

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <iostream>
using namespace std;
typedef long long ll;
const int MX=3010, MOD=1e9+7;
int h, w, C[MX][MX], F[2*MX], T[MX], U[2*MX];
int c(int n, int r){
  if(n<0 || r<0 || n<r) return 0;
  return C[n][r];
}
int f(int h, int w, int a){
  ll res=1;
  res=res*c(h,a)%MOD;
  res=res*c(w,2*a)%MOD;
  res=res*F[2*a]%MOD;
  res=res*T[a]%MOD;
  return res;
}
int g(int h, int w, int a){
  ll res=1;
  res=res*c(h,a)%MOD;
  res=res*c(w,a)%MOD;
  res=res*F[a]%MOD;
  res=res*U[2*a]%MOD;
  return res;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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