# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
20996 | model_code | Bosses (BOI16_bosses) | C++11 | 819 ms | 2664 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 F first
#define S second
using namespace std;
typedef long long ll;
typedef long double ld;
vector<int> g[10101];
int u[10101];
ll d[10101];
int n;
ll test(int x){
queue<int> bfs;
for (int i=1;i<=n;i++){
u[i]=0;
d[i]=0;
}
bfs.push(x);
u[x]=1;
d[x]=1;
while (!bfs.empty()){
int t=bfs.front();
bfs.pop();
for (int nx:g[t]){
if (u[nx]==0){
u[nx]=1;
d[nx]=d[t]+1;
bfs.push(nx);
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... |