062D
abc062d <优先队列>
[D - 3N Numbers](https://atcoder.jp/contests/abc062/tasks/arc074_b) [参考](https://blog.csdn.net/awow80285/article/details/101550652) ``` // https://atc ......
[atAGC062D]Walk Around Neighborhood
记$D=\max_{1\le i\le n}d_{i}$,则无解当且仅当$2D>\sum_{i=1}^{n}d_{i}$ **结论:**$\forall (x,y),\exists (X,Y),\begin{cases}|X|+|Y|=R\\|x-X|+|y-Y|=d\end{cases}$ 当且仅 ......