As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
给定 $n$ 个区间 $[l_i, r_i]$。如果两个区间相交，则在它们之间添加一条无向无权边。
令 $d(i, j)$ 为第 $i$ 个区间与第 $j$ 个区间之间的最短路径长度。如果从 $i$ 到 $j$ 没有路径，则 $d(i, j) = 0$。
对于 $i = 1, 2, \dots, n$，输出 $\sum_{j=1}^n d(i, j)$。
第一行包含一个整数 $n$ ($1 \le n \le 2 \times 10^5$)。
接下来的 $n$ 行，每行包含两个整数 $l_i, r_i$ ($1 \le l_i < r_i \le 2n$)。保证所有区间的端点互不相同。
输出 $n$ 行，每行对应 $i = 1, 2, \dots, n$ 的答案。
5 2 3 6 7 1 9 5 10 4 8
7 5 4 5 5
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: