이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
void Solve()
{
int n; cin >> n;
vector<vector<int>> adj(n);
int ans = INF;
for (int i = 0; i < n; i++){
int k; cin >> k;
while (k--){
int x; cin >> x;
x--;
adj[x].push_back(i);
}
}
for (int i = 0; i < n; i++){
vector <int> d(n, INF);
queue <int> q;
q.push(i);
d[i] = 1;
while (!q.empty()){
int u = q.front();
q.pop();
for (int v : adj[u]){
if (d[v] == INF){
d[v] = d[u] + 1;
q.push(v);
}
}
}
int cnt = 0;
for (auto x : d) cnt += x;
ans = min(ans, cnt);
}
cout << ans << "\n";
}
int32_t main()
{
auto begin = std::chrono::high_resolution_clock::now();
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
// cin >> t;
for(int i = 1; i <= t; i++)
{
//cout << "Case #" << i << ": ";
Solve();
}
auto end = std::chrono::high_resolution_clock::now();
auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
return 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... |