CF. 1477D. Nezzar and Hidden Permutations(构造)
给定$m$个二元组$(a,b)$，求两个排列$p,q$，使得$\forall i\in[1,m]$，$(p_{a_i}-p_{b_i})(q_{a_i}-q_{b_i})>0$并最大化$\sum_i[p_i\neq q_i]$。
$n,m\leq 5\times 10^5$。
------------------------------------------------------------------------------------------------------------------------
很久以前的奇怪但现在依旧成立的签名
attack is our red sun $$\color{red}{\boxed{\color{red}{attack\ is\ our\ red\ sun}}}$$ ------------------------------------------------------------------------------------------------------------------------
很久以前的奇怪但现在依旧成立的签名
attack is our red sun $$\color{red}{\boxed{\color{red}{attack\ is\ our\ red\ sun}}}$$ ------------------------------------------------------------------------------------------------------------------------
