import std.stdio, std.string, std.conv; import std.range, std.algorithm, std.array, std.math, std.typecons; alias Enemy = Tuple!(int, "xl", int, "yu", int, "xr", int, "yd", int, "idx"); void main() { int n, xlb, xrb; scan(n, xlb, xrb); auto biim = new bool[](1281); auto es = new Enemy[](n); foreach (i ; 0 .. n) { int xl, yu, xr, yd; scan(xl, yu, xr, yd); es[i] = Enemy(xl, yu, xr, yd, i); } es.sort!"a.yd > b.yd"(); auto ans = new int[](n); foreach (i ; 0 .. n) { int hit; foreach (j ; max(0, es[i].xl) .. min(1280, es[i].xr + 1)) { if (!biim[j]) { hit = 1; } biim[j] = 1; } ans[es[i].idx] = hit; } writefln("%(%s\n%)", ans); } void scan(T...)(ref T args) { import std.stdio : readln; import std.algorithm : splitter; import std.conv : to; import std.range.primitives; auto line = readln().splitter(); foreach (ref arg; args) { arg = line.front.to!(typeof(arg)); line.popFront(); } assert(line.empty); } void fillAll(R, T)(ref R arr, T value) { static if (is(typeof(arr[] = value))) { arr[] = value; } else { foreach (ref e; arr) { fillAll(e, value); } } }