# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
65722 | zubec | Robots (IOI13_robots) | C++14 | 2228 ms | 36116 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 <bits/stdc++.h>
using namespace std;
vector <pair<int, int> > vec1;
vector <int> a, b;
int n, m, k;
bool f(int x){
int pos = 0;
priority_queue<int, vector<int>, greater<int> > q;
for (int i = 0; i < n; i++){
while (pos < k && vec1[pos].first < a[i]){
q.push(-vec1[pos].second);
++pos;
}
for (int j = 1; j <= x; j++){
if (q.empty())
break;
q.pop();
//q.erase(q.begin());
}
}
while(pos < vec1.size()){
q.push(-vec1[pos].second);
++pos;
}
for (int i = m-1; i >= 0; i--){
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... |