oj.uz

답안 #113366

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
113366 2019-05-25T08:51:49 Z kajebiii Boat (APIO16_boat) C++17
58 / 100
 1411 ms 14348 KB 
#include<stdio.h>
#include<algorithm>
 
using namespace std;
 
#define MAXN 500
#define MOD 1000000007
 
long long inv[MAXN+1];
long long iCj[MAXN][MAXN], diCj[2*MAXN-1][MAXN+1];
long long g[MAXN][2*MAXN];
long long dp[MAXN+1][2*MAXN];
 
int main(){
	int N;
	int a[MAXN+1], b[MAXN+1];
	int c[2*MAXN], cn=1;
	int d[2*MAXN];
 
	scanf("%d", &N);
	for(int i=1; i<=N; i++) scanf("%d%d", a+i, b+i);
 
	for(int i=1; i<=N; i++){
		c[i*2-2]=a[i]-1;
		c[i*2-1]=b[i];
	}
	sort(c, c+2*N);
	for(int i=1; i<2*N; i++) if(c[i]!=c[i-1]) c[cn++]=c[i];
	for(int i=1; i<cn; i++) d[i]=c[i]-c[i-1];
 
	for(int i=1; i<=MAXN; i++){
		inv[i]=1;
		long long p=i;
		for(int j=0; (1<<j)<=MOD-2; j++){
			if(((MOD-2)&(1<<j))!=0) inv[i]=inv[i]*p%MOD;
			p=p*p%MOD;
		}
	}
	for(int i=0; i<N; i++) iCj[i][0]=1;
	for(int i=1; i<N; i++) for(int j=1; j<=i; j++) iCj[i][j]=(iCj[i-1][j-1]+iCj[i-1][j])%MOD;
	for(int i=1; i<cn; i++){
		diCj[i][0]=1;
		for(int j=1; j<=d[i]&&j<=N; j++){
			diCj[i][j]=diCj[i][j-1]*(d[i]-j+1)%MOD*inv[j]%MOD;
			//printf("%lld ", diCj[i][j]);
		}
		//printf("\n");
	}
	for(int i=0; i<N; i++) for(int j=1; j<cn; j++){
		g[i][j]=0;
		for(int k=0; k<=i; k++)
			g[i][j]=(g[i][j]+iCj[i][k]*diCj[j][k+1]%MOD)%MOD;
	}
 
	/*
	for(int i=0; i<N; i++){
		for(int j=1; j<cn; j++) printf("%lld ", g[i][j]);
		printf("\n");
	}
	*/
 
	for(int i=0; i<cn; i++) dp[0][i]=1;
	for(int i=1; i<=N; i++) dp[i][0]=1;
	for(int i=1; i<=N; i++) for(int j=1; j<cn; j++){
		dp[i][j]=dp[i][j-1];
		int f=0;
		for(int k=i; k>0; k--) if(a[k]<=c[j-1]+1&&c[j]<=b[k]){
			//printf("%lld{%d} ", dp[i][j], f);
			dp[i][j]=(dp[i][j]+g[f++][j]*dp[k-1][j-1]%MOD)%MOD;
		}
		//printf("(%d %d %lld)\n", i, j, dp[i][j]);
	}
 
	printf("%lld", (dp[N][cn-1]-1+MOD)%MOD);
	return 0;
}

Compilation message

boat.cpp: In function 'int main()':
boat.cpp:20:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
boat.cpp:21:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1; i<=N; i++) scanf("%d%d", a+i, b+i);
                          ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 928 ms 14264 KB Output is correct
2 Correct 937 ms 14024 KB Output is correct
3 Correct 971 ms 14348 KB Output is correct
4 Correct 1016 ms 14224 KB Output is correct
5 Correct 971 ms 14072 KB Output is correct
6 Correct 786 ms 14072 KB Output is correct
7 Correct 755 ms 14168 KB Output is correct
8 Correct 767 ms 13992 KB Output is correct
9 Correct 747 ms 14072 KB Output is correct
10 Correct 722 ms 14032 KB Output is correct
11 Correct 722 ms 14072 KB Output is correct
12 Correct 731 ms 14024 KB Output is correct
13 Correct 738 ms 14204 KB Output is correct
14 Correct 837 ms 14104 KB Output is correct
15 Correct 779 ms 14092 KB Output is correct
16 Correct 171 ms 8440 KB Output is correct
17 Correct 180 ms 8568 KB Output is correct
18 Correct 178 ms 8312 KB Output is correct
19 Correct 183 ms 8540 KB Output is correct
20 Correct 177 ms 8312 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 928 ms 14264 KB Output is correct
2 Correct 937 ms 14024 KB Output is correct
3 Correct 971 ms 14348 KB Output is correct
4 Correct 1016 ms 14224 KB Output is correct
5 Correct 971 ms 14072 KB Output is correct
6 Correct 786 ms 14072 KB Output is correct
7 Correct 755 ms 14168 KB Output is correct
8 Correct 767 ms 13992 KB Output is correct
9 Correct 747 ms 14072 KB Output is correct
10 Correct 722 ms 14032 KB Output is correct
11 Correct 722 ms 14072 KB Output is correct
12 Correct 731 ms 14024 KB Output is correct
13 Correct 738 ms 14204 KB Output is correct
14 Correct 837 ms 14104 KB Output is correct
15 Correct 779 ms 14092 KB Output is correct
16 Correct 171 ms 8440 KB Output is correct
17 Correct 180 ms 8568 KB Output is correct
18 Correct 178 ms 8312 KB Output is correct
19 Correct 183 ms 8540 KB Output is correct
20 Correct 177 ms 8312 KB Output is correct
21 Correct 1206 ms 13780 KB Output is correct
22 Correct 1135 ms 13816 KB Output is correct
23 Correct 1117 ms 13800 KB Output is correct
24 Correct 1116 ms 13788 KB Output is correct
25 Correct 1259 ms 13880 KB Output is correct
26 Correct 1028 ms 13824 KB Output is correct
27 Correct 1057 ms 13688 KB Output is correct
28 Correct 1169 ms 13560 KB Output is correct
29 Correct 1137 ms 13688 KB Output is correct
30 Correct 772 ms 14200 KB Output is correct
31 Correct 757 ms 14040 KB Output is correct
32 Correct 792 ms 14192 KB Output is correct
33 Correct 753 ms 14124 KB Output is correct
34 Correct 756 ms 14072 KB Output is correct
35 Correct 953 ms 14296 KB Output is correct
36 Correct 1061 ms 14072 KB Output is correct
37 Correct 989 ms 14112 KB Output is correct
38 Correct 977 ms 14072 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 2688 KB Output is correct
2 Correct 13 ms 2560 KB Output is correct
3 Correct 13 ms 2688 KB Output is correct
4 Correct 13 ms 2688 KB Output is correct
5 Correct 13 ms 2688 KB Output is correct
6 Correct 13 ms 2688 KB Output is correct
7 Correct 14 ms 2560 KB Output is correct
8 Correct 13 ms 2560 KB Output is correct
9 Correct 13 ms 2560 KB Output is correct
10 Correct 13 ms 2688 KB Output is correct
11 Correct 13 ms 2688 KB Output is correct
12 Correct 14 ms 2636 KB Output is correct
13 Correct 13 ms 2560 KB Output is correct
14 Correct 13 ms 2688 KB Output is correct
15 Correct 13 ms 2656 KB Output is correct
16 Correct 9 ms 2176 KB Output is correct
17 Correct 9 ms 2176 KB Output is correct
18 Correct 9 ms 2176 KB Output is correct
19 Correct 9 ms 2176 KB Output is correct
20 Correct 9 ms 2176 KB Output is correct

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 928 ms 14264 KB Output is correct
2 Correct 937 ms 14024 KB Output is correct
3 Correct 971 ms 14348 KB Output is correct
4 Correct 1016 ms 14224 KB Output is correct
5 Correct 971 ms 14072 KB Output is correct
6 Correct 786 ms 14072 KB Output is correct
7 Correct 755 ms 14168 KB Output is correct
8 Correct 767 ms 13992 KB Output is correct
9 Correct 747 ms 14072 KB Output is correct
10 Correct 722 ms 14032 KB Output is correct
11 Correct 722 ms 14072 KB Output is correct
12 Correct 731 ms 14024 KB Output is correct
13 Correct 738 ms 14204 KB Output is correct
14 Correct 837 ms 14104 KB Output is correct
15 Correct 779 ms 14092 KB Output is correct
16 Correct 171 ms 8440 KB Output is correct
17 Correct 180 ms 8568 KB Output is correct
18 Correct 178 ms 8312 KB Output is correct
19 Correct 183 ms 8540 KB Output is correct
20 Correct 177 ms 8312 KB Output is correct
21 Correct 1206 ms 13780 KB Output is correct
22 Correct 1135 ms 13816 KB Output is correct
23 Correct 1117 ms 13800 KB Output is correct
24 Correct 1116 ms 13788 KB Output is correct
25 Correct 1259 ms 13880 KB Output is correct
26 Correct 1028 ms 13824 KB Output is correct
27 Correct 1057 ms 13688 KB Output is correct
28 Correct 1169 ms 13560 KB Output is correct
29 Correct 1137 ms 13688 KB Output is correct
30 Correct 772 ms 14200 KB Output is correct
31 Correct 757 ms 14040 KB Output is correct
32 Correct 792 ms 14192 KB Output is correct
33 Correct 753 ms 14124 KB Output is correct
34 Correct 756 ms 14072 KB Output is correct
35 Correct 953 ms 14296 KB Output is correct
36 Correct 1061 ms 14072 KB Output is correct
37 Correct 989 ms 14112 KB Output is correct
38 Correct 977 ms 14072 KB Output is correct
39 Correct 14 ms 2688 KB Output is correct
40 Correct 13 ms 2560 KB Output is correct
41 Correct 13 ms 2688 KB Output is correct
42 Correct 13 ms 2688 KB Output is correct
43 Correct 13 ms 2688 KB Output is correct
44 Correct 13 ms 2688 KB Output is correct
45 Correct 14 ms 2560 KB Output is correct
46 Correct 13 ms 2560 KB Output is correct
47 Correct 13 ms 2560 KB Output is correct
48 Correct 13 ms 2688 KB Output is correct
49 Correct 13 ms 2688 KB Output is correct
50 Correct 14 ms 2636 KB Output is correct
51 Correct 13 ms 2560 KB Output is correct
52 Correct 13 ms 2688 KB Output is correct
53 Correct 13 ms 2656 KB Output is correct
54 Correct 9 ms 2176 KB Output is correct
55 Correct 9 ms 2176 KB Output is correct
56 Correct 9 ms 2176 KB Output is correct
57 Correct 9 ms 2176 KB Output is correct
58 Correct 9 ms 2176 KB Output is correct
59 Incorrect 1411 ms 14228 KB Output isn't correct
60 Halted 0 ms 0 KB -