# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
107361 | MohamedAhmed0 | Bosses (BOI16_bosses) | C++14 | 727 ms | 760 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;
const int MAX = 5005 ;
int vis[MAX] ;
long long cost = 0;
vector< vector<int> >adj(MAX) ;
int n , cnt = 0 ;
void bfs(int src)
{
queue< pair<int , int> >q ;
q.push({src , 1}) ;
vis[src] = 1 ;
while(!q.empty())
{
pair<int , int>p = q.front() ;
q.pop() ;
cnt++ ;
int node = p.first ;
cost += (p.second * 1ll) ;
for(auto &child : adj[node])
{
if(vis[child] == 1)
continue ;
vis[child] = 1 ;
q.push({child , p.second+1}) ;
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... |