# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1084965 | pemguimn | Fortune Telling 2 (JOI14_fortune_telling2) | C++14 | 324 ms | 29372 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 N = 2e5 + 5, VAL = 3 * N, MAX = 4 * VAL;
int n, k, a[N], b[N], t[N], pos[N];
int ans[N];
int seg[MAX];
vector<int> val;
void upd(int id, int tl, int tr, int i, int x){
if(i < tl || i > tr) return;
if(tl == tr){
seg[id] = max(seg[id], x); return;
}
int mid = (tl + tr) / 2;
upd(id * 2, tl, mid, i, x), upd(id * 2 + 1, mid + 1, tr, i, x);
seg[id] = max(seg[id * 2], seg[id * 2 + 1]);
}
int query(int id, int tl, int tr, int l, int r){
if(r < tl || tr < l) return 0;
if(l <= tl && tr <= r) return seg[id];
int mid = (tl + tr) / 2;
return max(query(id * 2, tl, mid, l, r), query(id * 2 + 1, mid + 1, tr, l, r));
}
int bit[MAX];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |