oj.uz

Submission #108409

# Submission time Handle Problem Language Result Execution time Memory
108409 2019-04-29T06:46:25 Z nxteru Boat (APIO16_boat) C++14
58 / 100
 2000 ms 12352 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 727 ms 10220 KB Output is correct
2 Correct 737 ms 10400 KB Output is correct
3 Correct 690 ms 10228 KB Output is correct
4 Correct 699 ms 10248 KB Output is correct
5 Correct 729 ms 10312 KB Output is correct
6 Correct 862 ms 10232 KB Output is correct
7 Correct 804 ms 10464 KB Output is correct
8 Correct 938 ms 10328 KB Output is correct
9 Correct 902 ms 10332 KB Output is correct
10 Correct 889 ms 10308 KB Output is correct
11 Correct 840 ms 10488 KB Output is correct
12 Correct 901 ms 10360 KB Output is correct
13 Correct 698 ms 10348 KB Output is correct
14 Correct 920 ms 10488 KB Output is correct
15 Correct 838 ms 10460 KB Output is correct
16 Correct 62 ms 3832 KB Output is correct
17 Correct 67 ms 3932 KB Output is correct
18 Correct 66 ms 3832 KB Output is correct
19 Correct 63 ms 3832 KB Output is correct
20 Correct 96 ms 3804 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 727 ms 10220 KB Output is correct
2 Correct 737 ms 10400 KB Output is correct
3 Correct 690 ms 10228 KB Output is correct
4 Correct 699 ms 10248 KB Output is correct
5 Correct 729 ms 10312 KB Output is correct
6 Correct 862 ms 10232 KB Output is correct
7 Correct 804 ms 10464 KB Output is correct
8 Correct 938 ms 10328 KB Output is correct
9 Correct 902 ms 10332 KB Output is correct
10 Correct 889 ms 10308 KB Output is correct
11 Correct 840 ms 10488 KB Output is correct
12 Correct 901 ms 10360 KB Output is correct
13 Correct 698 ms 10348 KB Output is correct
14 Correct 920 ms 10488 KB Output is correct
15 Correct 838 ms 10460 KB Output is correct
16 Correct 62 ms 3832 KB Output is correct
17 Correct 67 ms 3932 KB Output is correct
18 Correct 66 ms 3832 KB Output is correct
19 Correct 63 ms 3832 KB Output is correct
20 Correct 96 ms 3804 KB Output is correct
21 Correct 927 ms 10832 KB Output is correct
22 Correct 1067 ms 10844 KB Output is correct
23 Correct 997 ms 10616 KB Output is correct
24 Correct 807 ms 10604 KB Output is correct
25 Correct 872 ms 10592 KB Output is correct
26 Correct 1559 ms 11128 KB Output is correct
27 Correct 1370 ms 11288 KB Output is correct
28 Correct 1226 ms 11104 KB Output is correct
29 Correct 1583 ms 11208 KB Output is correct
30 Correct 1045 ms 10396 KB Output is correct
31 Correct 978 ms 10452 KB Output is correct
32 Correct 1020 ms 10360 KB Output is correct
33 Correct 865 ms 10256 KB Output is correct
34 Correct 1014 ms 10332 KB Output is correct
35 Correct 650 ms 10172 KB Output is correct
36 Correct 499 ms 10300 KB Output is correct
37 Correct 679 ms 10260 KB Output is correct
38 Correct 667 ms 10232 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 727 ms 10220 KB Output is correct
2 Correct 737 ms 10400 KB Output is correct
3 Correct 690 ms 10228 KB Output is correct
4 Correct 699 ms 10248 KB Output is correct
5 Correct 729 ms 10312 KB Output is correct
6 Correct 862 ms 10232 KB Output is correct
7 Correct 804 ms 10464 KB Output is correct
8 Correct 938 ms 10328 KB Output is correct
9 Correct 902 ms 10332 KB Output is correct
10 Correct 889 ms 10308 KB Output is correct
11 Correct 840 ms 10488 KB Output is correct
12 Correct 901 ms 10360 KB Output is correct
13 Correct 698 ms 10348 KB Output is correct
14 Correct 920 ms 10488 KB Output is correct
15 Correct 838 ms 10460 KB Output is correct
16 Correct 62 ms 3832 KB Output is correct
17 Correct 67 ms 3932 KB Output is correct
18 Correct 66 ms 3832 KB Output is correct
19 Correct 63 ms 3832 KB Output is correct
20 Correct 96 ms 3804 KB Output is correct
21 Correct 927 ms 10832 KB Output is correct
22 Correct 1067 ms 10844 KB Output is correct
23 Correct 997 ms 10616 KB Output is correct
24 Correct 807 ms 10604 KB Output is correct
25 Correct 872 ms 10592 KB Output is correct
26 Correct 1559 ms 11128 KB Output is correct
27 Correct 1370 ms 11288 KB Output is correct
28 Correct 1226 ms 11104 KB Output is correct
29 Correct 1583 ms 11208 KB Output is correct
30 Correct 1045 ms 10396 KB Output is correct
31 Correct 978 ms 10452 KB Output is correct
32 Correct 1020 ms 10360 KB Output is correct
33 Correct 865 ms 10256 KB Output is correct
34 Correct 1014 ms 10332 KB Output is correct
35 Correct 650 ms 10172 KB Output is correct
36 Correct 499 ms 10300 KB Output is correct
37 Correct 679 ms 10260 KB Output is correct
38 Correct 667 ms 10232 KB Output is correct
39 Correct 8 ms 2304 KB Output is correct
40 Correct 8 ms 2304 KB Output is correct
41 Correct 8 ms 2304 KB Output is correct
42 Correct 8 ms 2304 KB Output is correct
43 Correct 10 ms 2304 KB Output is correct
44 Correct 10 ms 2432 KB Output is correct
45 Correct 12 ms 2432 KB Output is correct
46 Correct 10 ms 2432 KB Output is correct
47 Correct 9 ms 2432 KB Output is correct
48 Correct 10 ms 2432 KB Output is correct
49 Correct 10 ms 2432 KB Output is correct
50 Correct 11 ms 2304 KB Output is correct
51 Correct 9 ms 2432 KB Output is correct
52 Correct 11 ms 2432 KB Output is correct
53 Correct 9 ms 2432 KB Output is correct
54 Correct 6 ms 1792 KB Output is correct
55 Correct 6 ms 1664 KB Output is correct
56 Correct 6 ms 1664 KB Output is correct
57 Correct 6 ms 1664 KB Output is correct
58 Correct 7 ms 1664 KB Output is correct
59 Correct 1232 ms 11448 KB Output is correct
60 Correct 1224 ms 11484 KB Output is correct
61 Correct 1227 ms 11288 KB Output is correct
62 Correct 967 ms 11292 KB Output is correct
63 Correct 1132 ms 11484 KB Output is correct
64 Correct 1873 ms 12352 KB Output is correct
65 Correct 1976 ms 12344 KB Output is correct
66 Execution timed out 2060 ms 12144 KB Time limit exceeded
67 Halted 0 ms 0 KB -