Submission #401487

#	Time	Username	Problem	Language	Result	Execution time	Memory
401487		BERNARB01	Boat (APIO16_boat)	C++17	9 / 100	4 ms	2300 KiB

boat

#include <bits/stdc++.h>

using namespace std;

const int mod = (int) 1e9 + 7;
const int N = 502;

int n, a[N], b[N], rel[N];
long long dp[N][N];

long long sol(int i, int hi) {
	if (i == n) {
		return (hi > 0);
	}
	long long& ret = dp[i][hi];
	if (ret != -1) {
		return ret;
	}
	ret = sol(i + 1, hi);
	if (a[i] > hi) {
		ret += sol(i + 1, a[i]);
		ret %= mod;
	}
	return ret;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	memset(dp, -1, sizeof dp);
	cin >> n;
	vector<int> se(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i] >> b[i];
		se[i] = a[i];
	}
	sort(se.begin(), se.end());
	map<int, int> mp;
	int idd = 1;
	for (int i = 0; i < n; i++) {
		if (i == 0 || se[i] != se[i - 1]) {
			rel[idd] = se[i];
			mp[se[i]] = idd++;
		}
	}
	for (int i = 0; i < n; i++) {
		a[i] = mp[a[i]];
	}
	cout << sol(0, 0) << '\n';
	return 0;
}

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