# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
467146 | radaiosm7 | Exam (eJOI20_exam) | C++98 | 29 ms | 3096 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;
int n, i, j, l, r;
int a[100005];
int b[100005];
int c[100005];
int v[100005];
int seg[400020];
bool lazy[400020];
int dp[5005];
void Update(int from, int to, int start=0, int ende=n-1, int indx=1) {
if (lazy[indx]) return;
if (from == start && to == ende) {
seg[indx] = to-from+1;
lazy[indx] = true;
return;
}
int mid = (start+ende)/2;
if (to <= mid) Update(from, to, start, mid, 2*indx);
else if (from > mid) Update(from, to, mid+1, ende, 2*indx+1);
else {
Update(from, mid, start, mid, 2*indx);
Update(mid+1, to, mid+1, ende, 2*indx+1);
}
seg[indx] = seg[2*indx]+seg[2*indx+1];
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |