-
Notifications
You must be signed in to change notification settings - Fork 0
/
1094.cpp
71 lines (66 loc) · 1.16 KB
/
1094.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
typedef struct node
{
int id;
int level;
vector<int> children;
}node;
node records[100];
int N, M;
int maxnum = 1, maxlevel = 1;
void set_level()
{
queue<int> pQueue, cQueue;
int id;
records[1].level = 1;
pQueue.push(1);
while (!pQueue.empty())
{
while (!pQueue.empty())
{
cQueue.push(pQueue.front());
pQueue.pop();
}
while (!cQueue.empty())
{
id = cQueue.front();
cQueue.pop();
for (int i = 0; i != records[id].children.size(); ++i)
{
records[records[id].children.at(i)].level = records[id].level+1;
pQueue.push(records[id].children.at(i));
}
}
if (maxnum < pQueue.size())
{
maxlevel = records[id].level+1;
maxnum = pQueue.size();
}
}
}
int main()
{
int parent, child, num;
scanf("%d %d", &N, &M);
for (int i = 0; i != N; ++i)
{
records[i].id = i;
}
for (int i = 0; i != M; ++i)
{
scanf("%d %d", &parent, &num);
for (int j = 0; j != num; ++j)
{
scanf("%d", &child);
records[parent].children.push_back(child);
}
}
set_level();
printf("%d %d\n", maxnum, maxlevel);
system("pause");
return 0;
}