# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
546353 | krit3379 | Pinball (JOI14_pinball) | C++17 | 230 ms | 22712 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;
#define N 100005
int a[N],b[N],c[N],d[N];
long long l,r,ans=1e18;
vector<int> v;
class tree{
public:
vector<long long> t;
tree():t(4*N,1e18){}
void update(int x,int l,int r,int i,long long val){
if(l>c[i]||r<c[i])return ;
if(l==r){
t[x]=min(t[x],val);
return ;
}
int mid=(l+r)/2;
update(x*2,l,mid,i,val);
update(x*2+1,mid+1,r,i,val);
t[x]=min(t[x*2],t[x*2+1]);
}
long long sol(int x,int l,int r,int i){
if(l>b[i]||a[i]>r)return 1e18;
if(a[i]<=l&&r<=b[i])return t[x];
int mid=(l+r)/2;
return min(sol(x*2,l,mid,i),sol(x*2+1,mid+1,r,i));
}
}t1,t2;
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... |