# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
968558 | weakweakweak | Real Mountains (CCO23_day1problem2) | C++17 | 2740 ms | 129472 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.
//我好笨,聽解了
/*
x +
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int M = 1e6 + 3, N = M + 20, INF = (INT_MAX >> 1) - 3;
int o[N], n;
vector <int> v[N], b;
struct segmenttree {
int a[N << 2];
void build (int l, int r, int id) {
if (l == r) {
a[id] = b[o[l]];
return;
}
int mid = (l + r) >> 1;
build (l, mid, id << 1); build (mid + 1, r, id << 1 | 1);
a[id] = min(a[id << 1], a[id << 1 | 1]);
}
int query (int l, int r, int ql, int qr, int id) {
if (ql < 1 or qr > n or ql > qr) return INF;
if (ql <= l and r <= qr) return a[id];
int mid = (l + r) >> 1, ans = INT_MAX;
if (ql <= mid) ans = min(ans, query(l, mid, ql, qr, id << 1));
if (qr > mid) ans = min(ans, query(mid + 1, r, ql, qr, id << 1 | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |