Submission #41950050

---

Source Code Expand

#include <iostream>
#include <vector>
#include <list>
#include <string>
#include <set>
#include <unordered_set>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <algorithm>
using namespace std;

struct Node
{
    int i;
    int x;
    int y;
    vector<int> children;
};


int main (void) {
    int n, d;
    cin >> n >> d;
    vector<Node> people(n);
    for (int i=0; i<n; i++) {
        int x, y;
        cin >> x >> y;
        people[i].i = i;
        people[i].x = x;
        people[i].y = y;
        people[i].children = {};
    }
    // for (int i=0; i<n; i++) {
    //     printf("%d, %d\n", people[i].x, people[i].y);
    // }
    for (int i=0; i<n; i++) {
        for (int j=i+1; j<n; j++) {
            int dx = people[i].x - people[j].x;
            int dy = people[i].y - people[j].y;
            // printf("(%d, %d), dx: %d, dy: %d\n", i, j, dx, dy);
            if (dx*dx+dy*dy <= d*d) {
                people[i].children.push_back(j);
                people[j].children.push_back(i);
            }
        }
    }
    vector<int> stack = { 0 };
    vector<bool> visited(n, false);
    visited[0] = true;
    while (true) {
        if (stack.empty()) {
            break;
        }
        int current = stack.back();
        stack.pop_back();
        for (const auto& person : people[current].children) {
            if (!visited[person]) {
                stack.push_back(person);
                visited[person] = true;
            }
        }
    }
    for (int i=0; i<n; i++) {
        if (visited[i]) {
            cout << "Yes" << endl;
        } else {
            cout << "No" << endl;
        }
    }
    return 0;
}

Submission Info

Judge Result