Educational Codeforces Round 124 (Rated for Div. 2)D. Nearest Excluded Points

一开始从标记点开始bfs ole 了，然后从空点开始就过了

原题链接Problem - D - Codeforces

#include<iostream>
#include<queue>
#include<utility>
#include<map>
using namespace std;
typedef pair<int,int>pii;
map<pii,pii>ans;
map<pii,int>id;
map<pii,pii>root;
queue<pii> m;
pii p[200001];
int px[4]= {1,0,-1,0};
int py[4]= {0,1,0,-1};
int main() {
   int n,i,j,k;
   cin>>n;
   for(i=0; i<n; i++)cin>>p[i].first>>p[i].second,id[p[i]]=1;
   for(i=0; i<n; i++) {
       for(j=0; j<4; j++) {
int dx=px[j]+p[i].first;
int dy=py[j]+p[i].second;
pii t=make_pair(dx,dy);
if(!id.count(t))//将空点存入队列
{
    root[t]=t;
    m.push(t);
           }
       }
   }
   while(ans.size()<n)
   {
       for(i=0;i<4;i++)
       {
           int dx=px[i]+m.front().first;
           int dy=py[i]+m.front().second;
           pii o=make_pair(dx,dy);
           if(!ans.count(o)&&id.count(o))//第一次找到的答案为最佳
           {
               root[o]=root[m.front()];
               ans[o]=root[o];
               m.push(o);
           }
       }
       m.pop();
   }
   for(i=0;i<n;i++)printf("%d %d\n",ans[p[i]].first,ans[p[i]].second);
}

Educational Codeforces Round 124 (Rated for Div. 2)D. Nearest Excluded Points相关推荐

Educational Codeforces Round 124 (Rated for Div. 2)
Dashboard - Educational Codeforces Round 124 (Rated for Div. 2) - Codeforceshttps://codeforces.com/c ...
Educational Codeforces Round 114 (Rated for Div. 2) （A ~ F）全题解
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划 Educational Codeforces Round 114 (Rated for Div. 2) ...
Educational Codeforces Round 106 (Rated for Div. 2)（A ~ E）题解（每日训练 Day.16 ）
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划目录 Educational Codeforces Round 106 (Rated for Div. ...
Educational Codeforces Round 37 (Rated for Div. 2) 1
Educational Codeforces Round 37 (Rated for Div. 2) A.Water The Garden 题意:Max想给花园浇水.花园可被视为长度为n的花园床,花园 ...
Educational Codeforces Round 90 (Rated for Div. 2)（A, B, C, D, E）
Educational Codeforces Round 90 (Rated for Div. 2) Donut Shops 思路分三种情况: a==c/ba == c / ba==c/b这个时候两 ...
Educational Codeforces Round 89 (Rated for Div. 2)（A, B, C, D）
Educational Codeforces Round 89 (Rated for Div. 2) A. Shovels and Swords 思路题意非常简单,就是得到最多的物品嘛,我们假定a, ...
Educational Codeforces Round 114 (Rated for Div. 2) D. The Strongest Build 暴力 + bfs
传送门文章目录题意: 思路: 题意: 你有nnn个装备槽,每个槽里面有cic_ici个力量加成,对于每个槽只能选一个力量加成,现在给你mmm个力量组合[b1,b2,...,bn][b_1,b_2 ...
Educational Codeforces Round 72 (Rated for Div. 2) D. Coloring Edges dfs树/拓扑找环
传送门文章目录题意: 思路: 题意: 给你一张图,你需要给这个图的边染色,保证如果有环那么这个环内边的颜色不全相同,输出染色方案和用的颜色个数. n,m≤5e3n,m\le5e3n,m≤5e3 思 ...
Educational Codeforces Round 111 (Rated for Div. 2) D. Excellent Arrays 组合数学
传送门文章目录题意: 思路: 题意: 给你一个数组aia_iai,定义一个数组是好的当且仅当对于所有iii都有ai!=ia_i!=iai!=i.定义f(a)f(a)f(a)表示数组aaa中i& ...

Educational Codeforces Round 124 (Rated for Div. 2)D. Nearest Excluded Points

Educational Codeforces Round 124 (Rated for Div. 2)D. Nearest Excluded Points相关推荐

最新文章

热门文章