oj.uz

Submission #793423

# Submission time Handle Problem Language Result Execution time Memory
793423 2023-07-25T20:05:48 Z IvanJ Boat (APIO16_boat) C++17
100 / 100
 443 ms 4324 KB 
#include<bits/stdc++.h>

#define pb push_back
#define x first
#define y second
#define all(a) (a).begin(), (a).end()

using namespace std;

typedef long long ll;
typedef pair<int, int> ii;

const int maxn = 1005;
const int MOD = 1e9 + 7;

int mult(ll a, ll b) {return (a * b) % MOD;}
int pot(int n, int k) {
	int ret = 1, pot = n;
	for(;k > 0;k >>= 1, pot = mult(pot, pot)) 
		if(k & 1) ret = mult(ret, pot);
	return ret;
}
int divide(int a, int b) {return mult(a, pot(b, MOD - 2));}
int add(int a, int b) {a += b;if(a >= MOD) a -= MOD;return a;}
int sub(int a, int b) {a -= b;if(a < 0) a += MOD;return a;}

int n, m;
int a[maxn], b[maxn];
int len[maxn], inv[maxn];
int dp[maxn][maxn];
vector<int> v;

int main() {
	scanf("%d", &n);
	for(int i = 1;i <= n;i++) 
		scanf("%d%d", a + i, b + i), b[i]++;
	
	for(int i = 1;i <= n;i++) 
		inv[i] = divide(1, i);

	for(int i = 1;i <= n;i++)
		v.pb(a[i]), v.pb(b[i]);
	sort(v.begin(), v.end());
	v.resize(unique(all(v)) - v.begin());
    
	for(int i = 1;i <= n;i++) {
		a[i] = lower_bound(all(v), a[i]) - v.begin() + 1;
		b[i] = lower_bound(all(v), b[i]) - v.begin() + 1;
	}
    
	m = (int)v.size() - 1;
	for(int i = 1;i <= m;i++) 
		len[i] = v[i] - v[i - 1];

	dp[0][0] = 1;
	for(int i = 1;i <= m;i++){
		dp[i][0] = 1;
		for(int j = 1;j <= n;j++){
			ll to_mul = len[i];
			int cnt = 1;
			dp[i][j] = dp[i - 1][j];
			if(i < a[j] || i >= b[j]) continue;
			
			for(int k = j - 1;k >= 0;k--) {
				dp[i][j] = add(dp[i][j], mult(dp[i - 1][k], to_mul));
				if(a[k] <= i && i < b[k]) {
					to_mul = mult(mult(to_mul, add(cnt, len[i])), inv[cnt + 1]);
					cnt++;
				}
			}
		}
	}
	int ans = 0;
	for(int i = 1;i <= n;i++) 
		ans = add(ans, dp[m][i]);
	printf("%d\n", ans);
	return 0;
}

Compilation message

boat.cpp: In function 'int main()':
boat.cpp:34:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
boat.cpp:36:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |   scanf("%d%d", a + i, b + i), b[i]++;
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4180 KB Output is correct
2 Correct 3 ms 4144 KB Output is correct
3 Correct 3 ms 4180 KB Output is correct
4 Correct 3 ms 4180 KB Output is correct
5 Correct 3 ms 4180 KB Output is correct
6 Correct 3 ms 4232 KB Output is correct
7 Correct 3 ms 4180 KB Output is correct
8 Correct 3 ms 4180 KB Output is correct
9 Correct 3 ms 4180 KB Output is correct
10 Correct 3 ms 4180 KB Output is correct
11 Correct 3 ms 4180 KB Output is correct
12 Correct 3 ms 4180 KB Output is correct
13 Correct 3 ms 4180 KB Output is correct
14 Correct 3 ms 4180 KB Output is correct
15 Correct 3 ms 4180 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 1 ms 980 KB Output is correct
18 Correct 1 ms 1024 KB Output is correct
19 Correct 1 ms 1020 KB Output is correct
20 Correct 1 ms 980 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4180 KB Output is correct
2 Correct 3 ms 4144 KB Output is correct
3 Correct 3 ms 4180 KB Output is correct
4 Correct 3 ms 4180 KB Output is correct
5 Correct 3 ms 4180 KB Output is correct
6 Correct 3 ms 4232 KB Output is correct
7 Correct 3 ms 4180 KB Output is correct
8 Correct 3 ms 4180 KB Output is correct
9 Correct 3 ms 4180 KB Output is correct
10 Correct 3 ms 4180 KB Output is correct
11 Correct 3 ms 4180 KB Output is correct
12 Correct 3 ms 4180 KB Output is correct
13 Correct 3 ms 4180 KB Output is correct
14 Correct 3 ms 4180 KB Output is correct
15 Correct 3 ms 4180 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 1 ms 980 KB Output is correct
18 Correct 1 ms 1024 KB Output is correct
19 Correct 1 ms 1020 KB Output is correct
20 Correct 1 ms 980 KB Output is correct
21 Correct 207 ms 3844 KB Output is correct
22 Correct 203 ms 3912 KB Output is correct
23 Correct 177 ms 3856 KB Output is correct
24 Correct 217 ms 3760 KB Output is correct
25 Correct 196 ms 3788 KB Output is correct
26 Correct 382 ms 3660 KB Output is correct
27 Correct 393 ms 3832 KB Output is correct
28 Correct 385 ms 3712 KB Output is correct
29 Correct 378 ms 3736 KB Output is correct
30 Correct 4 ms 4180 KB Output is correct
31 Correct 4 ms 4156 KB Output is correct
32 Correct 4 ms 4180 KB Output is correct
33 Correct 3 ms 4180 KB Output is correct
34 Correct 3 ms 4180 KB Output is correct
35 Correct 4 ms 4180 KB Output is correct
36 Correct 4 ms 4180 KB Output is correct
37 Correct 4 ms 4180 KB Output is correct
38 Correct 4 ms 4180 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1108 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 2 ms 1108 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 3 ms 1108 KB Output is correct
6 Correct 4 ms 1108 KB Output is correct
7 Correct 4 ms 1048 KB Output is correct
8 Correct 4 ms 1108 KB Output is correct
9 Correct 4 ms 1108 KB Output is correct
10 Correct 4 ms 1108 KB Output is correct
11 Correct 3 ms 1108 KB Output is correct
12 Correct 2 ms 1108 KB Output is correct
13 Correct 2 ms 1108 KB Output is correct
14 Correct 2 ms 1108 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
16 Correct 2 ms 724 KB Output is correct
17 Correct 1 ms 724 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Correct 1 ms 744 KB Output is correct
20 Correct 2 ms 724 KB Output is correct

