# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
383336 | peijar | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++17 | 1351 ms | 93236 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>
#define int long long
using namespace std;
struct Requete
{
int deb, fin, patience, iRequete;
bool operator<(Requete other) const
{
return patience < other.patience;
}
};
const int NB_FEUILLES = 1 << 20;
int seg[2 * NB_FEUILLES];
void init()
{
for (int i(0); i < 2 * NB_FEUILLES; ++i) seg[i]= -1;
}
void upd(int iPos, int val)
{
iPos += NB_FEUILLES;
seg[iPos] = val;
while (iPos > 1)
{
iPos /= 2;
# | 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... |