제출 #332103

#제출 시각아이디문제언어결과실행 시간메모리
332103iliccmarkoBosses (BOI16_bosses)C++14
100 / 100
962 ms748 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define endl "\n" #define INF 1000000000 #define LINF 1000000000000000LL #define pb push_back #define all(x) x.begin(), x.end() #define len(s) (int)s.size() #define test_case { int t; cin>>t; while(t--)solve(); } #define input(n, v) {for(int i = 0;i<n;i++) cin>>v[i];} #define output(n, v) {for(int i = 0;i<n;i++) cout<<v[i]<<" "; cout<<endl;} #define single_case solve(); #define line cout<<"------------"<<endl; #define ios { ios_base::sync_with_stdio(false); cin.tie(NULL); } using namespace std; int n; const int N = 5e3 + 5; vector<vector<int> > v(N); bitset<N> vidjen; int dp[N]; int make_graph(int u) { for(int i = 0;i<n;i++) vidjen[i] = 0; queue<pair<int, int > > q; q.push({u, 0}); vidjen[u] = 1; int cnt = 0; int w = 0; while(len(q)) { int top = q.front().first; int lvl = q.front().second; cnt += 1+lvl; q.pop(); w++; for(int x : v[top]) { if(vidjen[x]) continue; q.push({x, lvl+1}); vidjen[x] = 1; } } if(w==n) return cnt; else return INF; } int main() { //ios scanf("%d", &n); for(int i = 0;i<n;i++) { int k; cin>>k; while(k--) { int a; cin>>a; a--; v[a].pb(i); } } int res = INF; int root; int mini = INF; for(int i = 0;i<n;i++) { res = min(res, make_graph(i)); } printf("%d", res); return 0; }

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

bosses.cpp: In function 'int main()':
bosses.cpp:69:9: warning: unused variable 'root' [-Wunused-variable]
   69 |     int root;
      |         ^~~~
bosses.cpp:70:9: warning: unused variable 'mini' [-Wunused-variable]
   70 |     int mini = INF;
      |         ^~~~
bosses.cpp:55:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   55 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...