# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1155627 | alexdd | Robots (IOI13_robots) | C++20 | 3096 ms | 11840 KiB |
#include "robots.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> r1,r2;
vector<pair<int,int>> v;
bool verif(int cnt)
{
int poz=-1;
priority_queue<int> pq;
for(int x:r1)
{
while(poz+1<v.size() && v[poz+1].first < x)
{
poz++;
pq.push(v[poz].second);
}
for(int pas=0;pas<cnt;pas++)
if(!pq.empty())
pq.pop();
}
while(poz+1 < v.size())
{
poz++;
pq.push(v[poz].second);
}
for(int x:r2)
{
if(pq.empty())
break;
if(pq.top() >= x)
# | 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... |