# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
212938 | aboluo2003 | Stray Cat (JOI20_stray) | C++14 | 92 ms | 16400 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>
#include "Anthony.h"
using namespace std;
namespace {
} // namespace
std::vector<int> Mark(int N, int M, int A, int B, std::vector<int> U, std::vector<int> V) {
vector<int> rt (M, 0);
vector<vector<int>> G (N);
for (int i = 0; i < M; i++) {
G[U[i]].push_back(V[i]);
G[V[i]].push_back(U[i]);
}
if (A >= 3) {
vector<int> dep (N, -1);
queue<int> Q;
Q.push(0);
dep[0] = 0;
while (!Q.empty()) {
int p = Q.front();
Q.pop();
for (auto e : G[p]) {
if (dep[e] == -1) {
dep[e] = dep[p] + 1;
Q.push(e);
}
}
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... |