Submission #655683

#	Time	Username	Problem	Language	Result	Execution time	Memory
655683		ShirAriel	Walking (NOI12_walking)	C++17	17 / 25	1 ms	212 KiB

walking

#include <iostream>
#include <algorithm>
#include <vector>
#include <set>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;

bool comp(pll val1, pll val2)
{
	return val1.first > val2.first;
}

int main()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	ll l, n;
	cin >> l >> n;

	vector<pll> persons(n);
	for (ll i = 0; i < n; i++)
		cin >> persons[i].first >> persons[i].second;

	sort(persons.begin(), persons.end(), comp);

	//lis
	multiset<ll> lis;
	for (ll i = 0; i < n; i++)
	{
		ll val = l / persons[i].second + persons[i].first;
		auto it = lis.lower_bound(val);
		if (it != lis.end())
			lis.erase(it);
		lis.insert(val);
	}

	cout << lis.size();

	return 0;
}

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