# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
262551 | Cantfindme | Progression (NOI20_progression) | C++17 | 438 ms | 72648 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>
using namespace std;
#define int long long
typedef pair<int,int> pi;
#define f first
#define s second
#define FAST ios_base::sync_with_stdio(0); cin.tie(0);
const int maxn = 300010;
struct rmqv {
pi pref, suff, best;
};
struct node {
int s,m,e;
int sz;
pi pref, suff, best; //length, value
node *l, *r;
node (int _s, int _e) {
s = _s; e = _e; m = (s+e)/2;
sz = e - s + 1;
pref = suff = best = pi(0,0);
if (s != e) {
l = new node(s,m);
r = new node(m+1,e);
}
}
void update(int x, int newv) {
# | 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... |