# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
862684 | Cyber_Wolf | Osumnjičeni (COCI21_osumnjiceni) | C++17 | 1075 ms | 95204 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;
#define lg long long
#define mid (lr+hr)/2
const lg N = 2e5+5;
lg l[N], r[N], anc[N][20], n, seg[(N << 3)][2];
void doLazy(lg node, lg lr, lg hr)
{
if(!seg[node][1]) return;
seg[node][0] += seg[node][1]*(hr-lr+1);
if(lr != hr)
{
for(int ch = node*2; ch <= node*2+1; ch++)
{
seg[ch][1] += seg[node][1];
}
}
seg[node][1] = 0;
}
void upd(lg node, lg lr, lg hr, lg lq, lg hq, lg val)
{
doLazy(node, lr, hr);
if(lr > hq || lq > hr) return;
if(lq <= lr & hr <= hq)
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |