# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
363951 | AnaM | Bosses (BOI16_bosses) | C++14 | 1 ms | 492 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;
int n,x,sef,mini,trenutniz,di[5005];
vector<int> grane[5005];
queue<int> q;
void bfs(int trenutni)
{
int vi[5005]={0};
for(int h=1;h<=n;h++)
di[h]=0;
vi[trenutni]=1;
q.push(trenutni);
while(!(q.empty()))
{
trenutni=q.front();
q.pop();
for (int h=0;h<grane[trenutni].size();h++)
{
x=grane[trenutni][h];
if (vi[x]==1) continue;
di[x]=di[trenutni]+1;
vi[x]=1;
q.push(x);
}
}
}
int main()
{
scanf("%d",&n);
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... |