#include <iostream> #include <stack> template<class T> struct range { range() {} range(T min, T max) : min(min) , max(max) {} T min, max; }; struct ProductionCapacity { range<int> width; range<int> height; }; bool operator>=(const ProductionCapacity &a, const ProductionCapacity &b) { return a.width.min <= b.width.min && a.width.max >= b.width.max && a.height.min <= b.height.min && a.height.max >= b.height.max; } int main() { std::ios_base::sync_with_stdio(0); int tests; std::cin >> tests; while (tests--) { int n; std::cin >> n; ProductionCapacity currentMajor; std::cin >> currentMajor.width.min >> currentMajor.width.max; std::cin >> currentMajor.height.min >> currentMajor.height.max; std::stack<ProductionCapacity> toMajorise; ProductionCapacity next; for (int i = 1; i < n; i++) { std::cin >> next.width.min >> next.width.max; std::cin >> next.height.min >> next.height.max; if (currentMajor >= next) continue; else { toMajorise.push(currentMajor); currentMajor = next; while (!toMajorise.empty() && currentMajor >= toMajorise.top()) toMajorise.pop(); } } while (!toMajorise.empty() && currentMajor >= toMajorise.top()) toMajorise.pop(); if (toMajorise.empty()) std::cout << "TAK\n"; else std::cout << "NIE\n"; } }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 | #include <iostream> #include <stack> template<class T> struct range { range() {} range(T min, T max) : min(min) , max(max) {} T min, max; }; struct ProductionCapacity { range<int> width; range<int> height; }; bool operator>=(const ProductionCapacity &a, const ProductionCapacity &b) { return a.width.min <= b.width.min && a.width.max >= b.width.max && a.height.min <= b.height.min && a.height.max >= b.height.max; } int main() { std::ios_base::sync_with_stdio(0); int tests; std::cin >> tests; while (tests--) { int n; std::cin >> n; ProductionCapacity currentMajor; std::cin >> currentMajor.width.min >> currentMajor.width.max; std::cin >> currentMajor.height.min >> currentMajor.height.max; std::stack<ProductionCapacity> toMajorise; ProductionCapacity next; for (int i = 1; i < n; i++) { std::cin >> next.width.min >> next.width.max; std::cin >> next.height.min >> next.height.max; if (currentMajor >= next) continue; else { toMajorise.push(currentMajor); currentMajor = next; while (!toMajorise.empty() && currentMajor >= toMajorise.top()) toMajorise.pop(); } } while (!toMajorise.empty() && currentMajor >= toMajorise.top()) toMajorise.pop(); if (toMajorise.empty()) std::cout << "TAK\n"; else std::cout << "NIE\n"; } } |