| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 573587 |
2022-06-06T21:30:42 Z |
danikoynov |
Feast (NOI19_feast) |
C++14 |
|
1000 ms |
5744 KB |
/**
____ ____ ____ ____ ____ ____
||l |||e |||i |||n |||a |||d ||
||__|||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|/__\|
**/
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long long ll;
void speed()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
const int maxn = 3e5 + 10;
int n;
ll k, a[maxn], dp[maxn], cnt[maxn], par[maxn];
pair < ll, int > calc(ll cost)
{
for (int i = 1; i <= n; i ++)
{
dp[i] = dp[i - 1];
cnt[i] = cnt[i - 1];
for (int j = 1; j <= i; j ++)
{
ll sum = dp[j - 1] - cost + par[i] - par[j - 1];
if (sum > dp[i])
dp[i] = sum;
if (sum == dp[i])
cnt[i] = max(cnt[i], cnt[j - 1] + 1);
}
}
pair < ll, int > ans = {dp[1], cnt[1]};
for (int i = 2; i <= n; i ++)
if (make_pair((ll)dp[i], (int)cnt[i]) > ans)
ans = {dp[i], cnt[i]};
return ans;
}
void solve()
{
cin >> n >> k;
ll cnt = 0;
for (int i = 1; i <= n; i ++)
{
cin >> a[i];
if (a[i] >= 0)
cnt ++;
par[i] = par[i - 1] + a[i];
}
k = min(cnt, k);
ll lf = 0, rf = 1e12;
while(lf <= rf)
{
ll mf = (lf + rf) / 2;
pair < double, int > cur = calc(mf);
if (cur.second >= k)
lf = mf + 1;
else
rf = mf - 1;
}
double p1 = lf - 1, p2 = lf;
pair < ll, int > cur1 = calc(p1), cur2 = calc(p2);
cur1.first = cur1.first + cur1.second * p1;
cur2.first = cur2.first + cur2.second * p2;
double part = 1.0 - (double)(cur1.second - k) / (double)(cur1.second - cur2.second);
double slope = (cur1.first - cur2.first);
double ans = cur2.first + slope * part;
///cout << cur1.second << " " << cur2.second << " " << part << " " << cur1.second - k << " " << k << endl;
if (cur1.second == cur2.second)
{
cout << cur1.first << endl;
return;
}
cout << (ll)round(ans) << endl;
}
int main()
{
solve();
return 0;
}
/**
7 1
3 4 -1 2 3 -5 1
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1096 ms |
5744 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1084 ms |
5656 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1086 ms |
5660 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
2 ms |
212 KB |
Output is correct |
| 12 |
Correct |
2 ms |
212 KB |
Output is correct |
| 13 |
Correct |
2 ms |
212 KB |
Output is correct |
| 14 |
Correct |
2 ms |
328 KB |
Output is correct |
| 15 |
Correct |
2 ms |
212 KB |
Output is correct |
| 16 |
Correct |
2 ms |
212 KB |
Output is correct |
| 17 |
Correct |
2 ms |
212 KB |
Output is correct |
| 18 |
Correct |
2 ms |
212 KB |
Output is correct |
| 19 |
Correct |
2 ms |
212 KB |
Output is correct |
| 20 |
Correct |
2 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
2 ms |
212 KB |
Output is correct |
| 12 |
Correct |
2 ms |
212 KB |
Output is correct |
| 13 |
Correct |
2 ms |
212 KB |
Output is correct |
| 14 |
Correct |
2 ms |
328 KB |
Output is correct |
| 15 |
Correct |
2 ms |
212 KB |
Output is correct |
| 16 |
Correct |
2 ms |
212 KB |
Output is correct |
| 17 |
Correct |
2 ms |
212 KB |
Output is correct |
| 18 |
Correct |
2 ms |
212 KB |
Output is correct |
| 19 |
Correct |
2 ms |
212 KB |
Output is correct |
| 20 |
Correct |
2 ms |
212 KB |
Output is correct |
| 21 |
Correct |
69 ms |
372 KB |
Output is correct |
| 22 |
Correct |
71 ms |
388 KB |
Output is correct |
| 23 |
Correct |
71 ms |
340 KB |
Output is correct |
| 24 |
Correct |
67 ms |
400 KB |
Output is correct |
| 25 |
Correct |
76 ms |
340 KB |
Output is correct |
| 26 |
Correct |
92 ms |
396 KB |
Output is correct |
| 27 |
Correct |
78 ms |
424 KB |
Output is correct |
| 28 |
Correct |
74 ms |
392 KB |
Output is correct |
| 29 |
Correct |
69 ms |
392 KB |
Output is correct |
| 30 |
Correct |
67 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1096 ms |
5744 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
