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<bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
int a, b, t;
vector<int>bb[500005];
int num[500005];
int bs[500005];
bool solve(int s){
memset(num, 0, sizeof(num));
for (int i=0;i<a;i++){
if (bs[i]>s)return 0;
if (bb[i].size()<=s-bs[i])continue;
for (int j=0;j<bb[i].size()-s+bs[i];j++){
num[bb[i][j]]++;
}
}
for (int i=0;i<bb[a].size();i++)num[bb[a][i]]++;
long long cur=0;
for (int i=b-1;i>=0;i--){
cur+=num[i];
if (cur>1LL*s*(b-i))return 0;
}
return 1;
}
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]){
for (int i=0;i<=A;i++)bb[i].clear();
sort(X, X+A);
sort(Y, Y+B);
int x, y;
for (int i=0;i<T;i++){
int l=0, r=A-1;
while(true){
if (l>r)break;
if (l==r){
if (X[l]<=W[i])x=l+1;
else x=l;
break;
}
int mid=(l+r)/2;
if (X[mid+1]<=W[i])l=mid+1;
else r=mid;
}
l=0;r=B-1;
while(true){
if (l>r)break;
if (l==r){
if (Y[l]<=S[i])y=l+1;
else y=l;
break;
}
int mid=(l+r)/2;
if (Y[mid+1]<=S[i])l=mid+1;
else r=mid;
}
if (x==A && y==B)return -1;
if (y!=B)bb[x].push_back(y);
else bs[x]++;
}
a=A;
b=B;
t=T;
for (int i=0;i<=a;i++){
sort(bb[i].begin(), bb[i].end());
}
int l=1, r=T;
while(true){
if (l==r)return l;
int mid=(l+r)/2;
if (solve(mid))r=mid;
else l=mid+1;
}
}
Compilation message (stderr)
robots.cpp: In function 'bool solve(int)':
robots.cpp:14:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
14 | if (bb[i].size()<=s-bs[i])continue;
| ~~~~~~~~~~~~^~~~~~~~~
robots.cpp:15:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
15 | for (int j=0;j<bb[i].size()-s+bs[i];j++){
| ~^~~~~~~~~~~~~~~~~~~~~
robots.cpp:19:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
19 | for (int i=0;i<bb[a].size();i++)num[bb[a][i]]++;
| ~^~~~~~~~~~~~~
# | 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... |