# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
39778 | 2018-01-18T13:20:05 Z | nonocut | Bosses (BOI16_bosses) | C++14 | 0 ms | 2296 KB |
#include<bits/stdc++.h> using namespace std; const int maxn = 5e3 + 5; const int inf = 1e8; int n; int vis[maxn], val[maxn]; vector<int> way[maxn], p[maxn]; queue<int> q; void dfs(int u) { val[u] = 1; for(auto v : p[u]) dfs(v), val[u] += val[v]; } int bfs(int u) { int i; for(i=1;i<=n;i++) { p[i].clear(); vis[i] = 0; val[i] = inf; } vis[u] = 1; q.push(u); while(!q.empty()) { int x = q.front(); q.pop(); for(auto y : way[x]) { if(!vis[y]) { vis[y] = 1; p[x].push_back(y); q.push(y); } } } dfs(u); int ans = 0; for(i=1;i<=n;i++) ans += val[i]; return ans; } int main() { int i,x,k; scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%d",&k); while(k--) { scanf("%d",&x); way[x].push_back(i); } } int ans = inf; for(i=1;i<=n;i++) ans = min(ans, bfs(i)); printf("%d",ans); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2296 KB | Output is correct |
2 | Correct | 0 ms | 2296 KB | Output is correct |
3 | Correct | 0 ms | 2296 KB | Output is correct |
4 | Correct | 0 ms | 2296 KB | Output is correct |
5 | Correct | 0 ms | 2296 KB | Output is correct |
6 | Correct | 0 ms | 2296 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2296 KB | Output is correct |
2 | Correct | 0 ms | 2296 KB | Output is correct |
3 | Correct | 0 ms | 2296 KB | Output is correct |
4 | Correct | 0 ms | 2296 KB | Output is correct |
5 | Correct | 0 ms | 2296 KB | Output is correct |
6 | Correct | 0 ms | 2296 KB | Output is correct |
7 | Incorrect | 0 ms | 2296 KB | Output isn't correct |
8 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2296 KB | Output is correct |
2 | Correct | 0 ms | 2296 KB | Output is correct |
3 | Correct | 0 ms | 2296 KB | Output is correct |
4 | Correct | 0 ms | 2296 KB | Output is correct |
5 | Correct | 0 ms | 2296 KB | Output is correct |
6 | Correct | 0 ms | 2296 KB | Output is correct |
7 | Incorrect | 0 ms | 2296 KB | Output isn't correct |
8 | Halted | 0 ms | 0 KB | - |