# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
765168 | fatemetmhr | Robots (IOI13_robots) | C++17 | 0 ms | 0 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.
// ~ Be Name Khoda ~ //
#include "robots.h"
#include <bits/stdc++.h>
//#pragma GCC optimize ("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops,Ofast")
using namespace std;
typedef long long ll;
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define fi first
#define se second
const int maxn = 1e6 + 10;
const int maxn5 = 1e6 + 10;
const int maxnt = 1.2e6 + 10;
const int maxn3 = 1e3 + 10;
const int mod = 1e9 + 7;
const ll inf = 1e18;
int putaway(int a, int b, int T, int x[], int y[], int w[], int s[]) {
int t = T;
sort(x, x + n);
sort(y, y + m);
for(int i = 0; i < t; i++){
if(w[i] >= x[n - 1] && s[i] >= y[m - 1])
return -1;
}
if(a && x[0] > w[0]){
if(b && y[0] > s[1])
return true;
if(a > 1 && x[1] > w[1])
return true;
}
if(b > 1 && y[0] > s[0] && y[1] > s[1])
return true;
swap(w[0], w[1]);
swap(s[0], s[1]);
if(a && x[0] > w[0]){
if(b && y[0] > s[1])
return true;
if(a > 1 && x[1] > w[1])
return true;
}
if(b > 1 && y[0] > s[0] && y[1] > s[1])
return true;
return false;
}