# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
829698 | Blagoj | Stray Cat (JOI20_stray) | C++17 | 0 ms | 0 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"
namespace {
int FunctionExample(int i, int A) { return i % A; }
} // namespace
using namespace std;
vector<int> Mark(int N, int M, int A, int B, vector<int> U, vector<int> V) {
vector<int> X(M);
queue<int> q;
q.push(0);
string s = "001011";
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]);
}
int dist[N];
for (int i = 0; i < N; i++) dist[i] = N + 2;
dist[0] = 0;
while (q.size()) {
int cur = q.front();
q.pop();
for (auto x : g[cur]) {
if (dist[cur] + 1 < dist[x]) {
dist[x] = dist[cur] + 1;
q.push(x);
}
}
}
for (int i = 0; i < M; i++) X[i] = min(dist[U[i]], dist[V[i]]) % 3;
// for (int i = 0; i < X.size(); i++) cout << U[i] << " " << V[i] << " : " << X[i] << endl;
return X;
}