# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
200024 | AQT | Robots (IOI13_robots) | C++14 | 1873 ms | 24820 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;
int A, B, N;
pair<int, int> arr[1000005];
int w[50005], s[50005];
bool chk(int k){
int idx = 0;
priority_queue<int> pq;
for(int i = 1; i<=A; i++){
while(idx < N && arr[idx+1].first < w[i]){
pq.push(arr[++idx].second);
}
int c = k;
while(c && pq.size()){
c--;
pq.pop();
}
}
while(idx < N){
pq.push(arr[++idx].second);
}
for(int i = 1; i<=B; i++){
int c = k;
while(c && pq.size()){
if(pq.top() >= s[i]){
return 0;
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... |