search

OkazakiYumemi / okazakiyumemi.github.io

Maybe just a blog
https://okazakiyumemi.github.io/
0 stars 0 forks source link

「CF1396E」Distance Matching | Okazaki Yumemi's blog #123

Open OkazakiYumemi opened 4 years ago

OkazakiYumemi commented 4 years ago

https://okazakiyumemi.github.io/blog/CF1396E/

题意简述CF1396E 一棵树大小为 $n$（偶数）。将点两两配对，一对的权值为两点在树上的距离。求方案时所有对的权值和为 $K$。$n\le 10^5$，需判断无解。