Submission #472546

#	Time	Username	Problem	Language	Result	Execution time	Memory
472546		ZaZo_	Political Development (BOI17_politicaldevelopment)	C++14	4 / 100	1339 ms	2220 KiB

politicaldevelopment

#include <bits/stdc++.h>
#define ZAZO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
using namespace std;
vector<int>edges[50001];
int vis[50001]={0};
int mx=1,n,k;
void dfs(int node , int cnt)
{
  if(vis[node])
  {
    mx=max(min(cnt,k),mx);
    return ;
  }
  vis[node] = 1;
  if(mx>k) return ;
  for(int i = 0 ; i < edges[node].size(); i ++)
  {
      dfs(edges[node][i],cnt+1);
  }
}
int32_t main() {
  ZAZO
  cin >> n >> k ;
  for(int i = 0 ; i < n ; i ++)
  {
    int d;
    cin>>d;
    for(int j = 0 ; j < d ; j ++)
    {
      int x; cin>>x;
      edges[i].push_back(x);
      edges[x].push_back(i);
    }
  }
  for(int i = 0 ; i < n ; i ++)
  {
    dfs(i,0);
    memset(vis,0,sizeof vis);
  }
  cout<<mx<<endl;
}

Compilation message (stderr)

politicaldevelopment.cpp: In function 'void dfs(long long int, long long int)':
politicaldevelopment.cpp:17:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |   for(int i = 0 ; i < edges[node].size(); i ++)
      |                   ~~^~~~~~~~~~~~~~~~~~~~

• Subtask 1: 4 / 4
• Subtask 2: 0 / 12
• Subtask 3: 0 / 23
• Subtask 4: 0 / 38
• Subtask 5: 0 / 23