# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
577189 | dantoh000 | Event Hopping 2 (JOI21_event2) | C++14 | 139 ms | 21848 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 fi first
#define se second
using namespace std;
typedef pair<int,int> ii;
int n,k;
int l[100005];
int r[100005];
ii a[100005];
set<ii> s;
vector<int> ans;
int p[17][100005];
int st[17][100005];
int cur = 0;
int MX(int l, int r){
if (l == r) return st[0][l];
int d = 31-__builtin_clz(r-l+1);
return max(st[d][l], st[d][r-(1<<d)+1]);
}
int find(int x){
int lo = 1, hi = n+1;
while (lo < hi){
int mid = (lo+hi)/2;
if (MX(1, mid) >= x){
hi = mid;
}
else lo = mid+1;
}
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... |