# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
609267 | MrDeboo | Horses (IOI15_horses) | C++17 | 823 ms | 68976 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 "horses.h"
#include "bits/stdc++.h"
using namespace std;
long long multpl[2000000];
long long maxi[2000000];
long long X[500000];
set<int>st;
int n,N,L,R;
long long multp(int l=1,int r=N,int in=1){
if(l>R||r<L)return 1;
if(l>=L&&r<=R)return multpl[in];
int mid=(l+r)/2;
return (multp(l,mid,in*2)*multp(mid+1,r,in*2+1))%1000000007;
}
long long mx(int l=1,int r=N,int in=1){
if(l>R||r<L)return 0;
if(l>=L&&r<=R)return maxi[in];
int mid=(l+r)/2;
return max(mx(l,mid,in*2),mx(mid+1,r,in*2+1));
}
int slv(){
deque<int>v;
int g=31;
auto it=st.end();
while(it!=st.begin()&&g--){
it--;
v.push_back(*it);
}
sort(v.begin(),v.end());
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |