Submission #12968

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
12968	2015-01-22 10:13:08	gs14004	마스코트 (JOI13_mascots)	C++98	100 / 100	524 ms	107012 KiB

mascots

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 <cstdio>
#include <algorithm>
using namespace std;
int fact[9000005];
int dp[3005][3005];
int bino[3005][3005];
const int mod = 1e9 + 7;
int r,c,n;
int lx = 1e9, ly = 1e9, rx = -1, ry = -1;
int C(int x, int y){
    if(y == 0 || x == y) return 1;
    if(bino[x][y]) return bino[x][y];
    return bino[x][y] = (C(x-1,y-1) + C(x-1,y))%mod;
}
int f(int x, int y){
    if(x > r || y > c) return 0;
    if(x == r && y == c) return 1;
    if(dp[x][y]) return dp[x][y];
    long long t = 1ll * f(x,y+1) * fact[x] + 1ll * f(x+1,y) * fact[y];
    t %= mod;
    return dp[x][y] = t;
}
int main(){
    scanf("%d %d",&r,&c);
    fact[0] = 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 30 / 30
• Subtask 3: 60 / 60