oj.uz

Submission #108412

# Submission time Handle Problem Language Result Execution time Memory
108412 2019-04-29T06:49:41 Z nxteru Boat (APIO16_boat) C++14
58 / 100
 2000 ms 12140 KB 
#include <bits/stdc++.h>
#pragma GCC target ("avx2")
//#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
using namespace std;
typedef long long ll;
#define M 1000000007
#define PB push_back
ll n,a[505],b[505],dp[505][1005],s[1005][505],f[505],ans,r[1005][505],l[505];
vector<ll>cm;
int main(void){
    scanf("%lld",&n);
    f[1]=1;
    for(int i=2;i<n;i++)f[i]=M-(M/i)*f[M%i]%M;
    for(int i=0;i<n;i++){
		scanf("%lld%lld",a+i,b+i);
		a[i]--;
		cm.PB(a[i]);
		cm.PB(b[i]);
	}
	sort(cm.begin(),cm.end());
	cm.erase(unique(cm.begin(),cm.end()),cm.end());
	for(int i=0;i<n;i++){
		a[i]=lower_bound(cm.begin(),cm.end(),a[i])-cm.begin();
		b[i]=lower_bound(cm.begin(),cm.end(),b[i])-cm.begin();
	}
	for(int i=n-1;i>=0;i--){
		for(int j=1;j<cm.size();j++){
			if(a[i]<j&&j<=b[i])r[j][i]++;
			r[j][i]+=r[j][i+1];
		}
	}
	for(int i=1;i<cm.size();i++){
		ll p=cm[i]-cm[i-1];
		s[i][0]=1;
		for(ll j=1;j<n;j++){
			s[i][j]=s[i][j-1]*(p+j-1LL)%M*f[j]%M;
		}
	}
	for(int i=0;i<n;i++){
		ll p=1;
		for(int j=1;j<=b[i];j++){
			if(j>a[i]){
				dp[i][j]=p;
				ans=(ans+p*s[j][r[j][i]]%M)%M;
			}
			for(int k=0;k<i;k++)p=(p+dp[k][j]*s[j][r[j][k]-r[j][i]]%M)%M;
		}
	}
	printf("%lld\n",ans);
}

Compilation message

