# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
531584 | eecs | Newspapers (CEOI21_newspapers) | C++17 | 2 ms | 340 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>
using namespace std;
const int maxn = 1010;
int n, m, d[maxn], pre[maxn];
vector<int> path, ans, G[maxn];
int main() {
scanf("%d %d", &n, &m);
if (m >= n) puts("NO"), exit(0);
if (n == 1) puts("YES\n1\n1"), exit(0);
if (n == 2) puts("YES\n2\n1 1"), exit(0);
while (m--) {
int u, v;
scanf("%d %d", &u, &v);
G[u].push_back(v), G[v].push_back(u);
}
auto bfs = [&]() {
queue<int> Q;
for (int i = 1; i <= n; i++) {
if (!d[i]) Q.push(i);
}
while (!Q.empty()) {
int u = Q.front(); Q.pop();
for (int v : G[u]) if (!~d[v]) {
Q.push(v), d[v] = d[u] + 1, pre[v] = u;
}
}
};
memset(d, -1, sizeof(d));
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... |