oj.uz

Submission #113373

# Submission time Handle Problem Language Result Execution time Memory
113373 2019-05-25T09:07:34 Z kajebiii Boat (APIO16_boat) C++17
100 / 100
 1389 ms 14344 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][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

# Verdict Execution time Memory Grader output
1 Correct 971 ms 14092 KB Output is correct
2 Correct 977 ms 14224 KB Output is correct
3 Correct 941 ms 14200 KB Output is correct
4 Correct 929 ms 14072 KB Output is correct
5 Correct 934 ms 14072 KB Output is correct
6 Correct 729 ms 13964 KB Output is correct
7 Correct 747 ms 14112 KB Output is correct
8 Correct 744 ms 14064 KB Output is correct
9 Correct 741 ms 14240 KB Output is correct
10 Correct 749 ms 14120 KB Output is correct
11 Correct 739 ms 14072 KB Output is correct
12 Correct 739 ms 14192 KB Output is correct
13 Correct 742 ms 14076 KB Output is correct
14 Correct 726 ms 14076 KB Output is correct
15 Correct 738 ms 14088 KB Output is correct
16 Correct 165 ms 8272 KB Output is correct
17 Correct 174 ms 8440 KB Output is correct
18 Correct 175 ms 8472 KB Output is correct
19 Correct 176 ms 8536 KB Output is correct
20 Correct 171 ms 8312 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 971 ms 14092 KB Output is correct
2 Correct 977 ms 14224 KB Output is correct
3 Correct 941 ms 14200 KB Output is correct
4 Correct 929 ms 14072 KB Output is correct
5 Correct 934 ms 14072 KB Output is correct
6 Correct 729 ms 13964 KB Output is correct
7 Correct 747 ms 14112 KB Output is correct
8 Correct 744 ms 14064 KB Output is correct
9 Correct 741 ms 14240 KB Output is correct
10 Correct 749 ms 14120 KB Output is correct
11 Correct 739 ms 14072 KB Output is correct
12 Correct 739 ms 14192 KB Output is correct
13 Correct 742 ms 14076 KB Output is correct
14 Correct 726 ms 14076 KB Output is correct
15 Correct 738 ms 14088 KB Output is correct
16 Correct 165 ms 8272 KB Output is correct
17 Correct 174 ms 8440 KB Output is correct
18 Correct 175 ms 8472 KB Output is correct
19 Correct 176 ms 8536 KB Output is correct
20 Correct 171 ms 8312 KB Output is correct
21 Correct 1170 ms 13640 KB Output is correct
22 Correct 1213 ms 13888 KB Output is correct
23 Correct 1130 ms 13776 KB Output is correct
24 Correct 1131 ms 13688 KB Output is correct
25 Correct 1174 ms 13688 KB Output is correct
26 Correct 1063 ms 13540 KB Output is correct
27 Correct 1136 ms 13696 KB Output is correct
28 Correct 1140 ms 13588 KB Output is correct
29 Correct 1164 ms 13580 KB Output is correct
30 Correct 769 ms 14072 KB Output is correct
31 Correct 809 ms 14200 KB Output is correct
32 Correct 780 ms 14328 KB Output is correct
33 Correct 775 ms 14072 KB Output is correct
34 Correct 834 ms 14072 KB Output is correct
35 Correct 988 ms 14200 KB Output is correct
36 Correct 976 ms 14200 KB Output is correct
37 Correct 980 ms 14256 KB Output is correct
38 Correct 954 ms 14072 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 13 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 14 ms 2688 KB Output is correct
5 Correct 14 ms 2688 KB Output is correct
6 Correct 13 ms 2560 KB Output is correct
7 Correct 14 ms 2732 KB Output is correct
8 Correct 15 ms 2688 KB Output is correct
9 Correct 13 ms 2688 KB Output is correct
10 Correct 14 ms 2688 KB Output is correct
11 Correct 14 ms 2688 KB Output is correct
12 Correct 13 ms 2688 KB Output is correct
13 Correct 14 ms 2620 KB Output is correct
14 Correct 14 ms 2560 KB Output is correct
15 Correct 18 ms 2688 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 10 ms 2176 KB Output is correct
20 Correct 8 ms 2176 KB Output is correct

Subtask #4
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 971 ms 14092 KB Output is correct
2 Correct 977 ms 14224 KB Output is correct
3 Correct 941 ms 14200 KB Output is correct
4 Correct 929 ms 14072 KB Output is correct
5 Correct 934 ms 14072 KB Output is correct
6 Correct 729 ms 13964 KB Output is correct
7 Correct 747 ms 14112 KB Output is correct
8 Correct 744 ms 14064 KB Output is correct
9 Correct 741 ms 14240 KB Output is correct
10 Correct 749 ms 14120 KB Output is correct
11 Correct 739 ms 14072 KB Output is correct
12 Correct 739 ms 14192 KB Output is correct
13 Correct 742 ms 14076 KB Output is correct
14 Correct 726 ms 14076 KB Output is correct
15 Correct 738 ms 14088 KB Output is correct
16 Correct 165 ms 8272 KB Output is correct
17 Correct 174 ms 8440 KB Output is correct
18 Correct 175 ms 8472 KB Output is correct
19 Correct 176 ms 8536 KB Output is correct
20 Correct 171 ms 8312 KB Output is correct
21 Correct 1170 ms 13640 KB Output is correct
22 Correct 1213 ms 13888 KB Output is correct
23 Correct 1130 ms 13776 KB Output is correct
24 Correct 1131 ms 13688 KB Output is correct
25 Correct 1174 ms 13688 KB Output is correct
26 Correct 1063 ms 13540 KB Output is correct
27 Correct 1136 ms 13696 KB Output is correct
28 Correct 1140 ms 13588 KB Output is correct
29 Correct 1164 ms 13580 KB Output is correct
30 Correct 769 ms 14072 KB Output is correct
31 Correct 809 ms 14200 KB Output is correct
32 Correct 780 ms 14328 KB Output is correct
33 Correct 775 ms 14072 KB Output is correct
34 Correct 834 ms 14072 KB Output is correct
35 Correct 988 ms 14200 KB Output is correct
36 Correct 976 ms 14200 KB Output is correct
37 Correct 980 ms 14256 KB Output is correct
38 Correct 954 ms 14072 KB Output is correct
39 Correct 13 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 14 ms 2688 KB Output is correct
43 Correct 14 ms 2688 KB Output is correct
44 Correct 13 ms 2560 KB Output is correct
45 Correct 14 ms 2732 KB Output is correct
46 Correct 15 ms 2688 KB Output is correct
47 Correct 13 ms 2688 KB Output is correct
48 Correct 14 ms 2688 KB Output is correct
49 Correct 14 ms 2688 KB Output is correct
50 Correct 13 ms 2688 KB Output is correct
51 Correct 14 ms 2620 KB Output is correct
52 Correct 14 ms 2560 KB Output is correct
53 Correct 18 ms 2688 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 10 ms 2176 KB Output is correct
58 Correct 8 ms 2176 KB Output is correct
59 Correct 1274 ms 14184 KB Output is correct
60 Correct 1287 ms 14172 KB Output is correct
61 Correct 1389 ms 14144 KB Output is correct
62 Correct 1363 ms 14128 KB Output is correct
63 Correct 1368 ms 14188 KB Output is correct
64 Correct 1183 ms 14084 KB Output is correct
65 Correct 1218 ms 14140 KB Output is correct
66 Correct 1163 ms 14268 KB Output is correct
67 Correct 1182 ms 14164 KB Output is correct
68 Correct 1308 ms 14344 KB Output is correct
69 Correct 1299 ms 14164 KB Output is correct
70 Correct 1321 ms 14160 KB Output is correct
71 Correct 1349 ms 14200 KB Output is correct
72 Correct 1219 ms 14076 KB Output is correct
73 Correct 1359 ms 14264 KB Output is correct
74 Correct 237 ms 8312 KB Output is correct
75 Correct 243 ms 8440 KB Output is correct
76 Correct 244 ms 8420 KB Output is correct
77 Correct 243 ms 8440 KB Output is correct
78 Correct 237 ms 8412 KB Output is correct