# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
898516 | EthanKim8683 | Bitaro's travel (JOI23_travel) | C++17 | 889 ms | 8040 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;
using I=int;
using Lli=long long int;
const I N=200000;
const Lli MAX=1e18+1;
const Lli MIN=-MAX;
Lli x_arr[N];
I main(){
cin.tie(0)->sync_with_stdio(0);
I n;cin>>n;
for(I i=0;i<n;i++)cin>>x_arr[i];
I q;cin>>q;
while(q--){
I s;cin>>s;
auto geq=[&](Lli x){
return lower_bound(x_arr,x_arr+n,x)-x_arr;
};
auto gtn=[&](Lli x){
return upper_bound(x_arr,x_arr+n,x)-x_arr;
};
auto ltn=[&](Lli x){
return geq(x)-1;
};
auto leq=[&](Lli x){
return gtn(x)-1;
};
auto val=[&](I i){
if(i==-1){
return MIN;
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... |