# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
59271 | TadijaSebez | Robots (IOI13_robots) | C++11 | 2484 ms | 57328 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 <stdio.h>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
#define mp make_pair
const int N=1000050;
const int M=50050;
int x[M],y[M];
pair<int,int> toy[N];
bool Check(int n, int a, int b, int mid)
{
priority_queue<int> pq;
int i,j=1,k;
for(i=1;i<=a;i++)
{
while(j<=n && toy[j].first<=x[i]) pq.push(toy[j].second),j++;
for(k=1;k<=mid;k++)
{
if(pq.empty()) break;
pq.pop();
}
}
while(j<=n) pq.push(toy[j].second),j++;
for(i=b;i>=1;i--)
{
for(k=1;k<=mid;k++)
{
if(pq.empty()) return 1;
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... |