D. Nearest Excluded Points

D. Nearest Excluded Points

BFS

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <set>
#include <map>
#include <queue>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};

int main() 
{  
    int n;
    cin >> n;
    vector<PII> a(n);
//    for (auto &[x, y] : a) cin >> x >> y;
	for(int i = 0; i < n; i ++)
	{
		int x, y;
		cin >> x >> y;
		a[i] = {x, y};
	}
    
    set<PII> st(a.begin(), a.end());
    map<PII, PII> ans;
    queue<PII> q;
    for (int i = 0; i < n; i ++) {
    	int x = a[i].first, y = a[i].second;
        for (int i = 0; i < 4; ++i) {
            int nx = x + dx[i], ny = y + dy[i];
            if (st.count({nx, ny})) {
                continue;
            }
            ans[{x, y}] = {nx, ny};
            q.push({x, y});
            break;
        }
    }
    
    while (!q.empty()) {
        int x = q.front().first, y = q.front().second;
        q.pop();
        for (int i = 0; i < 4; ++i) {
            int nx = x + dx[i], ny = y + dy[i];
            if (!st.count({nx, ny}) || ans.count({nx, ny})) {
                continue;
            }
            ans[{nx, ny}] = ans[{x, y}];
            q.push({nx, ny});
        }
    }
    
    for (int i = 0; i < n; i ++) {
    	int x = a[i].first, y = a[i].second;
        auto it = ans[{x, y}];
        printf("%d %d\n", it.first, it.second);
    }
    
    return 0;
}