# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1176152 | KK_1729 | Cake 3 (JOI19_cake3) | C++20 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define pb push_back
#define all(a) a.begin(), a.end()
#define endl "\n"
void printVector(vector<int> a){
for (auto x: a) cout << x << " ";
cout << endl;
}
int n, m;
vector<pair<int, int>> cakes;
vector<int> val;
void dnc(int l, int r, int optl, int optr){
if (l > r) return;
int mid = (l+r)/2;
if (n-mid < m-1) return;
pair<int, int> best = {-1e17, mid};
multiset<int> o; int u = 0;
for (int j = mid+1; j < mid+m-1; ++j){
o.insert(cakes[j].second);
u += cakes[j].second;
}
// if (mid == 3) cout << u << endl;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |