# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
120492 | achibasadzishvili | Exhibition (JOI19_ho_t2) | C++14 | 868 ms | 11440 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 ll long long
#define f first
#define s second
#define pb push_back
using namespace std;
ll n,m,b[100005];
multiset<ll>st;
pair<ll,ll>a[100005];
bool check(ll x){
vector<ll>v;
for(int i=m-x+1; i<=m; i++)v.pb(b[i]);
ll lastval = 0;
ll ind = 1;
st.clear();
for(int i=0; i<v.size(); i++){
while(a[ind].f <= v[i] && ind <= n){
st.insert(a[ind].s);
ind++;
}
if(st.size())
while((*st.begin()) < lastval){
st.erase(st.begin());
if(st.empty())return 0;
}
if(st.empty())return 0;
lastval = (*st.begin());
st.erase(st.begin());
}
return 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... |