24479

#include<iostream>
#include<string.h>
#include<math.h>
#include<cmath>
#include<stack>
#include<algorithm>
#include<vector>
using namespace std;
vector<int> graph[100001];
int visited[100001] = { 0, };
int result[100001];
int cnt = 0;
void dfs(int r){
  if(visited[r] == 1){
    return;
  }
  visited[r] = 1;
  cnt++;
  result[r] = cnt;
  for(int i = 0; i< graph[r].size();i++){
    dfs(graph[r][i]);
  }
}

int main(){
  int n,m,r;
  cin >> n >> m >> r;
  for(int i = 1; i<=m; i++){
    int a,b;
    cin >> a >> b;
    graph[a].push_back(b);
    graph[b].push_back(a);
  }
  for(int i = 1; i<=n;i++){
    sort(graph[i].begin(),graph[i].end());
  }
  dfs(r);
  for(int i = 1; i<=n;i++){
    cout << result[i] << "\\n";
  }
}

24444

7562

#include<iostream>
#include<string.h>
#include<math.h>
#include<cmath>
#include<stack>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
vector<int> graph[100001];
int visited[100001] = { 0, };
int result[100001];
int cnt = 0;
void bfs(int r){
  queue<int> q;
  q.push(r);
  visited[r] = 1;
  cnt++;
  result[r] = cnt;
  while(!q.empty()){
    int inq = q.front();
    q.pop();
    for(int i=0;i<graph[inq].size();i++){
      int temp = graph[inq][i];
      if(!visited[temp]){
        cnt++;
        result[temp] = cnt;
        q.push(temp);
        visited[temp] = 1;
      }
    }
  }
}

int main(){
  int n,m,r;
  cin >> n >> m >> r;
  for(int i = 1; i<=m; i++){
    int a,b;
    cin >> a >> b;
    graph[a].push_back(b);
    graph[b].push_back(a);
  }
  for(int i = 1; i<=n;i++){
    sort(graph[i].begin(),graph[i].end());
  }
  bfs(r);
  for(int i = 1; i<=n;i++){
    cout << result[i] << "\\n";
  }
}

7562

#include <iostream>
#include <queue>

using namespace std;
#define MAX 301

int T,I;
int current_x,current_y,target_x,target_y;
int arr[MAX][MAX];
int visited[MAX][MAX];
int dx[] = {1,2,2,1,-1,-2,-2,-1};
int dy[] = {2,1,-1,-2,-2,-1,1,2};
queue<pair<int,int>> q;

void reset() {
  while (!q.empty()) q.pop();
  for (int i = 0; i < MAX; i++) {
    for (int j = 0; j < MAX; j++) {
      visited[i][j] = 0;
      arr[i][j] = 0;
    }
  }
}

void bfs(int x,int y) {
    q.push({x,y});
    visited[x][y]=true;
    while(!q.empty()) {
        int a = q.front().first;
        int b = q.front().second;
        q.pop();
        if(a==target_x && b==target_y) {
            cout <<arr[a][b] << "\\n";
            while(!q.empty()) {
                q.pop();
            }
            break;
        }
        for(int i=0;i<8;i++) {
            int na = a + dx[i];
            int nb = b + dy[i];
            if(0<=na && 0<=nb && na <I && nb < I && !visited[na][nb]) {
                q.push({na,nb});
                visited[na][nb]=true;
                arr[na][nb]=arr[a][b]+1;
            }
        }
    }
}

int main() {
    cin >> T;
    for(int i=0;i<T;i++) {
        cin >> I;
        cin >> current_x >> current_y;
        cin >> target_x >> target_y;

        bfs(current_x,current_y);
        reset();
    }
}