#include <bits/stdc++.h>
using namespace std;
#define type(x) __typeof((x).begin())
#define foreach(it, x) for(type(x) it = (x).begin(); it != (x).end(); it++)
typedef long long ll;
typedef pair < int, int > ii;
const int inf = 1e9 + 333;
const ll linf = 1e18 + inf;
#include "robots.h"
const int N = 1e6 + 5;
int n;
int A, B;
int X[N], Y[N];
ii a[N];
int id[N], root[N], size[N];
vector < int > v;
int dsu(int x) {
if(x == root[x])
return x;
return root[x] = dsu(root[x]);
}
bool f(int x) {
v.clear();
for(int i = 0; i <= A; i++) {
root[i] = i;
size[i] = x;
}
for(int i = n - 1; i >= 0; i--) {
int go = dsu(id[i]);
if(go < A) {
size[go]--;
if(!size[go]) {
root[go] = go + 1;
}
}
else {
v.push_back(a[i].second);
}
}
int ptr = 0;
for(int i = B - 1; i >= 0; i--) {
int rem = x;
while(ptr < v.size() and rem and Y[i] > v[ptr]) {
rem--;
ptr++;
}
}
return ptr == v.size();
}
int putaway(int A, int B, int n, int X[], int Y[], int W[], int S[]) {
:: n = n;
:: A = A;
:: B = B;
sort(X, X + A);
sort(Y, Y + B);
for(int i = 0; i < A; i++)
:: X[i] = X[i];
for(int i = 0; i < B; i++)
:: Y[i] = Y[i];
for(int i = 0; i < n; i++) {
a[i] = ii(S[i], W[i]);
}
sort(a, a + n);
for(int i = 0; i < n; i++)
swap(a[i].first, a[i].second);
for(int i = 0; i < n; i++) {
id[i] = upper_bound(X, X + A, a[i].first) - X;
}
if(!f(n))
return -1;
int l = 1, r = n;
while(l < r) {
int m = l + r >> 1;
if(f(m))
r = m;
else
l = m + 1;
}
return l;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 2 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 3 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 4 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 5 |
Correct |
3 ms |
33364 KB |
Output is correct |
| 6 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 7 |
Correct |
0 ms |
33364 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 2 |
Correct |
4 ms |
33364 KB |
Output is correct |
| 3 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 4 |
Correct |
449 ms |
33496 KB |
Output is correct |
| 5 |
Correct |
263 ms |
33364 KB |
Output is correct |
| 6 |
Correct |
44 ms |
33384 KB |
Output is correct |
| 7 |
Correct |
343 ms |
34144 KB |
Output is correct |
| 8 |
Correct |
395 ms |
34904 KB |
Output is correct |
| 9 |
Correct |
359 ms |
34136 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 2 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 3 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 4 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 5 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 6 |
Correct |
4 ms |
33364 KB |
Output is correct |
| 7 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 8 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 9 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 10 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 11 |
Correct |
4 ms |
33364 KB |
Output is correct |
| 12 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 13 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 14 |
Correct |
0 ms |
33364 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 2 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 3 |
Correct |
4 ms |
33364 KB |
Output is correct |
| 4 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 5 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 6 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 7 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 8 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 9 |
Correct |
4 ms |
33364 KB |
Output is correct |
| 10 |
Correct |
4 ms |
33364 KB |
Output is correct |
| 11 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 12 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 13 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 14 |
Correct |
4 ms |
33364 KB |
Output is correct |
| 15 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 16 |
Correct |
5 ms |
33364 KB |
Output is correct |
| 17 |
Correct |
5 ms |
33364 KB |
Output is correct |
| 18 |
Correct |
10 ms |
33364 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
33364 KB |
Output is correct |
| 2 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 3 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 4 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 5 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 6 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 7 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 8 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 9 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 10 |
Correct |
372 ms |
33496 KB |
Output is correct |
| 11 |
Correct |
248 ms |
33364 KB |
Output is correct |
| 12 |
Correct |
48 ms |
33388 KB |
Output is correct |
| 13 |
Correct |
364 ms |
34140 KB |
Output is correct |
| 14 |
Correct |
375 ms |
34904 KB |
Output is correct |
| 15 |
Correct |
4 ms |
33364 KB |
Output is correct |
| 16 |
Correct |
4 ms |
33364 KB |
Output is correct |
| 17 |
Correct |
4 ms |
33364 KB |
Output is correct |
| 18 |
Correct |
4 ms |
33364 KB |
Output is correct |
| 19 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 20 |
Correct |
0 ms |
33364 KB |
Output is correct |
| 21 |
Correct |
11 ms |
33364 KB |
Output is correct |
| 22 |
Correct |
290 ms |
36440 KB |
Output is correct |
| 23 |
Correct |
351 ms |
34136 KB |
Output is correct |
| 24 |
Correct |
321 ms |
34136 KB |
Output is correct |
| 25 |
Correct |
332 ms |
34136 KB |
Output is correct |
| 26 |
Correct |
279 ms |
36440 KB |
Output is correct |
| 27 |
Correct |
398 ms |
36440 KB |
Output is correct |
| 28 |
Correct |
418 ms |
36440 KB |
Output is correct |
| 29 |
Correct |
317 ms |
36440 KB |
Output is correct |
