# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
839037 | LucaIlie | Cake 3 (JOI19_cake3) | C++17 | 3391 ms | 17604 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>
using namespace std;
struct ab {
int a, b;
};
struct event {
int type, val, t;
};
const int MAX_N = 2e5;
const long long INF = 1e18;
const int MAX_EVENTS = 2 * MAX_N;
int m;
int timee = 0;
int nrEv = 0;
long long sumA = 0;
long long ans = -INF;
ab v[MAX_N + 1];
event events[MAX_EVENTS];
multiset <int> s;
void solve( int ll, int lr, int rl, int rr ) {
if ( ll > lr || rl > rr || rr - ll + 1 < m )
return;
Compilation message (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... |