# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
289993 | AKaan37 | Robots (IOI13_robots) | C++17 | 193 ms | 4856 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;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int n,m,b[li],a[li],k,flag,t;
int cev;
string s;
vector<int> v;
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
if(A==1 && B==1){
if(X[0]>W[0] && Y[0]>S[1])return 1;
if(X[0]>W[1] && Y[0]>S[0])return 1;
if(X[0]>W[1] && X[0]>W[0])return 2;
if(Y[0]>S[1] && Y[0]>S[0])return 2;
return -1;
}
if(A==2){
if(X[0]>W[0] && X[1]>W[1])return 1;
if(X[0]>W[1] && X[1]>W[0])return 1;
if(X[0]>W[1] && X[0]>W[0])return 2;
if(X[1]>W[1] && X[1]>W[0])return 2;
return -1;
}
if(B==2){
if(Y[0]>S[0] && Y[1]>S[1])return 1;
if(Y[0]>S[1] && Y[1]>S[0])return 1;
if(Y[0]>S[1] && Y[0]>S[0])return 2;
if(Y[1]>S[1] && Y[1]>S[0])return 2;
return -1;
}
}
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... |