# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
802559 | Um_nik | 길고양이 (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 "Anthony.h"
#include <vector>
using namespace std;
namespace {
} // namespace
vector<int> Mark(int N, int M, int A, int B,
vector<int> U, vector<int> V) {
vector<int> X(M);
if (A >= 3) {
vector<vector<int>> g(N, vector<int>());
for (int i = 0; i < M; i++) {
int u = U[i], v = V[i];
g[u].push_back(v);
g[v].push_back(u);
}
vector<int> dist(N, N);
dist[0] = 0;
vector<int> q;
q.push_back(0);
for (int i = 0; i < (int)q.size(); i++) {
int v = q[i];
for (int u : g[v]) if (dist[u] == N) {
dist[u] = dist[v] + 1;
q.push_back(u);
}
}
assert((int)q.size() == N);
for (int i = 0; i < M; i++)
X[i] = min(dist[U[i]], dist[V[i]]) % 3;
} else {
assert(false);
}
return X;
}
#include "Catherine.h"
#include <vector>
namespace {
int A, B;
} // namespace
void Init(int A, int B) {
::A = A;
}
int Move(std::vector<int> y) {
if (A > 2) {
int c = 0;
while(c < 3) {
if (y[c] > 0 && y[(c + 2) % 3] == 0) break;
c++;
}
assert(c < 3);
return c;
} else {
assert(false);
}
}