#include <cstdint> #include <cstdio> #include <ranges> #include <set> struct Range { Range(const uint64_t l, const uint64_t r) : left(l), right(r) {} bool operator<(const Range& range) const { return left < range.left; } uint64_t left, right; }; std::set<Range> merge(const std::set<Range>& ranges) { std::set<Range> outRanges; std::optional<Range> lastRange; for (const auto& range : ranges) { if (lastRange.has_value()) { if (lastRange->right + 1 == range.left) { lastRange->right = range.right; } else { outRanges.insert(lastRange.value()); lastRange = range; } } else { lastRange = range; } } outRanges.insert(lastRange.value()); return outRanges; } std::optional<uint64_t> fromLeft(const uint64_t n, const uint64_t s, std::set<Range>& ranges) { std::optional<uint64_t> result; for (const auto& range : ranges) { if (s < range.left) { break; } else if (1 < range.left) { result = range.left - 1; } } return result; } std::optional<uint64_t> fromRight(const uint64_t n, const uint64_t s, std::set<Range>& ranges) { std::optional<uint64_t> result; for (const auto& range : ranges | std::views::reverse) { if (range.right < s) { break; } else if (range.right < n) { result = range.right + 1; } } return result; } int main() { std::set<Range> ranges; uint64_t n, m, s, l, r; scanf("%lu %lu %lu\n", &n, &m, &s); for (int i = 0; i < m; ++i) { scanf("%lu %lu\n", &l, &r); ranges.emplace(l, r); } ranges = merge(ranges); const auto left = fromLeft(n, s, ranges); const auto right = fromRight(n, s, ranges); if (left.has_value() && right.has_value()) { if (s - left.value() <= right.value() - s) { printf("%lu\n", left.value()); } else { printf("%lu\n", right.value()); } } else if (left.has_value()) { printf("%lu\n", left.value()); } else if (right.has_value()) { printf("%lu\n", right.value()); } return 0; }
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 74 75 76 77 78 79 | #include <cstdint> #include <cstdio> #include <ranges> #include <set> struct Range { Range(const uint64_t l, const uint64_t r) : left(l), right(r) {} bool operator<(const Range& range) const { return left < range.left; } uint64_t left, right; }; std::set<Range> merge(const std::set<Range>& ranges) { std::set<Range> outRanges; std::optional<Range> lastRange; for (const auto& range : ranges) { if (lastRange.has_value()) { if (lastRange->right + 1 == range.left) { lastRange->right = range.right; } else { outRanges.insert(lastRange.value()); lastRange = range; } } else { lastRange = range; } } outRanges.insert(lastRange.value()); return outRanges; } std::optional<uint64_t> fromLeft(const uint64_t n, const uint64_t s, std::set<Range>& ranges) { std::optional<uint64_t> result; for (const auto& range : ranges) { if (s < range.left) { break; } else if (1 < range.left) { result = range.left - 1; } } return result; } std::optional<uint64_t> fromRight(const uint64_t n, const uint64_t s, std::set<Range>& ranges) { std::optional<uint64_t> result; for (const auto& range : ranges | std::views::reverse) { if (range.right < s) { break; } else if (range.right < n) { result = range.right + 1; } } return result; } int main() { std::set<Range> ranges; uint64_t n, m, s, l, r; scanf("%lu %lu %lu\n", &n, &m, &s); for (int i = 0; i < m; ++i) { scanf("%lu %lu\n", &l, &r); ranges.emplace(l, r); } ranges = merge(ranges); const auto left = fromLeft(n, s, ranges); const auto right = fromRight(n, s, ranges); if (left.has_value() && right.has_value()) { if (s - left.value() <= right.value() - s) { printf("%lu\n", left.value()); } else { printf("%lu\n", right.value()); } } else if (left.has_value()) { printf("%lu\n", left.value()); } else if (right.has_value()) { printf("%lu\n", right.value()); } return 0; } |