| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 729925 | Rasoul006 | Robots (IOI13_robots) | C++17 | 1 ms | 308 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>
#define endl "\n"
#define F first
#define S second
#define pb push_back
#define all(x) x.begin() , x.end()
#define mm(dp , val) memset (dp , val , sizeof dp)
#define mid ((r+l)>>1)
#define lx (n<<1)
#define rx ((n<<1)|1)
typedef long long ll;
using namespace std;
const int logn = 26 ;
const int N = 1e6+5;
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
    sort (W , W + T) ;
    sort (S , S + T) ;
    sort (X , X + A) ;
    sort (Y , Y + B) ;
    if (A == B)
    {
        if (X[0] > S[0] && Y[0] > W[1])
            return 1 ;
        if (X[0] > S[1] && Y[0] > W[0])
            return 1 ;
        if (X[0] > S[1] || Y[0] > W[1])
            return 2 ;
        return -1 ;
    }
    if (!A)
    {
        if (X[1] <= S[1])
            return -1 ;
        if (X[0] > S[0])
            return 1 ;
        return 2 ;
    }
    if (!B)
    {
        if (Y[1] <= W[1])
            return -1 ;
        if (Y[0] > W[0])
            return 1 ;
        return 2 ;
    }
}
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... | ||||
