Submission #260969

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
260969	2020-08-11T08:53:57 Z	srvlt	Boat (APIO16_boat)	C++14	100 / 100	799 ms	16280 KB

boat

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define all(x) begin(x), end(x)
#define SZ(x) (int)(x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int n0 = 1003, mod = 1e9 + 7;
int n, l[n0], r[n0], k;

void add(int & x, int y) {
	x += y;
	if (x >= mod) x -= mod;
}

int bp(int x, int y) {
	int res = 1;
	while (y) {
		if (y & 1)
			res = (ll)res * x % mod;
		x = (ll)x * x % mod;
		y /= 2;
	}
	return res;
}

struct Mint {
	int a = 0, b = 0;
	Mint(int x = 0) {
		a = 0, b = x;
		if (b >= mod) {
			b -= mod;
			if (b == 0)
				a = 1;
		}
	}
	void operator += (const Mint & x) {
		if (a == x.a) {
			if (b + x.b == mod) a++;
			add(b, x.b);
		}	else if (a > x.a)
			a = x.a, b = x.b;
	}
	Mint operator + (const Mint & x) const {
		Mint res = * this;
		res += x;
		return res;
	}
	Mint operator * (const Mint & x) const {
		Mint res;
		res.a = a + x.a;
		res.b = (ll)b * x.b % mod;
		return res;
	}
	Mint operator / (const Mint & x) const {
		Mint res;
		res.a = a - x.a;
		res.b = (ll)b * bp(x.b, mod - 2) % mod;
		return res;
	}
};

struct Block {
	int l = 0, r = 0, t = 0;
	Mint add[n0], c[n0], cur, last;
	Block() {
		c[0] = 1;
	}
	void upd(Mint x) {
		add[t++] = x;
		c[t] = c[t - 1] * (r - l + t) / t;
		cur = last = 0;
		for (int i = 0; i < t; i++) {
			cur += c[t - i] * add[i];
			last += c[t - i - 1] * add[i];
		}
	}
};
Block b[n0];

