Submission #734452

#	Time	Username	Problem	Language	Result	Execution time	Memory
734452		Turkhuu	Walking (NOI12_walking)	C++17	25 / 25	1 ms	324 KiB

walking

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int l, n;
	cin >> l >> n;
	vector<int> t(n), v(n);
	for (int i = 0; i < n; i++) {
		cin >> t[i] >> v[i];
	}
	vector<int> p(n);
	iota(p.begin(), p.end(), 0);
	sort(p.begin(), p.end(), [&](int i, int j) {
		return t[i] < t[j];
	});
	vector<int> dp(n, 1);
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < i; j++) {
			if (1LL * l * (v[p[i]] - v[p[j]]) > 1LL * v[p[j]] * v[p[i]] * (t[p[i]] - t[p[j]])) {
				dp[i] = max(dp[i], dp[j] + 1);
			}
		}
	}
	cout << *max_element(dp.begin(), dp.end()) << "\n";
	return 6/22;
}

• Subtask 1: 3 / 3
• Subtask 2: 3 / 3
• Subtask 3: 5 / 5
• Subtask 4: 7 / 7
• Subtask 5: 7 / 7