# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
216567 | dantoh000 | Stray Cat (JOI20_stray) | C++14 | 69 ms | 16812 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 pair<int,int> ii;
namespace {
} // namespace
int f(int x){
return (x == 1 || x == 4 || x == 5);
}
std::vector<int> Mark(int N, int M, int A, int B,
std::vector<int> U, std::vector<int> V) {
vector<int> adjlist[N];
int dist[N];
int p[N];
vector<int> ans;
queue<int> q;
for (int i = 0; i < M; i++){
adjlist[U[i]].push_back(V[i]);
adjlist[V[i]].push_back(U[i]);
}
ans.resize(M);
if (A >= 3){
memset(dist,-1,sizeof(dist));
dist[0] = 0;
p[0] = 0;
q.push(0);
while (q.size()){
int u = q.front(); q.pop();
for (auto v : adjlist[u]){
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... |