# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23004 | ngkan146 | Bosses (BOI16_bosses) | C++98 | 733 ms | 2276 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>
#define fi first
#define se second
#define mk make_pair
using namespace std;
typedef pair<int,int> ii;
vector <int> G[5001];
bool used[5001];
int n,ans = 999999999,tmp;
int bfs(int root){
memset(used,0,sizeof(used));
queue <ii> q;
q.push(mk(root,1));
int cnt = n,res = 0;
used[root] = 1;
while(q.size()){
int u = q.front().fi,level=q.front().se;
q.pop();
res += level;
cnt--;
for(int i=0;i<G[u].size();i++){
int v = G[u][i];
if (used[v]) continue;
used[v] = 1;
q.push(mk(v,level+1));
}
}
if (cnt > 0) return 999999999;
return res;
}
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... |