# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
963548 | irmuun | 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.
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
int putaway(int A,int B,int T,int X[],int Y[],int W[],int S[]){
if(T==2&&A+B==2){
int w[A+B],s[A+B];
for(int i=0;i<A;i++){
w[i]=x[i];
s[i]=2e9;
}
for(int i=A;i<A+B;i++){
w[i]=2e9;
s[i]=y[i];
}
function <bool(int,int)> check=[&](int i,int j){
if(w[i]>=W[i]&&s[i]>=S[j]) return true;
return false;
}
if(check(0,1)&&check(1,0)) return 1;
if(check(0,0)&&check(1,1)) return 1;
if(check(0,1)&&check(0,0)) return 2;
if(check(0,1)&&check(1,1)) return 2;
return -1;
}
return -1;
}