이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include "robots.h"
using namespace std;
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
sort(X, X+A);
reverse(X, X+A);
sort(W, W+T);
reverse(W, W+T);
for (int i = 0; i < A; i++)
{
//cout << X[i] << " ";
}
//cout << "\n";
for (int i = 0; i < T; i++)
{
//cout << W[i] << " ";
}
if (W[0] >= X[0])
{
return -1;
}
float maxMinutes = 0;
float robotCounter = 1;
float toyCounter = 0;
while (toyCounter < T and robotCounter < A)
{
if (X[int(robotCounter)] > W[int(toyCounter)])
{
//toyCounter++;
//cout << "Checking with " << toyCounter << "/" << robotCounter << "\n";
maxMinutes = max(maxMinutes, toyCounter/robotCounter);
robotCounter++;
}
else
{
toyCounter++;
}
}
//cout << "Checking with " << T << "/" << robotCounter << "\n";
maxMinutes = max(maxMinutes, float(T)/float(robotCounter));
maxMinutes = ceil(maxMinutes);
return int(maxMinutes);
}
# | 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... |