oj.uz

Submission #38311

# Submission time Handle Problem Language Result Execution time Memory
38311 2018-01-03T15:47:04 Z romanasa Mountain Trek Route (IZhO12_route) C++14
100 / 100
 749 ms 26300 KB 
#include <bits/stdc++.h>
#define err(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)

using namespace std;

typedef long long ll;

priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>> > S;

#define TASK "g"

int main() {	

	int n, k;
	cin >> n >> k;
	
	vector<int> a(n);
	for (int i = 0; i < n; i++) cin >> a[i];
	
	rotate(a.begin(), max_element(a.begin(), a.end()), a.end());
	a.push_back(a[0]);
	
	vector<int> s;
	for (int i = 0; i <= n; i++) {
  		while (s.size() && a[s.back()] < a[i]) {
  			int val = a[s.back()];
  			s.pop_back();
  			S.push({ (i - s.back() - 1), min(a[s.back()], a[i]) - val });
  		}
		s.push_back(i);
	}
	
	int ans = 0;
	while (S.size()) {
		auto c = S.top();
		S.pop();
	
		int t = min(k / c.first, c.second);
		ans += t * 2;
		k -= t * c.first;
	}
	cout << ans << "\n";

	return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2016 KB Output is correct
2 Correct 0 ms 2016 KB Output is correct
3 Correct 0 ms 2016 KB Output is correct
4 Correct 0 ms 2016 KB Output is correct
5 Correct 0 ms 2016 KB Output is correct
6 Correct 0 ms 2016 KB Output is correct
7 Correct 0 ms 2016 KB Output is correct
8 Correct 0 ms 2016 KB Output is correct
9 Correct 0 ms 2016 KB Output is correct
10 Correct 63 ms 4932 KB Output is correct
11 Correct 83 ms 4932 KB Output is correct
12 Correct 76 ms 5188 KB Output is correct
13 Correct 736 ms 26300 KB Output is correct
14 Correct 749 ms 26300 KB Output is correct
15 Correct 676 ms 26300 KB Output is correct
16 Correct 683 ms 26300 KB Output is correct
17 Correct 723 ms 26300 KB Output is correct
18 Correct 649 ms 26300 KB Output is correct
19 Correct 596 ms 26300 KB Output is correct
20 Correct 606 ms 26300 KB Output is correct