# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
39798 | Pajaraja | Bosses (BOI16_bosses) | C++14 | 825 ms | 2296 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
vector<int> g[5007];
bool vi[5007];
int dist[5007],n;
long long bfs(int s)
{
queue<int> bfsq;
bfsq.push(s);
fill(vi,vi+5007,false);
fill(dist,dist+5007,-1);
vi[s]=true;
dist[s]=0;
while(!bfsq.empty())
{
int u=bfsq.front();
for(int i=0;i<g[u].size();i++) if(!vi[g[u][i]])
{
vi[g[u][i]]=true;
dist[g[u][i]]=dist[u]+1;
bfsq.push(g[u][i]);
}
bfsq.pop();
}
long long sum=n;
for(int i=1;i<=n;i++)
{
sum+=dist[i];
if(dist[i]==-1) return 1000000000000000000LL;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |