# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
225293 | alvinpiter | Mountains (NOI20_mountains) | C++14 | 338 ms | 13168 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 LL long long int
#define MAXN 300000
int N, M;
LL H[MAXN + 3], answer;
int prefix[MAXN + 3], suffix[MAXN + 3]; //BIT
vector<LL> uniqH;
void update(int bit[], int idx, int val) {
while (idx <= M) {
bit[idx] += val;
idx += (idx & -idx);
}
}
int query(int bit[], int idx) {
int result = 0;
while (idx > 0) {
result += bit[idx];
idx -= (idx & -idx);
}
return result;
}
int id(LL h) {
return (lower_bound(uniqH.begin(), uniqH.end(), h) - uniqH.begin()) + 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... |