Tiling a Manhattan Polyomino with Bars

A Manhattan polyomino, is a finite union of integer rectangles put on a same line. We give a simple characterization of Manhattan polyominoes which can be tiled by rectangles {1 × p, q, × 1} and consequently a linear time (with short encoding) algorithm to decide if a Manhatan polyomino is tilable by {1 × p, q, × 1}.