Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstdlib>
- #include <queue>
- #include <cstring>
- using namespace std;
- int n, grafo[1000][1000], vis[1000];
- void bfs() {
- queue<int> fila;
- fila.push(0);
- while(!fila.empty()) {
- int v = fila.front();
- fila.pop();
- vis[v] = 1;
- for(int i = 0; i < n; i++)
- if(grafo[v][i] && i != v && !vis[i])
- fila.push(i), vis[i] = 1;
- }
- }
- int main() {
- memset(vis, 0, sizeof vis);
- memset(grafo, 0, sizeof grafo);
- int d;
- cin >> n >> d;
- int a[n][2];
- for(int i = 0; i < n; i++)
- cin >> a[i][0] >> a[i][1];
- for(int i = 0; i < n; i++)
- for(int j = i + 1; j < n; j++)
- if((abs(a[i][0] - a[j][0]) * abs(a[i][0] - a[j][0]) + abs(a[i][1] - a[j][1]) * abs(a[i][1] - a[j][1])) <= (d * d))
- grafo[i][j] = grafo[j][i] = 1;
- bfs();
- for(int i = 0; i < n; i++)
- if(!vis[i]) {
- cout << "N" << endl;
- return 0;
- }
- cout << "S" << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement