# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
979781 | Jarif_Rahman | New Home (APIO18_new_home) | C++17 | 5028 ms | 289040 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 pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
const int lim = 6e6;
struct Node{
int inc = -1e9, dec = -1e9;
Node *l = nullptr, *r = nullptr;
Node(){}
Node(Node *_l, Node *_r): l(_l), r(_r){}
void update(){
inc = -1e9;
if(l) inc = max(inc, l->inc);
if(r) inc = max(inc, r->inc);
dec = -1e9;
if(l) dec = max(dec, l->dec);
if(r) dec = max(dec, r->dec);
}
}Nodes[lim];
int ls_node = 0;
Node* newNode(){
return &Nodes[ls_node++];
# | 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... |