# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
834451 | Liudas | Progression (NOI20_progression) | C++17 | 743 ms | 44796 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>
#include <set>
#include <algorithm>
#include <climits>
#define int long long
using namespace std;
class segment_tree{
public:
struct node{
int l, r;
int lmax, rmax, midmax;
};
vector<node> tree;
int N;
segment_tree(int X){
N = 1;
while(N <= X){
N *= 2;
}
tree.assign(N * 2, {INT_MIN,INT_MIN,0,0,0});
}
node deal_with(node a, node b){
node c = {INT_MIN,INT_MIN,0,0,0};
c.l = a.l;
c.r = b.r;
c.lmax = a.lmax;
c.rmax = b.rmax;
if(a.l == b.l){
c.lmax += b.lmax;
# | 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... |