| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1342593 | ziad3ssam10 | Feast (NOI19_feast) | C++20 | 739 ms | 77908 KiB |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T>
using orderedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define ll long long
#define ld long double
#define endl '\n'
#define wady \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
void files() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
}
void solve() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (auto &i: a)cin >> i;
vector<vector<pair<int,int> > > dp(n + 2, vector<pair<int,int> >(2));
vector<vector<int> > vis(n + 2, vector<int>(2));
int lamda = 0;
int timer = 0;
function<pair<int,int> (int,int)> rec = [&](int idx,int lst)-> pair<int,int> {
if (idx == n) return {0, 0};
auto &ret = dp[idx][lst];
if (vis[idx][lst] == timer) return ret;
vis[idx][lst] = timer;
auto leave = rec(idx + 1, 0);
auto take = rec(idx + 1, 1);
take.first += a[idx];
if (!lst) {
take.first -= lamda;
take.second--;
}
return ret = max(leave, take);
};
int l = 0, r = 1e15;
int ans = 0;
while (l <= r) {
int mid = l + (r - l) / 2;
lamda = mid;
timer++;
auto [cur,cnt] = rec(0, 0);
int temp = -cnt;
if (temp > k)l = mid + 1;
else {
ans = (cur + (__int128_t) mid * k);
r = mid - 1;
}
}
cout << ans << endl;
}
signed main() {
wady
int t = 1;
int tc = 1;
while (t--)
solve();
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
