# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
646115 | PagodePaiva | Intercastellar (JOI22_ho_t1) | C++14 | 89 ms | 11100 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
#define ms(v) memset(v, -1, sizeof v)
#define pi pair<int, int>
#define pb push_back
#define fr first
#define sc second
#define srt(v) sort(v.begin(), v.end())
#define INF 1e15
using namespace std;
int n;
vector <pair <pi, int>> v;
void buscab(int x){
int l = 0, r = v.size()-1;
int res = -1;
while(l <= r){
int mid = (l+r) >> 1;
if(v[mid].fr.fr <= x and x <= v[mid].fr.sc){
res = mid;
break;
}
else if(v[mid].fr.sc < x){
l = mid+1;
}
else{
r = mid;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |