# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
153824 | Ruxandra985 | Robots (IOI13_robots) | C++14 | 1945 ms | 24224 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 <cstdio>
#include <iostream>
#include <algorithm>
#include "robots.h"
#include <vector>
#include <queue>
using namespace std;
int ok (int gmax ,int a , int b , int t , int y[],int s[],vector <int> v[50010] ){
int i,j;
/// pana acum am log 10^6
priority_queue <int> h,h2;
for (i=0;i<=a;i++){
for (j=0;j<v[i].size();j++)
h.push(s[v[i][j]]);
if (i!=a){
for (j=1;j<=gmax && !h.empty();j++)
h.pop(); /// cele mai mari gmax sizeuri le pun aici
}
}
/// in h au ramas cele pe care trebuie tu sa le pui la robotii mici
//if (gmax == 23)
// printf ("%d ",h.size());
for (i=b-1;i>=0;i--){
if (h.empty())
return 1;
if (h.top() > y[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... |