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 <bits/stdc++.h>
#include "robots.h"
using namespace std;
// #define int long long
#define endl '\n'
#define F first
#define S second
#define pb push_back
#define all(a) a.begin(),a.end()
const int NN=1e6+50000;
const int MOD=1e9+7;
const int off=(1<<11);
int putaway(int A,int B,int T,int X[],int Y[],int W[],int S[]){
sort(W,W+T);
int rbt=0,ty=0;
vector<pair<int,int>>vp;
for(int i=0;i<T;i++)vp.pb({W[i],1});
for(int i=0;i<A;i++)vp.pb({X[i],0});
sort(all(vp));
int ans=0;
for(int i=vp.size()-1;i>=0;i--){
if(vp[i].S==0){
rbt++;
}
else{
ty++;
if(i==0){
int x=ty/rbt;
x+=(ty%rbt);
ans=max(ans,x);
}
else if(vp[i-1].S==0){
int x=ty/rbt;
x+=(ty%rbt);
ans=max(ans,x);
}
}
}
return ans;
}
// signed main(){
// ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// }
# | 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... |