| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 237213 | Mlxa | Deda (COCI17_deda) | C++14 | 402 ms | 5740 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;
#define int ll
#define all(x) x.begin(), x.end()
#define x first
#define y second
#define mp make_pair
#define mt make_tuple
const int N = 1 << 18;
const int INF = 1e18;
int n;
int q;
int t[2 * N];
void upd(int i, int v) {
t[i += N] = v;
for (i /= 2; i > 0; i /= 2) {
t[i] = min(t[i + i], t[i + i + 1]);
}
}
int query(int l, int r) {
int mn = INF;
for (l += N, r += N; l <= r; l /= 2, r /= 2) {
if (l % 2 == 1) {
mn = min(mn, t[l++]);
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||