답안 #25201 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
25201	2017-06-20T18:18:31 Z	gabrielsimoes	Boat (APIO16_boat)	C++14	100 / 100	179 ms	2048 KB

boat

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll MOD = 1000000007;
const int MAXN = 501;
const int MAX = 1e6+10;

#define mod(a, b) (((a)*(b)) % MOD)

ll invpow(ll a, ll b = MOD-2) {
	ll ret = 1;
	ll prod = a;
	for (int i = 0; i <= 30; i++) {
		if ((1LL << i) & b)
			ret = (ret * prod) % MOD;
		prod = (prod*prod) % MOD;
	}
	return ret;
}		

int n;
ll a[MAXN], b[MAXN];
vector<ll> v;

ll inv[MAXN], c[MAXN];
ll dp[MAXN], sum[MAXN];

int main()
{
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%lld %lld", &a[i], &b[i]);
		b[i]++;
		v.push_back(a[i]);
		v.push_back(b[i]);
	}
	
	sort(v.begin(), v.end());
	v.resize(unique(v.begin(), v.end()) - v.begin());
	
	for (int i = 1; i <= n; i++)
		inv[i] = invpow(i);
	
	for (int i = 0; i < n; i++) {
		a[i] = lower_bound(v.begin(), v.end(), a[i]) - v.begin();
		b[i] = lower_bound(v.begin(), v.end(), b[i]) - v.begin();
	}

	for (int region = 1; region < v.size(); region++) {
		ll L = v[region] - v[region-1];
			
		c[0] = 1;
		for (int i = 1; i <= n; i++)
			c[i] = mod(mod(L + i - 2, inv[i]), c[i-1]);
		c[1] = L;
			
		sum[0] = 1;
		for (int i = 1; i <= n; i++)
			sum[i] = (dp[i-1] + sum[i-1]) % MOD;
		
		for (int i = n-1; i >= 0; i--) {
			if (region <= a[i] || region > b[i]) continue;
			for (int k = i, cnt = 0; k >= 0; k--) {
				if (region <= a[k] || region > b[k]) continue;
				dp[i] += mod(c[++cnt], sum[k]);
			}
			
			dp[i] %= MOD;
		}
	}
	
	ll ans = 0;
	for (int i = 0; i < n; i++)
		ans += dp[i];
	printf("%lld\n", ans % MOD);
}

Compilation message

