# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47730 | EmanuelNrx | Fortune Telling 2 (JOI14_fortune_telling2) | C++14 | 726 ms | 31800 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;
const int DIM = 600005;
pair<int, int> seg[DIM], num[DIM]; vector<int> aux, lst[DIM];
int sgt[DIM << 2], bit[DIM], arr[DIM], pos[DIM];
inline bool cmp(pair<int, int> sg1, pair<int, int> sg2)
{
return max(sg1.first, sg1.second) < max(sg2.first, sg2.second);
}
void update(int nod, int lef, int rig, int pos, int val)
{
if (lef == rig)
sgt[nod] = max(sgt[nod], val);
else {
int mid = (lef + rig) >> 1;
if (pos <= mid)
update(nod << 1, lef, mid, pos, val);
else
update(nod << 1 | 1, mid + 1, rig, pos, val);
sgt[nod] = max(sgt[nod << 1], sgt[nod << 1 | 1]);
}
}
int query(int nod, int lef, int rig, int _lef, int _rig)
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... |