# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
850390 | TahirAliyev | Floppy (RMI20_floppy) | C++17 | 699 ms | 15476 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>
#include "floppy.h"
#define pii pair<int, int>
#define ll long long
#define oo 2e9
using namespace std;
const int MAX = 4e4 + 4, LOGMAX = 17;
int n;
int nxt = 0;
int arr[MAX];
pii tree[4 * MAX];
string bits;
void build(int node, int l, int r){
if(l == r){
tree[node] = {arr[l], l};
return;
}
int mid = (l + r) / 2;
build(2 * node, l, mid);
build(2 * node + 1, mid + 1, r);
tree[node] = max(tree[2 * node], tree[2 * node + 1]);
}
pii ask(int node, int l, int r, int ql, int qr){
if(r < ql || qr < l){
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... |