# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
832855 | _martynas | Progression (NOI20_progression) | C++11 | 1394 ms | 97596 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 <iostream>
#include <vector>
using namespace std;
using ll = long long;
#warning change mxn
const int mxn = 3e5+5;
struct Node {
int len = 0;
ll dl = 0, dr = 0;
ll diffl = 0, diffr = 0;
int lenl = 0, lenr = 0, best = 1;
bool set_tag = false;
ll s = 0, c = 0;
};
Node merge(Node lhs, Node rhs) {
Node res{};
res.best = max(lhs.best, rhs.best);
ll diff = rhs.dl-lhs.dr;
res.best = max(res.best, (diff == lhs.diffr ? lhs.lenr : 1)+(diff == rhs.diffl ? rhs.lenl : 1));
if(lhs.len == 1) lhs.diffl = diff, lhs.lenl = 1;
if(rhs.len == 1) rhs.diffr = diff, rhs.lenr = 1;
res.lenl = lhs.lenl + (diff == lhs.diffl && lhs.lenl == lhs.len ? (diff == rhs.diffl ? rhs.lenl : 1) : 0);
res.lenr = rhs.lenr + (diff == rhs.diffr && rhs.lenr == rhs.len ? (diff == lhs.diffr ? lhs.lenr : 1) : 0);
res.best = max(res.best, max(res.lenl, res.lenr));
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... |