https://111qqz.com/en/tags/kd-tree/Recent content in Kd-Tree on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzTue, 10 Oct 2017 06:58:32 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-10-10-bzoj2648/Tue, 10 Oct 2017 06:58:32 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-10-10-bzoj2648/<h2 class="relative group">Description <div id="description" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#description" aria-label="Anchor">#</a> </span> </h2> <p>这天，SJY显得无聊。在家自己玩。在一个棋盘上，有N个黑色棋子。他每次要么放到棋盘上一个黑色棋子，要么放上一个白色棋子，如果是白色棋子，他会找出距离这个白色棋子最近的黑色棋子。此处的距离是 曼哈顿距离 即(|x1-x2|+|y1-y2|) 。现在给出N&lt;=500000个初始棋子。和M&lt;=500000个操作。对于每个白色棋子，输出距离这个白色棋子最近的黑色棋子的距离。同一个格子可能有多个棋子。</p>https://111qqz.com/en/post/acm-icpc/2017/2017-10-10-bzoj2716/Tue, 10 Oct 2017 06:49:55 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-10-10-bzoj2716/<h2 class="relative group"><a href="http://www.lydsy.com/JudgeOnline/problem.php?id=2716" target="_blank" rel="noreferrer">题目链接</a> <div id="题目链接" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e7%9b%ae%e9%93%be%e6%8e%a5" aria-label="Anchor">#</a> </span> </h2> <h2 class="relative group">Description <div id="description" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#description" aria-label="Anchor">#</a> </span> </h2> <figure><img class="my-0 rounded-md" loading="lazy" decoding="async" fetchpriority="low" alt="" src="http://www.lydsy.com/JudgeOnline/upload/201204/T3des%282%29.gif" ></figure> <h2 class="relative group">Input <div id="input" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#input" aria-label="Anchor">#</a> </span> </h2> <figure><img class="my-0 rounded-md" loading="lazy" decoding="async" fetchpriority="low" alt="" src="http://www.lydsy.com/JudgeOnline/upload/201204/T3input%282%29.gif" ></figure> <h2 class="relative group">Output <div id="output" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#output" aria-label="Anchor">#</a> </span> </h2> <figure><img class="my-0 rounded-md" loading="lazy" decoding="async" fetchpriority="low" alt="" src="http://www.lydsy.com/JudgeOnline/upload/201204/T3output%282%29.gif" ></figure> <p>样例太长了，就不写了。</p>https://111qqz.com/en/post/acm-icpc/2017/2017-10-09-hdu4347/Mon, 09 Oct 2017 06:01:23 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-10-09-hdu4347/<p><a href="http://acm.split.hdu.edu.cn/showproblem.php?pid=4347" target="_blank" rel="noreferrer">题目链接</a></p> <h1 class="relative group">题意： <div id="题意" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor">#</a> </span> </h1> <p>给出若干个点，在给出一个定点，求距离该定点最近的m个点。</p>https://111qqz.com/en/post/acm-icpc/2017/2017-10-08-hdu-5992/Sun, 08 Oct 2017 12:55:55 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-10-08-hdu-5992/<p><a href="http://acm.split.hdu.edu.cn/showproblem.php?pid=5992" target="_blank" rel="noreferrer">题目链接</a></p> <h1 class="relative group">题意： <div id="题意" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor">#</a> </span> </h1> <p>有若干个(2E5)旅馆，分别给出旅馆的坐标和价格。有m个查询，每个查询给出一个人的位置(x0,y0),以及其能接受的最高价格。问在该人能接受的价格内，距离其最近的旅馆的坐标和价格是多少。</p>https://111qqz.com/en/post/acm-icpc/2017/2017-10-08-hdu-2966/Sun, 08 Oct 2017 11:53:35 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-10-08-hdu-2966/<p>题目链接：<a href="http://acm.split.hdu.edu.cn/showproblem.php?pid=2966" target="_blank" rel="noreferrer">hdu2966  </a></p> <h1 class="relative group">题意： <div id="题意" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor">#</a> </span> </h1> <p>给出二维平面上n(1E5)个点，问对于每个点，其他距离其最近的点的距离是多少。</p>https://111qqz.com/en/post/acm-icpc/2017/2017-10-08-kd-tree-notes/Sun, 08 Oct 2017 11:46:46 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-10-08-kd-tree-notes/<p>老规矩，资料先行。</p> <p>好久没学新算法了，有点忘记怎么学了orz</p> <p><a href="http://blog.csdn.net/zhjchengfeng5/article/details/7855241" target="_blank" rel="noreferrer">K-D tree 数据结构</a></p>