| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 372941 | MatinZare | Deda (COCI17_deda) | C++17 | 689 ms | 7660 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;
const int maxn = 2e5 + 20;
int n, m, sg[4 * maxn], ar[maxn], ql, qr, y;
void update(int l, int r, int q, int qval, int id) {
if (l == q && r == q)
sg[id] = qval;
else if (l > q || r < q)
return;
else {
int mid = (l + r) / 2;
update(l, mid, q, qval, id * 2);
update(mid + 1, r, q, qval, id * 2 + 1);
if (sg[id * 2] == 0 && sg[id * 2 + 1] == 0)
sg[id] = 0;
else if (sg[id * 2] == 0 || sg[id * 2 + 1] == 0)
sg[id] = max(sg[id * 2], sg[id * 2 + 1]);
else
sg[id] = min(sg[id * 2], sg[id * 2 + 1]);
}
}
void get(int l, int r, int id) {
if (l >= ql && r <= qr) {
//cout << l << ", " << r << " : " << ql << " " << qr << endl;
if (sg[id] != 0 && sg[id] <= y)
qr = r;
if (sg[id] == 0 || sg[id] > y) {
ql = r + 1;
return;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||