\n Given a set of line segments, the task is to divide the segments into groups such that no two segments in the same group overlap.
\n Each segment is defined by its starting point and endpoint. If there is an overlapping part between segments, they must belong to the same group,
\n while segments that do not overlap must belong to different groups.\n <\/p>\n
N<\/code> (1 \u2264 N \u2264 100,000).<\/li>\n- From the second line onwards,
N<\/code> lines are provided with the starting point l<\/code> and endpoint r<\/code> of each segment (l <= r<\/code>).<\/li>\n<\/ul>\nOutput<\/h3>\n
\n Print the total number of groups needed.\n <\/p>\n
Example Input<\/h3>\n\n 5\n 1 3\n 2 5\n 6 8\n 7 10\n 11 15\n <\/pre>\nExample Output<\/h3>\n\n 3\n <\/pre>\nDescription<\/h3>\n
\n Looking at the given segments, the first and second segments overlap and thus belong to the same group.
\n The third and fourth segments also overlap, so they belong to the same group,
\n while the last segment belongs to a different group, resulting in a total of 3 groups.\n <\/p>\n<\/div>\n
\nSolution Method<\/h2>\n
\n To solve this problem, a correct approach is to sort the segments first,
\n then sequentially compare overlapping segments to form groups.
\n The problem can be solved in the following steps.\n <\/p>\n
Step 1: Input<\/h3>\n
\n Input the segments as a list. Since each segment is a pair,
\n we will use the Pair<\/code> class to store the segments.\n <\/p>\nStep 2: Sort Segments<\/h3>\n
\n The criteria for sorting the segments is their starting point.
\n Sort in ascending order of starting points, and if starting points are the same, sort by the shorter endpoint first.\n <\/p>\n
Step 3: Grouping<\/h3>\n
\n Traverse the sorted list and check if the current segment overlaps with the last segment in the current group.
\n If they overlap, they belong to the same group; if they do not overlap, start a new group.\n <\/p>\n
Step 4: Output Result<\/h3>\n
\n Finally, count and print the number of groups.\n <\/p>\n
Code Example (Kotlin)<\/h3>\n\n data class Segment(val start: Int, val end: Int)\n\n fun countGroups(segments: List): Int {\n val sortedSegments = segments.sortedWith(compareBy({ it.start }, { it.end }))\n var groupCount = 0\n var maxEnd = -1\n\n for (segment in sortedSegments) {\n if (segment.start > maxEnd) {\n groupCount++\n maxEnd = segment.end\n } else {\n maxEnd = maxOf(maxEnd, segment.end)\n }\n }\n return groupCount\n }\n\n fun main() {\n val n = readLine()!!.toInt()\n val segments = List(n) {\n val (l, r) = readLine()!!.split(\" \").map { it.toInt() }\n Segment(l, r)\n }\n println(countGroups(segments))\n }\n <\/segment><\/pre>\nConclusion<\/h3>\n
\n Through this problem, we learned how to solve the line segment grouping issue.
\n We can effectively determine the number of groups using sorting and list traversal.
\n The code structure written in Kotlin shows high reusability and clarity,
\n confirming its suitability for this type of problem.
\n Since line segment problems frequently appear in coding tests,
\n it is advisable to practice similar problems.\n <\/p>\n<\/div>\n
<\/body><\/p>\n","protected":false},"excerpt":{"rendered":"