# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
749373 | amunduzbaev | Sequence (APIO23_sequence) | C++17 | 1730 ms | 57004 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 "sequence.h"
#include "bits/stdc++.h"
using namespace std;
#ifndef EVAL
#include "grader.cpp"
#endif
#define ar array
typedef long long ll;
//~ #define int ll
const int INF = 1e9;
const int N = 5e5 + 5;
int A_[N], B_[N];
struct ST{
int min[N << 2], max[N << 2], p[N << 2];
ST(){
memset(min, 0, sizeof min);
memset(max, 0, sizeof max);
memset(p, 0, sizeof p);
}
void push(int x, int lx, int rx){
if(lx == rx) return;
min[x << 1] += p[x], max[x << 1] += p[x], p[x << 1] += p[x];
min[x << 1 | 1] += p[x], max[x << 1 | 1] += p[x], p[x << 1 | 1] += p[x];
p[x] = 0;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |