# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1036452 | clementine | Robots (IOI13_robots) | C++17 | 114 ms | 19868 KiB |
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>
using namespace std;
typedef long long ll;
bool can(int time, int A, vector<int> tots)
{
for(int i = 0; i < A; i++)
{
if(tots[i] > time)
{
tots[i+1] += tots[i] - time;
}
}
if(tots[A] !=0)
{
return false;
}
return true;
}
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
vector<int> Xs(X, X+A);
vector<int> Ys(Y, Y+B);
vector<int> Ws(W, W+T);
vector<int> Ss(S, S + T);
sort(Xs.begin(), Xs.end());
# | 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... |