Subtask #4
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4180 KB Output is correct
2 Correct 3 ms 4144 KB Output is correct
3 Correct 3 ms 4180 KB Output is correct
4 Correct 3 ms 4180 KB Output is correct
5 Correct 3 ms 4180 KB Output is correct
6 Correct 3 ms 4232 KB Output is correct
7 Correct 3 ms 4180 KB Output is correct
8 Correct 3 ms 4180 KB Output is correct
9 Correct 3 ms 4180 KB Output is correct
10 Correct 3 ms 4180 KB Output is correct
11 Correct 3 ms 4180 KB Output is correct
12 Correct 3 ms 4180 KB Output is correct
13 Correct 3 ms 4180 KB Output is correct
14 Correct 3 ms 4180 KB Output is correct
15 Correct 3 ms 4180 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 1 ms 980 KB Output is correct
18 Correct 1 ms 1024 KB Output is correct
19 Correct 1 ms 1020 KB Output is correct
20 Correct 1 ms 980 KB Output is correct
21 Correct 207 ms 3844 KB Output is correct
22 Correct 203 ms 3912 KB Output is correct
23 Correct 177 ms 3856 KB Output is correct
24 Correct 217 ms 3760 KB Output is correct
25 Correct 196 ms 3788 KB Output is correct
26 Correct 382 ms 3660 KB Output is correct
27 Correct 393 ms 3832 KB Output is correct
28 Correct 385 ms 3712 KB Output is correct
29 Correct 378 ms 3736 KB Output is correct
30 Correct 4 ms 4180 KB Output is correct
31 Correct 4 ms 4156 KB Output is correct
32 Correct 4 ms 4180 KB Output is correct
33 Correct 3 ms 4180 KB Output is correct
34 Correct 3 ms 4180 KB Output is correct
35 Correct 4 ms 4180 KB Output is correct
36 Correct 4 ms 4180 KB Output is correct
37 Correct 4 ms 4180 KB Output is correct
38 Correct 4 ms 4180 KB Output is correct
39 Correct 2 ms 1108 KB Output is correct
40 Correct 2 ms 1108 KB Output is correct
41 Correct 2 ms 1108 KB Output is correct
42 Correct 2 ms 980 KB Output is correct
43 Correct 3 ms 1108 KB Output is correct
44 Correct 4 ms 1108 KB Output is correct
45 Correct 4 ms 1048 KB Output is correct
46 Correct 4 ms 1108 KB Output is correct
47 Correct 4 ms 1108 KB Output is correct
48 Correct 4 ms 1108 KB Output is correct
49 Correct 3 ms 1108 KB Output is correct
50 Correct 2 ms 1108 KB Output is correct
51 Correct 2 ms 1108 KB Output is correct
52 Correct 2 ms 1108 KB Output is correct
53 Correct 2 ms 1108 KB Output is correct
54 Correct 2 ms 724 KB Output is correct
55 Correct 1 ms 724 KB Output is correct
56 Correct 2 ms 724 KB Output is correct
57 Correct 1 ms 744 KB Output is correct
58 Correct 2 ms 724 KB Output is correct
59 Correct 221 ms 4232 KB Output is correct
60 Correct 204 ms 4144 KB Output is correct
61 Correct 198 ms 4256 KB Output is correct
62 Correct 223 ms 4144 KB Output is correct
63 Correct 214 ms 4160 KB Output is correct
64 Correct 440 ms 4268 KB Output is correct
65 Correct 440 ms 4148 KB Output is correct
66 Correct 442 ms 4240 KB Output is correct
67 Correct 443 ms 4232 KB Output is correct
68 Correct 439 ms 4132 KB Output is correct
69 Correct 179 ms 4156 KB Output is correct
70 Correct 185 ms 4324 KB Output is correct
71 Correct 180 ms 4232 KB Output is correct
72 Correct 188 ms 4180 KB Output is correct
73 Correct 190 ms 4152 KB Output is correct
74 Correct 44 ms 916 KB Output is correct
75 Correct 41 ms 972 KB Output is correct
76 Correct 43 ms 972 KB Output is correct
77 Correct 43 ms 936 KB Output is correct
78 Correct 45 ms 992 KB Output is correct