제출 #1143137

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1143137		yusyboss	새로운 문제 (POI13_luk)	C++20	0 / 100	148 ms	17648 KiB

luk

#include <bits/stdc++.h>
#define NMAX 300000

using namespace std;

vector <int> vsons[NMAX + 1];
bool isVisited[NMAX + 1];
int vCountLevel[NMAX + 1];

int sol;

void dfs(int node, int level) {
  int i, nsons;

  isVisited[node] = 1;

  vCountLevel[level]++;
  sol = max(sol, vCountLevel[level]);


  nsons = vsons[node].size();
  for (i = 0; i < nsons; i++) {
    int newnode = vsons[node][i];

    if (!isVisited[newnode])
      dfs(newnode, level + 1);
  }
}

int main() {
  int n, i, x, y;
  cin >> n;

  for (i = 0; i < n - 1; i++) {
    cin >> x >> y;
    vsons[x].push_back(y);
    vsons[y].push_back(x);
  }

  if (n == 1)
    cout << 0;
  else {
    dfs(1, 0);
    cout << sol;
  }
  return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10