# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
538193 | blue | Progression (NOI20_progression) | C++17 | 972 ms | 63108 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 <algorithm>
using namespace std;
using ll = long long;
using vll = vector<ll>;
int N, Q;
vll diff;
struct Node
{
int l, r;
ll lp = 0; //lp (everything below already includes lp)
int ns = 1; //node size
bool ih = 0; //is homogenous (if homogenous, adjust everything below!)
ll fv = 0; //first value
int fs = 1; //first size
ll lv = 0; //last value
int ls = 1; //last size
int ts = 1; //total size
# | 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... |