oj.uz

Submission #472537

# Submission time Handle Problem Language Result Execution time Memory
472537 2021-09-13T17:20:53 Z ZaZo_ Political Development (BOI17_politicaldevelopment) C++14
0 / 100
 578 ms 2212 KB 
#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)
{
  mx=max(min(cnt,k),mx);
  vis[node] = 1;
  if(cnt>k) return ;
  for(int i = 0 ; i < edges[node].size(); i ++)
  {
    if(!vis[edges[node][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

politicaldevelopment.cpp: In function 'void dfs(long long int, long long int)':
politicaldevelopment.cpp:13: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]
   13 |   for(int i = 0 ; i < edges[node].size(); i ++)
      |                   ~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1868 KB Output is correct
2 Correct 1 ms 1868 KB Output is correct
3 Correct 73 ms 2124 KB Output is correct
4 Correct 577 ms 2180 KB Output is correct
5 Correct 578 ms 2180 KB Output is correct
6 Correct 91 ms 2124 KB Output is correct
7 Correct 91 ms 2212 KB Output is correct
8 Correct 68 ms 1868 KB Output is correct
9 Correct 1 ms 1868 KB Output is correct
10 Incorrect 69 ms 1868 KB Output isn't correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1868 KB Output is correct
2 Correct 1 ms 1868 KB Output is correct
3 Correct 73 ms 2124 KB Output is correct
4 Correct 577 ms 2180 KB Output is correct
5 Correct 578 ms 2180 KB Output is correct
6 Correct 91 ms 2124 KB Output is correct
7 Correct 91 ms 2212 KB Output is correct
8 Correct 68 ms 1868 KB Output is correct
9 Correct 1 ms 1868 KB Output is correct
10 Incorrect 69 ms 1868 KB Output isn't correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 1868 KB Output is correct
2 Incorrect 2 ms 1868 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1868 KB Output is correct
2 Correct 1 ms 1868 KB Output is correct
3 Correct 73 ms 2124 KB Output is correct
4 Correct 577 ms 2180 KB Output is correct
5 Correct 578 ms 2180 KB Output is correct
6 Correct 91 ms 2124 KB Output is correct
7 Correct 91 ms 2212 KB Output is correct
8 Correct 68 ms 1868 KB Output is correct
9 Correct 1 ms 1868 KB Output is correct
10 Incorrect 69 ms 1868 KB Output isn't correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1868 KB Output is correct
2 Correct 1 ms 1868 KB Output is correct
3 Correct 73 ms 2124 KB Output is correct
4 Correct 577 ms 2180 KB Output is correct
5 Correct 578 ms 2180 KB Output is correct
6 Correct 91 ms 2124 KB Output is correct
7 Correct 91 ms 2212 KB Output is correct
8 Correct 68 ms 1868 KB Output is correct
9 Correct 1 ms 1868 KB Output is correct
10 Incorrect 69 ms 1868 KB Output isn't correct