# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
333016 | Boaba | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++14 | 1231 ms | 109104 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 <cstdio>
#include <vector>
#define Max(a, b) (((a) < (b)) ? (b) : (a))
#pragma GCC optimize ("O3")
const int nmax = 1e6 + 5;
struct day {
int st, dr, ind, k;
};
int v[nmax], aib[nmax], n, m;
bool ans[nmax];
std::vector<int>st, last[nmax];
std::vector<day>skema[nmax];
void update(int poz, int val) {
for (; poz <= n; poz += poz & (-poz))
aib[poz] = Max(aib[poz], val);
}
int query(int poz) {
int ans = 0;
for (; poz > 0; poz -= poz & (-poz))
ans = Max(ans, aib[poz]);
return ans;
}
int main() {
scanf("%d%d", &n, &m);
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... |