A12131. Distinctification
编程题
普及/提高-
知识点
题目描述
The first line contains a single integer $n$ ( $1 \le n \le 2 \cdot 10^5$ ) — the number of pairs in sequence $P$ .
Next $n$ lines contain the elements of $P$ : $i$ -th of the next $n$ lines contains two integers $a_i$ and $b_i$ ( $1 \le a_i \le 2 \cdot 10^5$ , $1 \le b_i \le n$ ). It is guaranteed that all values of $b_i$ are pairwise distinct.
Next $n$ lines contain the elements of $P$ : $i$ -th of the next $n$ lines contains two integers $a_i$ and $b_i$ ( $1 \le a_i \le 2 \cdot 10^5$ , $1 \le b_i \le n$ ). It is guaranteed that all values of $b_i$ are pairwise distinct.
输入格式
Print $n$ integers — the $i$ -th number should be equal to $f(P_i)$ .
输出格式
无
输入输出样例
输入 #1
5 1 1 3 3 5 5 4 2 2 4
输出 #1
0 0 0 -5 -16
输入 #2
4 2 4 2 3 2 2 1 1
输出 #2
0 3 7 1