Submission #34119

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
34119	2017-11-07 15:30:33	natsukagami	마스코트 (JOI13_mascots)	C++14	100 / 100	319 ms	108216 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 <bits/stdc++.h>
using namespace std;
const int maxn = 3005;
const int mod = 1e9 + 7;
int R, C, N;
int minX = 1e9, maxX = -1e9, minY = 1e9, maxY = -1e9;
int ft[maxn * maxn];
int bc[maxn][maxn];
int f[maxn][maxn];
int cal(int x, int y) {
  if (f[x][y]) return f[x][y];
  if (x == R && y == C) return 1;
  if (x < R)
    f[x][y] = (f[x][y] + cal(x + 1, y) * 1LL * ft[y]) % mod;
  if (y < C)
    f[x][y] = (f[x][y] + cal(x, y + 1) * 1LL * ft[x]) % mod;
  return f[x][y];
}
int main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
  cin >> R >> C;
  ft[0] = 1;
  for (int i = 1; i <= R * C; ++i) 
    ft[i] = ft[i - 1] * 1LL * i % mod;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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