# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
487904 | SirCovidThe19th | K blocks (IZhO14_blocks) | C++17 | 1095 ms | 59308 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;
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx,avx2")
const int mx = 1e5 + 5;
int n, k, A[mx]; stack<int> stk;
struct Node{ int mnDP, vDP, vRange; };
template<int sz> struct ST{
Node seg[sz * 4]; int lz[sz * 4];
inline Node comb(Node a, Node b){
if (a.vDP + a.vRange > b.vDP + b.vRange) swap(a, b);
a.mnDP = min(a.mnDP, b.mnDP);
return a;
}
inline Node comb1(int i, int j){
Node a = seg[i], b = seg[j];
if (lz[i]) a.vDP = a.mnDP, a.vRange = lz[i];
if (lz[j]) b.vDP = b.mnDP, b.vRange = lz[j];
return comb(a, b);
}
inline void push(int l, int r, int i){
if (!lz[i]) return;
seg[i].vRange = lz[i];
if (l != r) lz[i * 2] = lz[i * 2 + 1] = lz[i];
# | 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... |