Submission #201113

#	Time	Username	Problem	Language	Result	Execution time	Memory
201113		mohammad	Robots (IOI13_robots)	C++14	0 / 100	294 ms	15372 KiB

robots

/*
░░░░██████████████████
░░▄███████▀▀▀▀▀▀███████▄
░▐████▀▒mohammad▒▀██████▄
░███▀▒▒▒▒alaa▒▒▒▒▒▒▀█████
░▐██▒▒▒alwrawrah▒▒▒▒▒████▌
░▐█▌▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒████▌
░░█▒▄▀▀▀▀▀▄▒▒▄▀▀▀▀▀▄▒▐███▌
░░░▐░░░▄▄░░▌▐░░░▄▄░░▌▐███▌
░▄▀▌░░░▀▀░░▌▐░░░▀▀░░▌▒▀▒█▌
░▌▒▀▄░░░░▄▀▒▒▀▄░░░▄▀▒▒▄▀▒▌
░▀▄▐▒▀▀▀▀▒▒▒▒▒▒▀▀▀▒▒▒▒▒▒█
░░░▀▌▒▄██▄▄▄▄████▄▒▒▒▒█▀
░░░░▄██████████████▒▒▐▌
░░░▀███▀▀████▀█████▀▒▌
░░░░░▌▒▒▒▄▒▒▒▄▒▒▒▒▒▒▐
░░░░░▌▒▒▒▒▀▀▀▒▒▒▒▒▒▒▐
*/
 
#include<bits/stdc++.h>
#include "robots.h"
using namespace std;
 
typedef long long ll ;
const ll oo = 1e13 ;
const double PI = acos(-1) ;
const ll M = 1e9 + 7  ;

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
	sort(X , X + A) ;
	sort(Y , Y + B) ;
	sort(W , W + T) ;
	sort(S , S + T) ;
	if(A == 0){
		if(Y[1] >S[1] && Y[0] >S[0]) return 1 ;
		else if(Y[1] > S[1] && Y[1] >S[0]) return 2 ;
		else return -1;
	}else if(B == 0){
		// cout << X[1] << ' ' << X[0] << ' '<< W[1] << ' ' << W[0] << endl;
		if(X[1] > W[1] && X[0] > W[0]) return 1 ;
		else if(X[1] > W[1] && X[1] > W[0]) return 2 ;
		else return -1;
	}else{
		if((Y[0] > S[1] && X[0] > W[0]) || (X[0] > W[1] && Y[0] > S[0])) return 1 ;
		else if((Y[0] > S[1] && Y[0] > S[0]) || (X[0] > W[1] && X[0] > W[0]))return 2 ;
		else return -1 ;
	}
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 25
• Subtask 4: 0 / 37
• Subtask 5: 0 / 10