Submission #12943

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
12943	2015-01-21 07:03:05	model_code	마스코트 (JOI13_mascots)	C++98	100 / 100	576 ms	235604 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>
int MOD=1000000007;
int R,C,N;
int r1,r2,c1,c2;
long long fact[12000001];
long long dp[3002][3002];
long long comb[3001][3001];
int main() {
  scanf("%d%d%d",&R,&C,&N);
  r1=R; c1=C;
  for(int i=0;i<N;i++) {
    int kr,kc;
    scanf("%d%d",&kr,&kc);
    if(r1>kr) r1=kr;
    if(r2<kr) r2=kr;
    if(c1>kc) c1=kc;
    if(c2<kc) c2=kc;
  }
  fact[0]=1;
  for(int i=1;i<12000001;i++) fact[i]=(fact[i-1]*i)%MOD;
  comb[0][0]=1;
  for(int i=1;i<3001;i++) {
    comb[i][0]=comb[i-1][0];
    for(int j=1;j<=i;j++) {
      comb[i][j]=(comb[i-1][j-1]+comb[i-1][j])%MOD;
    }
  }
  dp[0][0]=fact[(r2-r1+1)*(c2-c1+1)-N];
  for(int i=0;i<=R-(r2-r1+1);i++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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