Submission #59153

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
59153	2018-07-20 18:23:54	aome	Robots (IOI13_robots)	C++17	100 / 100	2667 ms	39192 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 "robots.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
int P[N];
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
  for (int i = 0; i < T; ++i) P[i] = i;
  sort(X, X + A);
  sort(Y, Y + B);
  sort(P, P + T, [&] (int x, int y) {
    return W[x] < W[y];
  });
  int l = 1, r = T;
  while (l < r) {
    int mid = (l + r) >> 1;
    int ptr = 0;
    priority_queue<int> pq;
    for (int i = 0; i < A; ++i) {
      while (ptr < T && W[P[ptr]] < X[i]) pq.push(S[P[ptr++]]);
      int cur = mid;
      while (cur && pq.size()) pq.pop(), cur--;
    }
    while (ptr < T) pq.push(S[P[ptr++]]);
    for (int i = B - 1; i >= 0; --i) {
      int cur = mid;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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