# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
340798 | katearima | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++14 | 2571 ms | 33784 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;
const int N=1e6+5;
int n,m, tree[4*N], a[N];
struct book{
int x, mood, ind;
};
struct books {
int x, y;
int sum;
bool operator<(books const& other) {
return y < other.y;
}
};
int ans[N];
vector<book> q[N];
vector<books> v;
stack<int> st;
void update(int i, int x, int y, int k, int val){
if(y<k || x>k) return;
if(k>=x && k<=y) {
tree[i]=max(tree[i], val);
if(x==y) return;
}
int mid=(x+y)/2;
update(2*i+1, x, mid, k, val);
update(2*i+2, mid+1, y, k,val);
}
int getmax(int i, int x, int y, int l , int r){
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... |