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 "robots.h"
#include <bits/stdc++.h>
#define endl "\n"
#define F first
#define S second
#define pb push_back
#define all(x) x.begin() , x.end()
#define mm(dp , val) memset (dp , val , sizeof dp)
#define mid ((r+l)>>1)
#define lx (n<<1)
#define rx ((n<<1)|1)
typedef long long ll;
using namespace std;
const int logn = 26 ;
const int N = 1e6+5;
ll n , m , q , x[N] , y[N] , s[N] , w[N] ;
multiset <ll> st ;
vector <ll> vec ;
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
n = A , m = B , q = T ;
for (int i = 0 ; i<n ; i++)
{
x[i] = X[i] ;
vec.pb(x[i]) ;
}
sort (x , x+n);
for (int i = 0 ; i<q ; i++)
{
w[i] = W[i] ;
if (x[n-1] <= w[i]) return -1 ;
st.insert(w[i]);
}
sort (all(vec));
ll ans = 0 ;
while (!st.empty() && ans <= q)
{
for (auto i : vec)
{
auto it = st.lower_bound(i) ;
if (it == st.begin())
{
if (*it >= i)
continue ;
else
st.erase(it);
}
else
{
it--;
st.erase(it);
}
}
ans++;
}
return (ans <= q ? ans : -1) ;
}
# | 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... |