boat.cpp: In function 'int main()':
boat.cpp:28:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j=1;j<cm.size();j++){
               ~^~~~~~~~~~
boat.cpp:33:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1;i<cm.size();i++){
              ~^~~~~~~~~~
boat.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld",&n);
     ~~~~~^~~~~~~~~~~
boat.cpp:16:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld",a+i,b+i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 684 ms 10280 KB Output is correct
2 Correct 654 ms 10216 KB Output is correct
3 Correct 627 ms 10232 KB Output is correct
4 Correct 568 ms 10204 KB Output is correct
5 Correct 651 ms 10408 KB Output is correct
6 Correct 628 ms 10488 KB Output is correct
7 Correct 651 ms 10360 KB Output is correct
8 Correct 588 ms 10244 KB Output is correct
9 Correct 713 ms 10360 KB Output is correct
10 Correct 951 ms 10360 KB Output is correct
11 Correct 1012 ms 10180 KB Output is correct
12 Correct 790 ms 10416 KB Output is correct
13 Correct 765 ms 10336 KB Output is correct
14 Correct 888 ms 10496 KB Output is correct
15 Correct 962 ms 10460 KB Output is correct
16 Correct 73 ms 3764 KB Output is correct
17 Correct 70 ms 3832 KB Output is correct
18 Correct 64 ms 3832 KB Output is correct
19 Correct 69 ms 3928 KB Output is correct
20 Correct 85 ms 3832 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 684 ms 10280 KB Output is correct
2 Correct 654 ms 10216 KB Output is correct
3 Correct 627 ms 10232 KB Output is correct
4 Correct 568 ms 10204 KB Output is correct
5 Correct 651 ms 10408 KB Output is correct
6 Correct 628 ms 10488 KB Output is correct
7 Correct 651 ms 10360 KB Output is correct
8 Correct 588 ms 10244 KB Output is correct
9 Correct 713 ms 10360 KB Output is correct
10 Correct 951 ms 10360 KB Output is correct
11 Correct 1012 ms 10180 KB Output is correct
12 Correct 790 ms 10416 KB Output is correct
13 Correct 765 ms 10336 KB Output is correct
14 Correct 888 ms 10496 KB Output is correct
15 Correct 962 ms 10460 KB Output is correct
16 Correct 73 ms 3764 KB Output is correct
17 Correct 70 ms 3832 KB Output is correct
18 Correct 64 ms 3832 KB Output is correct
19 Correct 69 ms 3928 KB Output is correct
20 Correct 85 ms 3832 KB Output is correct
21 Correct 1133 ms 10700 KB Output is correct
22 Correct 1184 ms 10716 KB Output is correct
23 Correct 1211 ms 10716 KB Output is correct
24 Correct 1369 ms 10624 KB Output is correct
25 Correct 1126 ms 10712 KB Output is correct
26 Correct 1585 ms 11188 KB Output is correct
27 Correct 1168 ms 11204 KB Output is correct
28 Correct 1328 ms 11060 KB Output is correct
29 Correct 1058 ms 11028 KB Output is correct
30 Correct 891 ms 10300 KB Output is correct
31 Correct 734 ms 10552 KB Output is correct
32 Correct 718 ms 10360 KB Output is correct
33 Correct 994 ms 10376 KB Output is correct
34 Correct 890 ms 10292 KB Output is correct
35 Correct 749 ms 10316 KB Output is correct
36 Correct 699 ms 10288 KB Output is correct
37 Correct 655 ms 10168 KB Output is correct
38 Correct 686 ms 10104 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 2432 KB Output is correct
2 Correct 9 ms 2404 KB Output is correct
3 Correct 11 ms 2304 KB Output is correct
4 Correct 9 ms 2304 KB Output is correct
5 Correct 10 ms 2432 KB Output is correct
6 Correct 10 ms 2432 KB Output is correct
7 Correct 9 ms 2432 KB Output is correct
8 Correct 10 ms 2432 KB Output is correct
9 Correct 10 ms 2432 KB Output is correct
10 Correct 11 ms 2432 KB Output is correct
11 Correct 9 ms 2432 KB Output is correct
12 Correct 9 ms 2304 KB Output is correct
13 Correct 9 ms 2432 KB Output is correct
14 Correct 9 ms 2304 KB Output is correct
15 Correct 10 ms 2432 KB Output is correct
16 Correct 6 ms 1664 KB Output is correct
17 Correct 6 ms 1664 KB Output is correct
18 Correct 7 ms 1664 KB Output is correct
19 Correct 7 ms 1664 KB Output is correct
20 Correct 6 ms 1664 KB Output is correct

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 684 ms 10280 KB Output is correct
2 Correct 654 ms 10216 KB Output is correct
3 Correct 627 ms 10232 KB Output is correct
4 Correct 568 ms 10204 KB Output is correct
5 Correct 651 ms 10408 KB Output is correct
6 Correct 628 ms 10488 KB Output is correct
7 Correct 651 ms 10360 KB Output is correct
8 Correct 588 ms 10244 KB Output is correct
9 Correct 713 ms 10360 KB Output is correct
10 Correct 951 ms 10360 KB Output is correct
11 Correct 1012 ms 10180 KB Output is correct
12 Correct 790 ms 10416 KB Output is correct
13 Correct 765 ms 10336 KB Output is correct
14 Correct 888 ms 10496 KB Output is correct
15 Correct 962 ms 10460 KB Output is correct
16 Correct 73 ms 3764 KB Output is correct
17 Correct 70 ms 3832 KB Output is correct
18 Correct 64 ms 3832 KB Output is correct
19 Correct 69 ms 3928 KB Output is correct
20 Correct 85 ms 3832 KB Output is correct
21 Correct 1133 ms 10700 KB Output is correct
22 Correct 1184 ms 10716 KB Output is correct
23 Correct 1211 ms 10716 KB Output is correct
24 Correct 1369 ms 10624 KB Output is correct
25 Correct 1126 ms 10712 KB Output is correct
26 Correct 1585 ms 11188 KB Output is correct
27 Correct 1168 ms 11204 KB Output is correct
28 Correct 1328 ms 11060 KB Output is correct
29 Correct 1058 ms 11028 KB Output is correct
30 Correct 891 ms 10300 KB Output is correct
31 Correct 734 ms 10552 KB Output is correct
32 Correct 718 ms 10360 KB Output is correct
33 Correct 994 ms 10376 KB Output is correct
34 Correct 890 ms 10292 KB Output is correct
35 Correct 749 ms 10316 KB Output is correct
36 Correct 699 ms 10288 KB Output is correct
37 Correct 655 ms 10168 KB Output is correct
38 Correct 686 ms 10104 KB Output is correct
39 Correct 9 ms 2432 KB Output is correct
40 Correct 9 ms 2404 KB Output is correct
41 Correct 11 ms 2304 KB Output is correct
42 Correct 9 ms 2304 KB Output is correct
43 Correct 10 ms 2432 KB Output is correct
44 Correct 10 ms 2432 KB Output is correct
45 Correct 9 ms 2432 KB Output is correct
46 Correct 10 ms 2432 KB Output is correct
47 Correct 10 ms 2432 KB Output is correct
48 Correct 11 ms 2432 KB Output is correct
49 Correct 9 ms 2432 KB Output is correct
50 Correct 9 ms 2304 KB Output is correct
51 Correct 9 ms 2432 KB Output is correct
52 Correct 9 ms 2304 KB Output is correct
53 Correct 10 ms 2432 KB Output is correct
54 Correct 6 ms 1664 KB Output is correct
55 Correct 6 ms 1664 KB Output is correct
56 Correct 7 ms 1664 KB Output is correct
57 Correct 7 ms 1664 KB Output is correct
58 Correct 6 ms 1664 KB Output is correct
59 Correct 1318 ms 11420 KB Output is correct
60 Correct 1046 ms 11292 KB Output is correct
61 Correct 1272 ms 11380 KB Output is correct
62 Correct 1270 ms 11488 KB Output is correct
63 Correct 1487 ms 11288 KB Output is correct
64 Correct 1812 ms 12140 KB Output is correct
65 Execution timed out 2054 ms 12140 KB Time limit exceeded
66 Halted 0 ms 0 KB -