Submission #47633

#	Time	Username	Problem	Language	Result	Execution time	Memory
47633		square1001	Boat (APIO16_boat)	C++14	9 / 100	3 ms	900 KiB

boat

#include <cassert>
#include <iostream>
using namespace std;
const int mod = 1000000007;
int n, a[509], b[509], dp[509];
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i] >> b[i];
		assert(a[i] == b[i]);
	}
	int sum = 0;
	for (int i = 0; i < n; i++) {
		dp[i] = 1;
		for (int j = 0; j < i; j++) {
			if (a[j] < a[i]) {
				dp[i] += dp[j];
				if (dp[i] >= mod) dp[i] -= mod;
			}
		}
		sum += dp[i];
		if (sum >= mod) sum -= mod;
	}
	cout << sum << '\n';
	return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 22
• Subtask 3: 0 / 27
• Subtask 4: 0 / 42