#include <bits/stdc++.h>
#include "holiday.h"
using namespace std;
using ll = long long;
const int N = 100010;
ll solve(int att[], int n, int d)
{
/*printf("solving (%d): ", d);
for (int i = 0; i < n; ++i)
printf("%d ", att[i]);
printf("\n");*/
ll ans = 0, sum = 0;
priority_queue<int, vector<int>, greater<int>> val;
for (int i = 0; i < n && d > 0; ++i, --d) {
val.push(att[i]);
sum += att[i];
while (val.size() > d) {
sum -= val.top();
val.pop();
}
ans = max(ans, sum);
}
//printf("return %d\n", ans);
return ans;
}
ll findMaxAttraction(int n, int start, int d, int att[])
{
if (n > 3000 && start > 0)
return -1;
ll ans = 0;
for (int i = 0; i <= start; ++i)
ans = max(ans, solve(&att[start-i], n-start+i, d-i));
if (start > 0) {
start = n-start-1;
reverse(att, att+n);
for (int i = 0; i <= start; ++i)
ans = max(ans, solve(&att[start-i], n-start+i, d-i));
}
return ans;
}
Compilation message
holiday.cpp: In function 'll solve(int*, int, int)':
holiday.cpp:19:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while (val.size() > d) {
~~~~~~~~~~~^~~
grader.cpp: In function 'int main()':
grader.cpp:7:12: warning: variable 'n_s' set but not used [-Wunused-but-set-variable]
int i, n_s;
^~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
3 ms |
476 KB |
Output is correct |
3 |
Correct |
3 ms |
476 KB |
Output is correct |
4 |
Correct |
3 ms |
536 KB |
Output is correct |
5 |
Correct |
2 ms |
536 KB |
Output is correct |
6 |
Correct |
3 ms |
536 KB |
Output is correct |
7 |
Correct |
2 ms |
536 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
1800 KB |
Output is correct |
2 |
Correct |
15 ms |
2052 KB |
Output is correct |
3 |
Correct |
13 ms |
2312 KB |
Output is correct |
4 |
Correct |
12 ms |
2440 KB |
Output is correct |
5 |
Correct |
22 ms |
2440 KB |
Output is correct |
6 |
Correct |
7 ms |
2440 KB |
Output is correct |
7 |
Correct |
12 ms |
2548 KB |
Output is correct |
8 |
Correct |
17 ms |
2824 KB |
Output is correct |
9 |
Correct |
6 ms |
2824 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
139 ms |
2824 KB |
Output is correct |
2 |
Correct |
42 ms |
2824 KB |
Output is correct |
3 |
Correct |
67 ms |
2824 KB |
Output is correct |
4 |
Correct |
398 ms |
2824 KB |
Output is correct |
5 |
Correct |
288 ms |
2824 KB |
Output is correct |
6 |
Correct |
21 ms |
2824 KB |
Output is correct |
7 |
Correct |
21 ms |
2824 KB |
Output is correct |
8 |
Correct |
22 ms |
2824 KB |
Output is correct |
9 |
Correct |
23 ms |
2824 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
19 ms |
3636 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |