이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <queue>
#define int long long
using namespace std;
const long long oo = 1000000000000000000;
long long sum, ans = 0, mx = 0, mn = 1000000000, num, pos;
/*
ViHHiPuh
(( `'-""``""-'` ))
)-__-_.._-__-(
/ --- (o _ o) --- \
\ .-* ( .0. ) *-. /
_'-. ,_ '=' _, .-'_
/ `;#'#'# - #'#'#;` \
\_)) -----'#'----- ((_/
# --------- #
'# ------- ------ #'
/..-'# ------- #'-.\
_\...-\'# -- #'/-.../_
((____)- '#' -(____))
cout << fixed << setprecision(6) << x;
freopen ( "sum.in", "r", stdin )
*/
int n, m, x;
vector <int> v[ 50001 ];
bool used[ 5001 ];
int col[ 5001 ];
void dfs( int u ) {
used[ u ] = 1;
sum ++;
for ( auto to : v[ u ] ) {
if ( !used[ to ] ) {
dfs( to );
col[ u ] += col[ to ];
}
}
col[ u ] ++;
ans += col[ u ];
}
main () {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n;
for ( int i = 1; i <= n; i ++ ) {
cin >> m;
for ( int j = 1; j <= m; j ++ ) {
cin >> x;
v[ x ].push_back( i );
}
}
for ( int i = 1; i <= n; i ++ ) {
dfs( i );
if ( sum == n )
mn = min( mn, ans );
ans = sum = 0;
for ( int j = 1; j <= n; j ++ ) {
used[ j ] = col[ j ] = 0;
}
}
cout << mn;
}
/*
*/
컴파일 시 표준 에러 (stderr) 메시지
bosses.cpp:62:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
62 | main () {
| ^~~~
bosses.cpp: In function 'int main()':
bosses.cpp:79:25: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
79 | used[ j ] = col[ j ] = 0;
| ~~~~~~~~~^~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |