Is the bus load legal?

Question

I was in the bus today, and noticed this sign:

      seated    standing    wheelchairs
max1    37         30            00
max2    36         26            01
max3    34         32            00

The number of seated passengers, standees, and wheelchairs all have to be no larger than some row in the table. (See chat for details.)

For the purposes of this challenge we will generalise this idea: Given a non-negative integer list of a strictly positive length N (number of passenger types) and a non-negative integer matrix of strictly positive dimensions (N columns and one row per configuration, or the transpose of this), return a list of indices/truthy-falsies/two-unique-values indicating which configurations limits are fulfilled.

E.g. with the above matrix:
30,25,1 → [1] (0-indexed) [2] (1-indexed) or [false,true,false] (Boolean) or ["Abe","Bob","Abe"] (two unique values) etc.

The following test cases use the above matrix and the 0/1 for false/true:
[30,30,0] → [1,0,1]
[30,31,0] → [0,0,1]
[35,30,0] → [1,0,0]
[0,0,1] → [0,1,0]
[0,0,0] → [1,1,1]
[1,2,3] → [0,0,0]

The following test cases use the following matrix:
1 2 0 4
2 3 0 2

[1,2,1,2] → [0,0]
[1,3,0,1] → [0,1]
[1,2,0,3] → [1,0]
[1,2,0,1] → [1,1]

Answer 1

APL (Dyalog Unicode), 5 3 bytes

∧.≤

Try it online!

Answer 2

Haskell, 22 20 bytes

map.(or.).zipWith(>)

Returns False if legal and True if not.

Try it online!

Flipping True/False as return values saves 2 bytes (thanks @user202729!). With True for legal it's map.(and.).zipWith(<=) (22 bytes). Try it online!

Answer 3

Octave, 15 bytes

@(a,b)all(a>=b)

Try it online!

As per sundar's comment, omitting the transpose saves 2 bytes.

Answer 4

MATL, 3 bytes

<~A

Try it online!

Takes the input matrix as a transpose of the format in the question (as allowed by OP), with one column per configuration. Outputs boolean 0 and 1 for false and true.

Answer 5

R, 32 30 26 bytes

function(x,y)!colSums(x<y)

Try it online!

Accepts the matrix in transposed form as x, test config as y. Returns a vector of booleans.

Initial -2 bytes thanks to mnel, and further -4 by JayCe.

Answer 6

Jelly, 3 bytes

<Ẹ€

Try it online!

0 = True, 1 = False.

Answer 7

Ohm v2, 3 bytes

>Σy

Try it online!

Algorithm: vectorized > (greater than), Σ sum each, y sign.

Answer 8

JavaScript (ES6), 38 bytes

Takes input as (matrix)(vector). Returns a Boolean array.

m=>v=>m.map(r=>!r.some((t,x)=>v[x]>t))

Try it online!

Answer 9

Japt, 6 5 bytes

-1 bytes from @Shaggy

eȨVv

Try it online!

Answer 10

Haskell, 30 bytes

map.((.).(==)<*>(zipWith min))

Try it online!

Answer 11

Retina 0.8.2, 57 bytes

\d+
$*
;(?=.*;(.*))
;$1¶
%(+`,1*(1*)(;.*),\1$
$2
(1*);\1$

Try it online! Link includes test cases, but the output is all run together. Explanation:

\d+
$*

Convert to unary.

;(?=.*;(.*))
;$1¶

Give each row of the matrix its own copy of the list.

%(

Operate separately on each row of the matrix.

+`,1*(1*)(;.*),\1$
$2

Repeatedly remove the last number of the row and list while the last number of the row is at least as big as that of the list.

(1*);\1$

There should then be one number left in the list and the number in the row should be at least as big as that.

Answer 12

Python 2, 38 bytes

lambda m,l:[l==map(min,l,r)for r in m]

Try it online!

Answer 13

05AB1E, 5 bytes

εs<›P

Try it online or verify all test cases.

Explanation:

Unfortunately 05AB1E v1 doesn't have a 1-char builtin for ≤ or ≥, so I decrease each value instead before using ›. 05AB1E v2 which is currently in development will have these builtins.

ε        # For-each row of the (implicitly input) matrix:
 s       #  Swap, so the (implicitly input) list is at the top of the stack
  <      #  Decrease every value in the input-list by 1
         #   i.e. [30,25,1] → [29,24,0]
   ›     #  Check for each value in the matrix-row if they're larger
         #  than the input-list value at the same index
         #   i.e. [37,30,0] and [29,24,0] → [1,1,0]
    P    #  Then take the product of these checks
         #   i.e. [1,1,0] → 0

Answer 14

Stax, 8 bytes

â ╤┘µrφî

Run and debug it

Explanation:

mx\{:vm|A Full program, unpacked, implicit input
m         Map over rows of the matrix:
 x\         Zip with input array
   {  m     Map over result:
    :v        Check if non-increasing, i.e. matrix element greater than or equal to array element
       |A   All.
            Implicit output

Answer 15

Brachylog, 14 bytes

zzᵐ{≥₁ᵐ∧1|∧0}ᵐ

Try it online!

Answer 16

Wolfram Language (Mathematica), 18 bytes

Inner[Less,##,Or]&

Returns a list of two unique values: True means falsy, False means truthy.

Try it online!