# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
845794 | BamshooT | K blocks (IZhO14_blocks) | C++14 | 7 ms | 45144 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 <cstring>
#include <vector>
#define ll long long
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define fi first
#define se second
#define inf 1e9
using namespace std;
typedef pair <int, int> ii;
const int N = 1e5 + 9;
int n, k, a[N], dp[N][109], st[N << 2], L[N];
void build(int id, int l, int r){
if (l == r){
st[id] = dp[l][1];
return;
}
int mid = l + r >> 1;
build(id*2, l, mid); build(id*2 + 1, mid + 1, r);
st[id] = min(st[id*2], st[id*2+1]);
}
void update(int id, int l, int r, int i, int val){
if (i < l || r < i) return;
if (l == r){
Compilation message (stderr)
# | 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... |