// need #include #include // data structure #include #include #include #include #include #include #include #include #include //#include #include // stream //#include //#include //#include #include // etc #include #include #include #include #include #include #include // input #define INIT std::ios::sync_with_stdio(false);std::cin.tie(0); #define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__); template void MACRO_VAR_Scan(T& t) { std::cin >> t; } templatevoid MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); } #define VEC_ROW(type, n, ...)std::vector __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); } templatevoid MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); } template void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; } templatevoid MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); } #define VEC(type, c, n) std::vector c(n);for(auto& i:c)std::cin>>i; #define MAT(type, c, m, n) std::vector> c(m, std::vector(n));for(auto& r:c)for(auto& i:r)std::cin>>i; // output #define OUT(d) std::cout<<(d); #define FOUT(n, d) std::cout<=(a);--i) #define REP(i, n) for(int i=0;i=0;--i) #define FORLL(i, a, b) for(ll i=ll(a);i=ll(a);--i) #define REPLL(i, n) for(ll i=0;i=0;--i) #define IN(a, x, b) (a<=x && x inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; } template inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; } #define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]" #define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;} void CHECKTIME(std::function f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast((end - start)).count(); std::cerr << "[Time:" << res << "ns (" << res / (1.0e9) << "s)]\n"; } // test template std::vector> VV(int n, int m, T init = T()) { return std::vector>(n, std::vector(m, init)); } template std::ostream& operator<<(std::ostream& os, std::pair p) { os << "(" << p.first << ", " << p.second << ")"; return os; } // type/const //#define int ll using ll = long long; using ull = unsigned long long; using ld = long double; using PAIR = std::pair; using PAIRLL = std::pair; constexpr int INFINT = 1 << 30; // 1.07x10^ 9 constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9 constexpr ll INFLL = 1LL << 60; // 1.15x10^18 constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18 constexpr double EPS = 1e-9; constexpr int MOD = 1000000007; constexpr double PI = 3.141592653589793238462643383279; template void FILL(T(&a)[N], const T& val) { for (auto& x : a) x = val; } template void FILL(ARY(&a)[N][M], const T& val) { for (auto& b : a) FILL(b, val); } template void FILL(std::vector& a, const T& val) { for (auto& x : a) x = val; } template void FILL(std::vector>& a, const T& val) { for (auto& b : a) FILL(b, val); } // ------------>8------------------------------------->8------------ // Description: 区間をsetで管理するデータ構造(なお実装はmap).各クエリO(log区間数). // #### attention! : [l, r] ( include r, not [l, r) ) class SegmentMap : public std::map { private: bool flagToMergeAdjacentSegment; public: // if merge [l, c] and [c+1, r], set flagToMergeAdjacentSegment to true SegmentMap(bool flagToMergeAdjacentSegment) : flagToMergeAdjacentSegment(flagToMergeAdjacentSegment) {} // __exist -> iterator pair(l, r) (contain p) // noexist -> map.end() auto get(signed p) const { auto it = upper_bound(p); if (it == begin() || (--it)->second < p) return end(); return it; } // insert segment [l, r] void insert(signed l, signed r) { auto itl = upper_bound(l), itr = upper_bound(r + flagToMergeAdjacentSegment); if (itl != begin()) { if ((--itl)->second < l - flagToMergeAdjacentSegment) ++itl; } if (itl != itr) { l = std::min(l, itl->first); r = std::max(r, std::prev(itr)->second); erase(itl, itr); } (*this)[l] = r; } // remove segment [l, r] void remove(signed l, signed r) { auto itl = upper_bound(l), itr = upper_bound(r); if (itl != begin()) { if ((--itl)->second < l) ++itl; } if (itl == itr) return; int tl = std::min(l, itl->first), tr = std::max(r, std::prev(itr)->second); erase(itl, itr); if (tl < l) (*this)[tl] = l - 1; if (r < tr) (*this)[r + 1] = tr; } // Is p and q in same segment? bool same(signed p, signed q) const { const auto&& it = get(p); return it != end() && it->first <= q && q <= it->second; } }; signed main() { INIT; VAR(int, n, xlb, xrb); struct D { int l, u, r, d, i; }; std::vector d(n); REP(i, n) { std::cin >> d[i].l >> d[i].u >> d[i].r >> d[i].d; d[i].i = i; } std::sort(ALL(d), [&](D& l, D& r) {return l.d > r.d; }); SegmentMap sm(true); std::vector ans(n, 0); REP(i, n) { auto& t(d[i]); if (t.r < xlb || xrb < t.l) continue; CHMAX(t.l, xlb); CHMIN(t.r, xrb); auto it = sm.get(t.l); if (it == sm.end()) { ans[t.i] = 1; } else { if (t.r > it->second) ans[t.i] = 1; } if(t.l <= t.r) sm.insert(t.l, t.r); } REP(i, n) { OUT(ans[i])BR; } return 0; }