# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
422677 | schse | Financial Report (JOI21_financial) | C++17 | 2447 ms | 34456 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>
#define INF INT32_MAX
using namespace std;
struct segtreenode
{
int left, midle, right;
int b, e;
};
segtreenode operator+(segtreenode const &l, segtreenode const &r)
{
segtreenode res = {l.left, l.right + r.left, r.right, l.b, r.e};
if (l.left == l.e - l.b)
res.left += r.left;
if (r.right == r.e - r.b)
res.right += l.right;
res.midle = max(res.midle, r.midle);
res.midle = max(res.midle, l.midle);
res.midle = max(res.midle, res.left);
res.midle = max(res.midle, res.right);
return res;
}
struct segtree
{
vector<segtreenode> tree;
void initial(int N)
{
tree.resize(4 * N + 5);
# | 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... |