# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
571237 | YouAreMyGalaxy | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++17 | 1335 ms | 96168 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.
//Make CSP great again
//Vengeance
#include <bits/stdc++.h>
#define TASK "TESTCODE"
#define Log2(x) 31 - __builtin_clz(x)
using namespace std;
const int N = 1e6;
vector<int> ask[N + 1];
int l[N + 1], k[N + 1], res[N + 1], a[N + 1], n, m;
stack<int> st;
struct FenwickTree
{
int Tree[N + 1];
void add(int pos, int val)
{
for (; pos > 0; pos -= (pos & (-pos)))
{
Tree[pos] = max(Tree[pos], val);
}
}
int get(int pos)
{
int ret = 0;
for (; pos <= n; pos += (pos & (-pos)))
{
ret = max(ret, Tree[pos]);
}
return ret;
}
} tree;
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... |