# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94636 | Retro3014 | Robots (IOI13_robots) | C++17 | 1801 ms | 24804 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 "robots.h"
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
struct S{
int w, s;
bool operator <(const S &a)const{
return w<a.w;
}
};
vector<S> v;
vector<int> x, y;
priority_queue<int> pq;
bool chk(int k){
while(!pq.empty()) pq.pop();
int j=0, t;
for(int i=0; i<v.size(); i++){
while(j<x.size() && x[j]<=v[i].w){
t = k;
while(t-- && !pq.empty()) pq.pop();
j++;
}
pq.push(v[i].s);
}
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... |