FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
timus_cpp/task_1837.cpp at master · artbataev/timus_cpp · GitHub
artbataev
/
timus_cpp
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
1
Code
Issues
0
Pull requests
2
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
timus_cpp
/
task_1837.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
81 lines (72 loc) · 2.37 KB
Breadcrumbs
timus_cpp
/
task_1837.cpp
Copy path
File metadata and controls
81 lines (72 loc) · 2.37 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
72
73
74
75
76
77
78
79
80
81
#
include
<
iostream
>
#
include
<
map
>
#
include
<
set
>
#
include
<
string
>
#
include
<
algorithm
>
#
include
<
queue
>
#
include
<
array
>
static
const
std::string
MAIN_MEMBER
=
"
Isenbaev
"
;
using
TeamType = std::array<std::string,
3
>;
using
IsenbaevsNumbersType = std::map<std::string,
int
>;
std::istream&
operator
>>(std::istream& stream, TeamType& team) {
stream >> team[
0
] >> team[
1
] >> team[
2
];
return
stream;
}
std::ostream&
operator
<<(std::ostream& stream,
const
IsenbaevsNumbersType& isenbaevs_numbers) {
for
(
const
auto
&[member, number]: isenbaevs_numbers) {
stream << member <<
"
"
;
if
(number <
0
) {
stream <<
"
undefined
"
;
}
else
{
stream << number;
}
stream << std::endl;
}
return
stream;
}
template
<
typename
Key>
std::map<Key,
int
>
compute_distance
(
const
std::map<Key, std::set<Key>>& graph,
const
Key& root) {
//
Breadth-first search
std::map<Key,
int
> distances;
std::queue<Key> elements_to_update_neighbours;
for
(
const
auto
&[element, _]: graph) {
distances[element] = -
1
;
}
if
(graph.
count
(root) >
0
) {
//
if Isenbaev was in teams
distances[
MAIN_MEMBER
] =
0
;
elements_to_update_neighbours.
push
(
MAIN_MEMBER
);
}
while
(!elements_to_update_neighbours.
empty
()) {
std::string current_element = elements_to_update_neighbours.
front
();
elements_to_update_neighbours.
pop
();
if
(graph.
count
(current_element) >
0
) {
for
(
const
auto
& teammate: graph.
at
(current_element)) {
if
(distances[teammate] <
0
) {
distances[teammate] = distances[current_element] +
1
;
elements_to_update_neighbours.
push
(teammate);
}
}
}
}
return
distances;
}
int
main
() {
size_t
num_teams;
std::cin >> num_teams;
std::string name1, name2, name3;
std::map<std::string, std::set<std::string>> teammates;
TeamType team;
for
(
size_t
i =
0
; i < num_teams; i++) {
std::cin >> team;
for
(
const
auto
& member: team) {
for
(
const
auto
& member2: team) {
if
(member != member2) {
teammates[member].
insert
(member2);
}
}
}
}
IsenbaevsNumbersType isenbaevs_numbers =
compute_distance
(teammates,
MAIN_MEMBER
);
std::cout << isenbaevs_numbers;
return
0
;
}
Back
|
FazBrowse Home
|
New Git URL