8000 Merge pull request #388 from neppiness/1325 · jh2ee/basic-algo-lecture@f2b0682 · GitHub
[go: up one dir, main page]

< 8000 div data-turbo-body class="logged-out env-production page-responsive" style="word-wrap: break-word;">
Skip to content

Commit f2b0682

Browse files
Merge pull request encrypted-def#388 from neppiness/1325
update: 0x18 1325.cpp
2 parents 8d40077 + f498c13 commit f2b0682

File tree

1 file changed

+35
-4
lines changed

1 file changed

+35
-4
lines changed

0x18/solutions/1325.cpp

Lines changed: 35 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,42 @@
1-
// Authored by : BaaaaaaaaaaarkingDog
1+
// Authored by : scsc3204
22
// Co-authored by : -
3-
// http://boj.kr/****************
3+
// http://boj.kr/8fd2c4a42ad5491caa20c09336e319c5
44
#include <bits/stdc++.h>
55
using namespace std;
66

7-
int main(void){
7+
const int NMX = 10'002;
8+
9+
int mx;
10+
int sc[NMX];
11+
vector<int> adj[NMX];
12+
bool vis[NMX];
13+
14+
void trav(int cur) {
15+
vis[cur] = 1;
16+
sc[cur]++;
17+
mx = max(mx, sc[cur]);
18+
for(int nxt : adj[cur]) {
19+
if(vis[nxt]) continue;
20+
trav(nxt);
21+
}
22+
}
23+
24+
int main() {
825
ios::sync_with_stdio(0);
926
cin.tie(0);
10-
27+
28+
int n, m; cin >> n >> m;
29+
while(m--) {
30+
int u, v;
31+
cin >> u >> v;
32+
adj[u].push_back(v);
33+
}
34+
fill(sc, sc + NMX, 0);
35+
for(int i = 1; i <= n; i++) {
36+
fill(vis, vis + NMX, 0);
37+
trav(i);
38+
}
39+
40+
for(int i = 1; i <= n; i++)
41+
if(sc[i] == mx) cout << i << ' ';
1142
}

0 commit comments

Comments
 (0)
0