# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
331844 | quocnguyen1012 | Colouring a rectangle (eJOI19_colouring) | C++14 | 1668 ms | 44548 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;
const int maxn = 4e5 + 5;
struct segmenttree {
vector<ll> st;
vector<ll> lazy;
int n;
void init(int _n) {
n = _n;
st.assign(4 * n + 5, 0);
lazy.assign(4 * n + 5, 0);
}
#define lc id << 1
#define rc id << 1 | 1
void push(int id, int l, int r) {
st[id] += lazy[id];
if (l != r) {
lazy[lc] += lazy[id];
lazy[rc] += lazy[id];
}
lazy[id] = 0;
}
void modify(int L, int R, ll v, int id, int l, int r) {
push(id, l, r);
if (R < l || r < L)
# | 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... |