Submission #235407

#	Time	Username	Problem	Language	Result	Execution time	Memory
235407		crossing0ver	Robots (IOI13_robots)	C++17	14 / 100	202 ms	19704 KiB

robots

#include<bits/stdc++.h>
#include "robots.h"
using namespace std;
 // X weight  Y size
 int a,b,t,X[10000],Y[10000],W[1000000],S[1000000],mxW,mxS , flag = 1;
void count_max() {
	for (int i = 0; i < a; i++) mxW = max (mxW,X[i]);
	for (int i = 0; i < b; i++) mxS = max (mxS,Y[i]);
	for (int i = 0; i < t; i++) 
		if (W[i] >= mxW && S[i] >= mxS) flag = 0;
}

int solve1() {
	if (a == 0) {
		if (Y[1] > S[1] && Y[0] > S[0]) return 1;
		return 2;
	}
	if (b == 0) {
		if (X[1] > W[1] && X[0] > W[0]) return 1;
		 return 2;
	}
	if ((X[0] > W[0] && Y[0] > S[1] ) || (X[0] > W[1] && Y[0] > S[0]) )
		return 1;
	return 0;
}
int putaway(int A1, int B1, int T1, int X1[], int Y1[], int W1[], int S1[]) {
	a = A1; b = B1;t = T1;
	for (int i = 0; i < a; i++) X[i] = X1[i];
	for (int i = 0; i < b; i++) Y[i] = Y1[i];
	for (int i = 0; i < t; i++) W[i] = W1[i], S[i] = S1[i];
	sort (X, X + a);
	sort (Y, Y + b);
    count_max();
    if (!flag) return -1;
    if (t == 2 && a + b == 2) return solve1();
}

Compilation message (stderr)

robots.cpp: In function 'int putaway(int, int, int, int*, int*, int*, int*)':
robots.cpp:36:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

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