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;
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[])
{
if(A == 1)
{
if(X[0] > W[0])
{
if(Y[0] > S[1])
{
return 1;
}
}
if(X[0] > W[1] && Y[0] > S[0])
{
return 1;
}
if(X[0] > W[0] && X[0] > W[1])
{
return 2;
}
if(Y[0] > S[0] && Y[0] > S[1])
{
return 2;
}
return -1;
}
if(A== 2)
{
int a = min(W[1], W[2]);
int b = max(W[1], W[2]);
int x = min(X[1], X[2]);
int y = max(X[1], X[2]);
if(x > a && y > b)
{
return 1;
}
if(y > b)
{
return 2;
}
return -1;
}
if(B== 2)
{
int a = min(S[1], S[2]);
int b = max(S[1], S[2]);
int x = min(Y[1], Y[2]);
int y = max(Y[1], Y[2]);
if(x > a && y > b)
{
return 1;
}
if(y > b)
{
return 2;
}
return -1;
}
return -1;
}
# | 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... |