# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
964537 | UmairAhmadMirza | Robots (IOI13_robots) | C++14 | 0 ms | 0 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;
deque<pair<int,int>> toy,temp;
bool check(int A,int B,int T,int X[], int Y[],int lim){
toy=temp;
priority_queue<int> v;
for (int i = 0; i < A; ++i)
{
while(toy.size()){
if(toy[0].first>=X[i])
break;
v.push(toy[0].second);
toy.pop_front();
}
int cnt=0;
while(v.size() && cnt<lim){
cnt++;
v.pop();
}
}
for(auto i:toy)
v.push(i.second);
toy.clear();
stack<int> sz;
while(v.size()){
sz.push(v.top());
v.pop();
}
int p=0;
int cnt=0;