Submission #598708

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
598708	2022-07-18 18:25:33	Bench0310	Robots (IOI13_robots)	C++17	100 / 100	1567 ms	24376 KiB

robots

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#include "robots.h"
using namespace std;
typedef long long ll;
int putaway(int A,int B,int n,int limX[],int limY[],int X[],int Y[])
{
    sort(limX,limX+A);
    sort(limY,limY+B);
    vector<array<int,2>> v(n);
    for(int i=0;i<n;i++) v[i]={X[i],Y[i]};
    sort(v.begin(),v.end());
    int l=0,r=n+1;
    while(l<r-1)
    {
        int cnt=(l+r)/2;
        priority_queue<int> q;
        int idx=0;
        for(int i=0;i<A;i++)
        {
            while(idx<n&&v[idx][0]<limX[i]) q.push(v[idx++][1]);
            for(int j=0;j<cnt&&!q.empty();j++) q.pop();
        }
        while(idx<n) q.push(v[idx++][1]);
        for(int i=B-1;i>=0;i--)
        {
            int c=cnt;
            while(c>0&&!q.empty()&&q.top()<limY[i])
            {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 25 / 25
• Subtask 4: 37 / 37
• Subtask 5: 10 / 10