int main() {
	ios_base::sync_with_stdio(false), cin.tie(NULL);
	cin >> n;
	vector <int> crd;
	for (int i = 0; i < n; i++) {
		cin >> l[i] >> r[i];
		r[i]++;
		crd.pb(l[i]), crd.pb(r[i]);
	}
	crd.pb(0), crd.pb(1);
	sort(all(crd));
	for (int i = 1; i < SZ(crd); i++) {
		if (crd[i - 1] < crd[i]) {
			b[k].l = crd[i - 1];
			b[k++].r = crd[i] - 1;
		}
	}
	b[0].upd(1);
	for (int i = 0; i < n; i++) {
		Mint cur;
		int j = 0;
		for (; j < k && b[j].r < l[i]; j++)
			cur += b[j].cur;
		for (; j < k && b[j].r < r[i]; j++) {
			b[j].upd(cur);
			cur = b[j].last;
		}
	}
	Mint res;
	for (int i = 0; i < k; i++)
		res += b[i].cur;
	res += (mod - 1);
	if (res.a) cout << 0;
	else cout << res.b;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	11 ms	16128 KB	Output is correct
2	Correct	11 ms	16128 KB	Output is correct
3	Correct	13 ms	16128 KB	Output is correct
4	Correct	12 ms	16128 KB	Output is correct
5	Correct	12 ms	16128 KB	Output is correct
6	Correct	10 ms	16128 KB	Output is correct
7	Correct	11 ms	16128 KB	Output is correct
8	Correct	13 ms	16128 KB	Output is correct
9	Correct	11 ms	16128 KB	Output is correct
10	Correct	11 ms	16128 KB	Output is correct
11	Correct	11 ms	16128 KB	Output is correct
12	Correct	11 ms	16128 KB	Output is correct
13	Correct	11 ms	16128 KB	Output is correct
14	Correct	11 ms	16128 KB	Output is correct
15	Correct	11 ms	16128 KB	Output is correct
16	Correct	10 ms	16128 KB	Output is correct
17	Correct	11 ms	16172 KB	Output is correct
18	Correct	11 ms	16128 KB	Output is correct
19	Correct	10 ms	16128 KB	Output is correct
20	Correct	10 ms	16128 KB	Output is correct
21	Correct	317 ms	16184 KB	Output is correct
22	Correct	299 ms	16280 KB	Output is correct
23	Correct	265 ms	16252 KB	Output is correct
24	Correct	288 ms	16128 KB	Output is correct
25	Correct	330 ms	16248 KB	Output is correct
26	Correct	614 ms	16248 KB	Output is correct
27	Correct	625 ms	16128 KB	Output is correct
28	Correct	612 ms	16184 KB	Output is correct
29	Correct	611 ms	16248 KB	Output is correct
30	Correct	11 ms	16128 KB	Output is correct
31	Correct	11 ms	16128 KB	Output is correct
32	Correct	11 ms	16128 KB	Output is correct
33	Correct	11 ms	16128 KB	Output is correct
34	Correct	12 ms	16128 KB	Output is correct
35	Correct	11 ms	16128 KB	Output is correct
36	Correct	11 ms	16128 KB	Output is correct
37	Correct	12 ms	16128 KB	Output is correct
38	Correct	11 ms	16128 KB	Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
42.0 / 42.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	11 ms	16128 KB	Output is correct
2	Correct	11 ms	16128 KB	Output is correct
3	Correct	13 ms	16128 KB	Output is correct
4	Correct	12 ms	16128 KB	Output is correct
5	Correct	12 ms	16128 KB	Output is correct
6	Correct	10 ms	16128 KB	Output is correct
7	Correct	11 ms	16128 KB	Output is correct
8	Correct	13 ms	16128 KB	Output is correct
9	Correct	11 ms	16128 KB	Output is correct
10	Correct	11 ms	16128 KB	Output is correct
11	Correct	11 ms	16128 KB	Output is correct
12	Correct	11 ms	16128 KB	Output is correct
13	Correct	11 ms	16128 KB	Output is correct
14	Correct	11 ms	16128 KB	Output is correct
15	Correct	11 ms	16128 KB	Output is correct
16	Correct	10 ms	16128 KB	Output is correct
17	Correct	11 ms	16172 KB	Output is correct
18	Correct	11 ms	16128 KB	Output is correct
19	Correct	10 ms	16128 KB	Output is correct
20	Correct	10 ms	16128 KB	Output is correct
21	Correct	317 ms	16184 KB	Output is correct
22	Correct	299 ms	16280 KB	Output is correct
23	Correct	265 ms	16252 KB	Output is correct
24	Correct	288 ms	16128 KB	Output is correct
25	Correct	330 ms	16248 KB	Output is correct
26	Correct	614 ms	16248 KB	Output is correct
27	Correct	625 ms	16128 KB	Output is correct
28	Correct	612 ms	16184 KB	Output is correct
29	Correct	611 ms	16248 KB	Output is correct
30	Correct	11 ms	16128 KB	Output is correct
31	Correct	11 ms	16128 KB	Output is correct
32	Correct	11 ms	16128 KB	Output is correct
33	Correct	11 ms	16128 KB	Output is correct
34	Correct	12 ms	16128 KB	Output is correct
35	Correct	11 ms	16128 KB	Output is correct
36	Correct	11 ms	16128 KB	Output is correct
37	Correct	12 ms	16128 KB	Output is correct
38	Correct	11 ms	16128 KB	Output is correct
39	Correct	13 ms	16128 KB	Output is correct
40	Correct	12 ms	16128 KB	Output is correct
41	Correct	13 ms	16128 KB	Output is correct
42	Correct	13 ms	16128 KB	Output is correct
43	Correct	14 ms	16128 KB	Output is correct
44	Correct	17 ms	16128 KB	Output is correct
45	Correct	18 ms	16128 KB	Output is correct
46	Correct	17 ms	16128 KB	Output is correct
47	Correct	17 ms	16128 KB	Output is correct
48	Correct	17 ms	16128 KB	Output is correct
49	Correct	14 ms	16128 KB	Output is correct
50	Correct	12 ms	16128 KB	Output is correct
51	Correct	13 ms	16128 KB	Output is correct
52	Correct	13 ms	16128 KB	Output is correct
53	Correct	14 ms	16128 KB	Output is correct
54	Correct	12 ms	16128 KB	Output is correct
55	Correct	12 ms	16128 KB	Output is correct
56	Correct	11 ms	16128 KB	Output is correct
57	Correct	13 ms	16128 KB	Output is correct
58	Correct	12 ms	16128 KB	Output is correct
59	Correct	332 ms	16128 KB	Output is correct
60	Correct	307 ms	16248 KB	Output is correct
61	Correct	288 ms	16128 KB	Output is correct
62	Correct	382 ms	16188 KB	Output is correct
63	Correct	323 ms	16256 KB	Output is correct
64	Correct	748 ms	16248 KB	Output is correct
65	Correct	799 ms	16248 KB	Output is correct
66	Correct	738 ms	16248 KB	Output is correct
67	Correct	732 ms	16220 KB	Output is correct
68	Correct	729 ms	16248 KB	Output is correct
69	Correct	313 ms	16248 KB	Output is correct
70	Correct	287 ms	16128 KB	Output is correct
71	Correct	305 ms	16128 KB	Output is correct
72	Correct	314 ms	16196 KB	Output is correct
73	Correct	304 ms	16248 KB	Output is correct
74	Correct	64 ms	16128 KB	Output is correct
75	Correct	60 ms	16128 KB	Output is correct
76	Correct	63 ms	16128 KB	Output is correct
77	Correct	63 ms	16128 KB	Output is correct
78	Correct	66 ms	16128 KB	Output is correct

Submission #260969

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