# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
712108 | alvingogo | Cake 3 (JOI19_cake3) | C++14 | 3193 ms | 40068 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
#define int long long
using namespace std;
vector<pair<int,int> > v;
int n,k;
int ans=-1e18;
vector<pair<int,int> > dp;
struct DS{
p_q<int,vector<int>,greater<int> > pq,pq2;
int cnt=0;
vector<int> v;
int sum=0;
void add(int x){
sum+=x;
cnt++;
v.push_back(x);
pq.push(x);
if(cnt>k){
pq2.push(pq.top());
sum-=pq.top();
v.push_back({-pq.top()});
cnt--;
}
while(pq.size() && pq2.size() && pq.top()==pq2.top()){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |