# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
373846 | eulerdesoja | Robots (IOI13_robots) | C++17 | 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;
#define ll long long
#define pb push_back
#define sz(x) int(x.size())
typedef pair<int,int>ii;
typedef vector<int> vi;
const int mxn=1e6+5,mxm=5e4+5;
int x[mxm],y[mxm],w[mxn],s[mxn];
int a,b,t;
bool solve(int p){
int id=0;//onde eu parei nos brinquedu
priority_queue<ii,vector<ii>>pq;
for(int i=0;i<a;i++){
for(;id<t;id++){
if(w[id]>=x[i])break;
pq.push({s[id],w[id]});
}
int cnt=0;
while(!pq.empty() && cnt<p){
cnt++;
pq.pop();
}
}
for(;id<t;id++)pq.push({s[id],w[id]});
for(int i=b-1;i>=0;i--){
int cnt=0;