# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1162410 | Newtonabc | Bosses (BOI16_bosses) | C++17 | 355 ms | 764 KiB |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=5e3+10;
vector<int> adj[N];
ll dep[N],ans=LLONG_MAX;
bool vs[N];
int n;
void bfs(int u){
queue<int> q;
for(int i=1;i<=n;i++) vs[i]=false;
dep[u]=0;
vs[u]=true;
q.push(u);
while(!q.empty()){
int now=q.front();
q.pop();
for(auto v:adj[now]){
if(vs[v]) continue;
vs[v]=true;
dep[v]=dep[now]+1;
q.push(v);
}
}
for(int i=1;i<=n;i++) if(!vs[i]) return;
ll sum=0;
for(int i=1;i<=n;i++) sum+=dep[i]+1LL;
ans=min(ans,sum);
}
int main(){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |