Problem p02678 (C++)

Buggy submission (status: Runtime Error):
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr int inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */

/* --------------------テンプレート------------------ */
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
/* ----------------------end----------------------- */

/* --------------------ライブラリ-------------------- */
ll fact(int i) { // 階乗
  if (i == 0)
    return 1;
  return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) { // 最大公約数
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
ll lcm(ll a, ll b) { // 最小公倍数
  return a * b / gcd(a, b);
}
int keta(ll n) { // 桁数を求める
  if (n == 0)
    return 1;
  int count = 0;
  while (n != 0) {
    n /= 10;
    count++;
  }
  return count;
}
ll ketasum(ll n) { // 各桁の和
  ll sum = 0;
  while (n != 0) {
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
bool isprime(int n) { // 素数判定
  if (n == 1)
    return false;
  if (n == 2)
    return true;
  for (int i = 2; i <= sqrt(n); i++) {
    if (n % i == 0)
      return false;
  }
  return true;
}
/* ----------------------end----------------------- */
#pragma endregion
int n, m;
int ans[114514];
signed main() {
  cin >> n >> m;
  vvi v(m);
  rep(i, m) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    v[a].pb(b);
    v[b].pb(a);
  }
  queue<int> que;
  que.push(0);
  ans[0] = inf;
  while (!que.empty()) {
    int p = que.front();
    // cout << "p:" << p+1 << endl;
    que.pop();
    for (auto i : v[p]) {
      if (ans[i] != 0)
        continue;
      // cout << i+1 << "\n";
      ans[i] = p + 1;
      que.push(i);
    }
  }
  rep1(i, n - 1) {
    if (ans[i] == 0) {
      cout << "No" << endl;
      return 0;
    }
  }
  cout << "Yes" << endl;
  rep1(i, n - 1) cout << ans[i] << endl;
  return 0;
}

Fixed submission:
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr int inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */

/* --------------------テンプレート------------------ */
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
/* ----------------------end----------------------- */

/* --------------------ライブラリ-------------------- */
ll fact(int i) { // 階乗
  if (i == 0)
    return 1;
  return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) { // 最大公約数
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
ll lcm(ll a, ll b) { // 最小公倍数
  return a * b / gcd(a, b);
}
int keta(ll n) { // 桁数を求める
  if (n == 0)
    return 1;
  int count = 0;
  while (n != 0) {
    n /= 10;
    count++;
  }
  return count;
}
ll ketasum(ll n) { // 各桁の和
  ll sum = 0;
  while (n != 0) {
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
bool isprime(int n) { // 素数判定
  if (n == 1)
    return false;
  if (n == 2)
    return true;
  for (int i = 2; i <= sqrt(n); i++) {
    if (n % i == 0)
      return false;
  }
  return true;
}
/* ----------------------end----------------------- */
#pragma endregion
int n, m;
int ans[114514];
signed main() {
  cin >> n >> m;
  vvi v(214514);
  rep(i, m) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    v[a].pb(b);
    v[b].pb(a);
  }
  queue<int> que;
  que.push(0);
  ans[0] = inf;
  while (!que.empty()) {
    int p = que.front();
    // cout << "p:" << p+1 << endl;
    que.pop();
    for (auto i : v[p]) {
      if (ans[i] != 0)
        continue;
      // cout << i+1 << "\n";
      ans[i] = p + 1;
      que.push(i);
    }
  }
  rep1(i, n - 1) {
    if (ans[i] == 0) {
      cout << "No" << endl;
      return 0;
    }
  }
  cout << "Yes" << endl;
  rep1(i, n - 1) cout << ans[i] << endl;
  return 0;
}