제출 #1044273

#제출 시각아이디문제언어결과실행 시간메모리
1044273vjudge1Bosses (BOI16_bosses)C++14
100 / 100
353 ms724 KiB
#include <bits/stdc++.h> #define ll long long using namespace std; const int maxn = 5000 + 7; int n , h[maxn] , ans = 1e18; vector <int> g[maxn]; void bfs(int s) { for(int i = 1; i <= n; i++) h[i] = -1; queue <int> node; node.push(s); h[s] = 1; while(!node.empty()) { int u = node.front(); for(int v: g[u]) { if(h[v] == -1) { h[v] = h[u] + 1; node.push(v); } } node.pop(); } int cnt = 0; bool check = 1; for(int i = 1; i <= n; i++) { if(h[i] == -1) check = 0; cnt += h[i]; } if(check) ans = min(ans , cnt); } void solve() { cin >> n; for(int i = 1; i <= n; i++) { int s , k; cin >> s; while(s--) { cin >> k; g[k].push_back(i); } } for(int i = 1; i <= n; i++) { bfs(i); } cout << ans << '\n'; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); solve(); return 0; }

컴파일 시 표준 에러 (stderr) 메시지

bosses.cpp:9:25: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
    9 | int n , h[maxn] , ans = 1e18;
      |                         ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...