# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
674332 | null_awe | Stray Cat (JOI20_stray) | C++14 | 51 ms | 16484 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;
#define pii pair<int, int>
vector<int> Mark(int n, int m, int a, int b, vector<int> u, vector<int> v) {
vector<vector<pii>> adj(n);
for (int i = 0; i < m; ++i) adj[u[i]].push_back({v[i], i}), adj[v[i]].push_back({u[i], i});
if (a == 2) {
vector<int> color(m, -1), dist(n, -1), lp(n), llp(n);
for (int i = 0; i < n; ++i) lp[i] = i, llp[i] = i;
queue<int> q; q.push(0), dist[0] = 0;
set<int> heads;
while (q.size()) {
int v = q.front(); q.pop();
int label = dist[v] % 2;
for (const auto& [u, i] : adj[v]) {
if (color[i] >= 0) {
if (adj[v].size() == 2) {
lp[v] = lp[u];
if (lp[u] == u) heads.insert(v);
else llp[v] = llp[u];
}
continue;
}
color[i] = label;
q.push(u), dist[u] = dist[v] + 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... |