# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
65363 | yp155136 | Robots (IOI13_robots) | C++14 | 1528 ms | 12596 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;
const int N = 1000006;
int x[N],y[N],w[N],s[N];
typedef pair<int,int> pii;
#define F first
#define S second
const int INF = 0x3f3f3f3f;
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
int n=T,a=A,b=B;
for (int i=0;A>i;i++) x[i] = X[i];
sort(x,x+a);
for (int i=0;B>i;i++) y[i] = Y[i];
sort(y,y+b);
//cout << "(T, a, b) = " << "( " << T << " , " << a << " , " << b << " ) " <<endl;
vector<pii> v;
for (int k=0;T>k;k++)
{
if (a>0 && W[k] >= x[a-1] && b==0) return -1;
if (b>0 && S[k] >= y[b-1] && a==0) return -1;
if (a && b)
{
if (W[k] >= x[a-1] && S[k] >= y[b-1]) return -1;
}
v.push_back(make_pair(W[k],S[k]));
Compilation message (stderr)
# | 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... |