Submission #1135816

#	Time	Username	Problem	Language	Result	Execution time	Memory
1135816		ashokanr	Walking (NOI12_walking)	C++20	25 / 25	0 ms	328 KiB

walking

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
#define INF 1e9
using namespace std;
typedef long long ll;

void solve()
{
	int l, n; cin >> l >> n;
	vector<int>dp(n, 1);
	vector<pair<int, int>>v(n);
	for (int i = 0; i < n; i++) cin >> v[i].first >> v[i].second;
	sort(v.begin(), v.end());
	for (int i = n - 1; i >= 0; i--) {
		for (int j = i + 1; j < n; j++) {
			double a = ((double)l / (double)v[i].second) + v[i].first;
			double b = ((double)l / (double)v[j].second) + v[j].first;
			//cout << a << " " << b << "\n";
			if (a > b)dp[i] = max(dp[i], dp[j] + 1);
		}
	}
	int ans = 0;
	for (int i = 0; i < n; i++) ans = max(ans, dp[i]);
	cout << ans << "\n";
	
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;// cin>>t;
	while (t--) solve();
	return 0;
}

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