# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
541809 | zxcvbnm | K blocks (IZhO14_blocks) | C++14 | 842 ms | 6192 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;
using ll = long long;
constexpr int nax = 1e5 + 5;
constexpr int kax = 105;
constexpr ll INF = 1e12 + 5;
#define int ll
struct St {
int n;
vector<int> tree;
void build(const vector<int>& vec, bool naujas=false) {
if (naujas) {
n = 1;
while(n < (int) vec.size()) {
n *= 2;
}
tree.assign(2*n, 0LL);
}
build_r(vec, 0, 0, n);
}
void build_r(const vector<int>& vec, int idx, int l, int r) {
if (r - l == 1) {
if (l < vec.size()) {
tree[idx] = vec[l];
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... |