boat.cpp: In function 'int main()':
boat.cpp:50:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int region = 1; region < v.size(); region++) {
                              ^
boat.cpp:31:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
boat.cpp:33:35: 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

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

Subtask #2
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	2048 KB	Output is correct
2	Correct	9 ms	2048 KB	Output is correct
3	Correct	9 ms	2048 KB	Output is correct
4	Correct	9 ms	2048 KB	Output is correct
5	Correct	9 ms	2048 KB	Output is correct
6	Correct	9 ms	2048 KB	Output is correct
7	Correct	6 ms	2048 KB	Output is correct
8	Correct	9 ms	2048 KB	Output is correct
9	Correct	6 ms	2048 KB	Output is correct
10	Correct	9 ms	2048 KB	Output is correct
11	Correct	9 ms	2048 KB	Output is correct
12	Correct	6 ms	2048 KB	Output is correct
13	Correct	9 ms	2048 KB	Output is correct
14	Correct	6 ms	2048 KB	Output is correct
15	Correct	6 ms	2048 KB	Output is correct
16	Correct	3 ms	2048 KB	Output is correct
17	Correct	0 ms	2048 KB	Output is correct
18	Correct	3 ms	2048 KB	Output is correct
19	Correct	3 ms	2048 KB	Output is correct
20	Correct	3 ms	2048 KB	Output is correct
21	Correct	96 ms	2048 KB	Output is correct
22	Correct	93 ms	2048 KB	Output is correct
23	Correct	79 ms	2048 KB	Output is correct
24	Correct	113 ms	2048 KB	Output is correct
25	Correct	103 ms	2048 KB	Output is correct
26	Correct	166 ms	2048 KB	Output is correct
27	Correct	166 ms	2048 KB	Output is correct
28	Correct	153 ms	2048 KB	Output is correct
29	Correct	149 ms	2048 KB	Output is correct
30	Correct	9 ms	2048 KB	Output is correct
31	Correct	9 ms	2048 KB	Output is correct
32	Correct	9 ms	2048 KB	Output is correct
33	Correct	9 ms	2048 KB	Output is correct
34	Correct	9 ms	2048 KB	Output is correct
35	Correct	13 ms	2048 KB	Output is correct
36	Correct	13 ms	2048 KB	Output is correct
37	Correct	9 ms	2048 KB	Output is correct
38	Correct	9 ms	2048 KB	Output is correct

Subtask #3
27.0 / 27.0

#	결과	메모리	Grader output
1	Correct	2048 KB	Output is correct
2	Correct	2048 KB	Output is correct
3	Correct	2048 KB	Output is correct
4	Correct	2048 KB	Output is correct
5	Correct	2048 KB	Output is correct
6	Correct	2048 KB	Output is correct
7	Correct	2048 KB	Output is correct
8	Correct	2048 KB	Output is correct
9	Correct	2048 KB	Output is correct
10	Correct	2048 KB	Output is correct
11	Correct	2048 KB	Output is correct
12	Correct	2048 KB	Output is correct
13	Correct	2048 KB	Output is correct
14	Correct	2048 KB	Output is correct
15	Correct	2048 KB	Output is correct
16	Correct	2048 KB	Output is correct
17	Correct	2048 KB	Output is correct
18	Correct	2048 KB	Output is correct
19	Correct	2048 KB	Output is correct
20	Correct	2048 KB	Output is correct

Subtask #4
42.0 / 42.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	2048 KB	Output is correct
2	Correct	9 ms	2048 KB	Output is correct
3	Correct	9 ms	2048 KB	Output is correct
4	Correct	9 ms	2048 KB	Output is correct
5	Correct	9 ms	2048 KB	Output is correct
6	Correct	9 ms	2048 KB	Output is correct
7	Correct	6 ms	2048 KB	Output is correct
8	Correct	9 ms	2048 KB	Output is correct
9	Correct	6 ms	2048 KB	Output is correct
10	Correct	9 ms	2048 KB	Output is correct
11	Correct	9 ms	2048 KB	Output is correct
12	Correct	6 ms	2048 KB	Output is correct
13	Correct	9 ms	2048 KB	Output is correct
14	Correct	6 ms	2048 KB	Output is correct
15	Correct	6 ms	2048 KB	Output is correct
16	Correct	3 ms	2048 KB	Output is correct
17	Correct	0 ms	2048 KB	Output is correct
18	Correct	3 ms	2048 KB	Output is correct
19	Correct	3 ms	2048 KB	Output is correct
20	Correct	3 ms	2048 KB	Output is correct
21	Correct	96 ms	2048 KB	Output is correct
22	Correct	93 ms	2048 KB	Output is correct
23	Correct	79 ms	2048 KB	Output is correct
24	Correct	113 ms	2048 KB	Output is correct
25	Correct	103 ms	2048 KB	Output is correct
26	Correct	166 ms	2048 KB	Output is correct
27	Correct	166 ms	2048 KB	Output is correct
28	Correct	153 ms	2048 KB	Output is correct
29	Correct	149 ms	2048 KB	Output is correct
30	Correct	9 ms	2048 KB	Output is correct
31	Correct	9 ms	2048 KB	Output is correct
32	Correct	9 ms	2048 KB	Output is correct
33	Correct	9 ms	2048 KB	Output is correct
34	Correct	9 ms	2048 KB	Output is correct
35	Correct	13 ms	2048 KB	Output is correct
36	Correct	13 ms	2048 KB	Output is correct
37	Correct	9 ms	2048 KB	Output is correct
38	Correct	9 ms	2048 KB	Output is correct
39	Correct	0 ms	2048 KB	Output is correct
40	Correct	0 ms	2048 KB	Output is correct
41	Correct	0 ms	2048 KB	Output is correct
42	Correct	0 ms	2048 KB	Output is correct
43	Correct	0 ms	2048 KB	Output is correct
44	Correct	0 ms	2048 KB	Output is correct
45	Correct	0 ms	2048 KB	Output is correct
46	Correct	0 ms	2048 KB	Output is correct
47	Correct	0 ms	2048 KB	Output is correct
48	Correct	0 ms	2048 KB	Output is correct
49	Correct	0 ms	2048 KB	Output is correct
50	Correct	0 ms	2048 KB	Output is correct
51	Correct	0 ms	2048 KB	Output is correct
52	Correct	0 ms	2048 KB	Output is correct
53	Correct	0 ms	2048 KB	Output is correct
54	Correct	0 ms	2048 KB	Output is correct
55	Correct	0 ms	2048 KB	Output is correct
56	Correct	0 ms	2048 KB	Output is correct
57	Correct	0 ms	2048 KB	Output is correct
58	Correct	0 ms	2048 KB	Output is correct
59	Correct	89 ms	2048 KB	Output is correct
60	Correct	106 ms	2048 KB	Output is correct
61	Correct	93 ms	2048 KB	Output is correct
62	Correct	99 ms	2048 KB	Output is correct
63	Correct	96 ms	2048 KB	Output is correct
64	Correct	173 ms	2048 KB	Output is correct
65	Correct	169 ms	2048 KB	Output is correct
66	Correct	176 ms	2048 KB	Output is correct
67	Correct	169 ms	2048 KB	Output is correct
68	Correct	179 ms	2048 KB	Output is correct
69	Correct	83 ms	2048 KB	Output is correct
70	Correct	86 ms	2048 KB	Output is correct
71	Correct	89 ms	2048 KB	Output is correct
72	Correct	83 ms	2048 KB	Output is correct
73	Correct	86 ms	2048 KB	Output is correct
74	Correct	19 ms	2048 KB	Output is correct
75	Correct	19 ms	2048 KB	Output is correct
76	Correct	19 ms	2048 KB	Output is correct
77	Correct	23 ms	2048 KB	Output is correct
78	Correct	19 ms	2048 KB	Output is correct

답안 #25201

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 22.0 / 22.0

Subtask #3 27.0 / 27.0

Subtask #4 42.0 / 42.0

Subtask #1
9.0 / 9.0

Subtask #2
22.0 / 22.0

Subtask #3
27.0 / 27.0

Subtask #4
42.0 / 42.0