# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
386363 | Mamnoon_Siam | Food Court (JOI21_foodcourt) | C++17 | 686 ms | 63380 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;
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
#define all(v) begin(v), end(v)
#define sz(v) (int)(v).size()
#define fi first
#define se second
struct info {
ll x = 0, y = 0;
info operator + (const info& o) const {
info r;
if(y >= o.x) r.y = y - o.x, r.x = x;
else r.y = 0, r.x = x + (o.x - y);
r.y += o.y;
return r;
}
};
struct Node {
Node *l = 0, *r = 0;
info lz;
int lo, hi;
Node(int _lo, int _hi) : lo(_lo), hi(_hi) {
if(lo < hi) {
int mid = (lo + hi) >> 1;
l = new Node(lo, mid), r = new Node(mid+1, hi);
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... |
# | 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... |