Submission #733000

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
733000	2023-04-30T01:58:24 Z	SanguineChameleon	Boat (APIO16_boat)	C++17	0 / 100	121 ms	460 KB

boat

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

void just_do_it();

int main() {
	#ifdef KAMIRULEZ
		freopen("kamirulez.inp", "r", stdin);
		freopen("kamirulez.out", "w", stdout);
	#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	just_do_it();
	return 0;
}

const int maxn = 5e2 + 20;
const long long mod = 1e9 + 7;
bool flag[maxn];
long long cur[maxn];
long long nxt[maxn];
int n;

void trans() {
	for (int i = 1; i <= n; i++) {
		nxt[i] = cur[i];
		if (flag[i]) {
			nxt[i] = (nxt[i] + 1) % mod;
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = i + 1; j <= n; j++) {
			if (flag[j]) {
				nxt[j] = (nxt[j] + cur[i]) % mod;
			}
		}
	}
	swap(cur, nxt);
}

void just_do_it() {
	cin >> n;
	vector<pair<int, int>> events;
	for (int i = 1; i <= n; i++) {
		int a, b;
		cin >> a >> b;
		events.emplace_back(a, i);
		events.emplace_back(b + 1, -i);
	}
	sort(events.begin(), events.end());
	int cur_t = 0;
	for (auto e: events) {
		int nxt_t = e.first;
		int id = e.second;
		if (cur_t < nxt_t - 1) {
			cur_t = nxt_t - 1;
		}
		if (id > 0) {
			flag[id] = true;
		}
		else {
			flag[-id] = false;
		}
		if (cur_t == nxt_t - 1) {
			trans();
			cur_t = nxt_t;
		}
	}
	long long res = 0;
	for (int i = 1; i <= n; i++) {
		res += cur[i];
		res %= mod;
	}
	cout << res;
}

Subtask #1

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	121 ms	340 KB	Output is correct
2	Correct	97 ms	332 KB	Output is correct
3	Correct	95 ms	340 KB	Output is correct
4	Correct	95 ms	336 KB	Output is correct
5	Correct	102 ms	460 KB	Output is correct
6	Correct	96 ms	340 KB	Output is correct
7	Correct	93 ms	340 KB	Output is correct
8	Correct	102 ms	340 KB	Output is correct
9	Correct	101 ms	340 KB	Output is correct
10	Correct	97 ms	340 KB	Output is correct
11	Correct	104 ms	340 KB	Output is correct
12	Correct	103 ms	460 KB	Output is correct
13	Correct	95 ms	328 KB	Output is correct
14	Correct	91 ms	340 KB	Output is correct
15	Correct	93 ms	340 KB	Output is correct
16	Incorrect	18 ms	336 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #2

0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	121 ms	340 KB	Output is correct
2	Correct	97 ms	332 KB	Output is correct
3	Correct	95 ms	340 KB	Output is correct
4	Correct	95 ms	336 KB	Output is correct
5	Correct	102 ms	460 KB	Output is correct
6	Correct	96 ms	340 KB	Output is correct
7	Correct	93 ms	340 KB	Output is correct
8	Correct	102 ms	340 KB	Output is correct
9	Correct	101 ms	340 KB	Output is correct
10	Correct	97 ms	340 KB	Output is correct
11	Correct	104 ms	340 KB	Output is correct
12	Correct	103 ms	460 KB	Output is correct
13	Correct	95 ms	328 KB	Output is correct
14	Correct	91 ms	340 KB	Output is correct
15	Correct	93 ms	340 KB	Output is correct
16	Incorrect	18 ms	336 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	212 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 42.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	121 ms	340 KB	Output is correct
2	Correct	97 ms	332 KB	Output is correct
3	Correct	95 ms	340 KB	Output is correct
4	Correct	95 ms	336 KB	Output is correct
5	Correct	102 ms	460 KB	Output is correct
6	Correct	96 ms	340 KB	Output is correct
7	Correct	93 ms	340 KB	Output is correct
8	Correct	102 ms	340 KB	Output is correct
9	Correct	101 ms	340 KB	Output is correct
10	Correct	97 ms	340 KB	Output is correct
11	Correct	104 ms	340 KB	Output is correct
12	Correct	103 ms	460 KB	Output is correct
13	Correct	95 ms	328 KB	Output is correct
14	Correct	91 ms	340 KB	Output is correct
15	Correct	93 ms	340 KB	Output is correct
16	Incorrect	18 ms	336 KB	Output isn't correct
17	Halted	0 ms	0 KB	-