# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
530968 | 79brue | Stray Cat (JOI20_stray) | C++14 | 47 ms | 16952 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 "Anthony.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
namespace {
int n, m, a, b;
vector<pair<int, int> > link[20002];
vector<int> ans;
int dist[20002];
void bfs(){
queue<pair<int, int> > que;
dist[0] = 1;
que.push(make_pair(0, 1));
while(!que.empty()){
pair<int, int> tmp = que.front(); que.pop();
int x = tmp.first, d = tmp.second;
dist[x] = d;
for(auto y: link[x]){
if(dist[y.first]) continue;
que.push(make_pair(y.first, d+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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |