제출 #290669

#제출 시각아이디문제언어결과실행 시간메모리
290669DymoBosses (BOI16_bosses)C++14
100 / 100
845 ms5480 KiB
#include<bits/stdc++.h> #define ll long long #define pb push_back #define all(n) n.begin(),n.end() #define endl "\n" #define pll pair<ll,ll> #define ff first #define ss second using namespace std; const ll maxn=2e5+500; const ll mod=1e9+7 ; const ll base=500; /// con 17 ngay vector<ll> adj[maxn]; bool dd[maxn]; ll ans=1e15; ll ans1=0; ll sum[maxn]; void bfs(ll u) { queue<pll> q; q.push(make_pair(1,u)); while (!q.empty()) { auto p= q.front() ; q.pop(); ll u=p.ss; dd[u]=1; ans1=ans1+p.ff; for (auto to:adj[u]) { if (dd[to]) continue; dd[to]=1; q.push(make_pair(p.ff+1,to)); } } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); //freopen("test.txt","r",stdin); if (fopen("Farm.INP","r")) { freopen("Farm.INP","r",stdin); freopen("Farm.OUT","w",stdout); } ll n; cin>>n ; for (int i=1; i<=n; i++) { ll x; cin>>x; while (x--) { ll t; cin>> t; adj[t].pb(i); } } for (int i=1; i<=n; i++) { for (int j=1; j<=n; j++) dd[j]=0; ans1=0; bfs(i); bool x=false; for (int j=1; j<=n; j++) { if (!dd[j]) { x=true; break; } } if (!x) { ans=min(ans,ans1); } } cout <<ans; }

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

bosses.cpp: In function 'int main()':
bosses.cpp:68:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   68 |         for (int j=1; j<=n; j++)
      |         ^~~
bosses.cpp:70:13: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   70 |             ans1=0;
      |             ^~~~
bosses.cpp:50:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   50 |         freopen("Farm.INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
bosses.cpp:51:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   51 |         freopen("Farm.OUT","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...