# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
673553 | quocnguyen1012 | Newspapers (CEOI21_newspapers) | C++14 | 0 ms | 212 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;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int N, M; cin >> N >> M;
vector<vector<int>> adj(N);
for (int i = 0; i < M; ++i) {
int u, v; cin >> u >> v;
--u; --v;
adj[u].emplace_back(v);
adj[v].emplace_back(u);
}
bool exist_cycle = false;
vector<bool> visited(N, false);
auto dfs = [&](auto&dfs, int u, int p) -> void {
visited[u] = true;
for (int v : adj[u]) {
if (v == p) continue;
if (visited[v]) exist_cycle = true;
else dfs(dfs, v, u);
}
};
dfs(dfs, 0, -1);
if (exist_cycle)
return cout << "NO", 0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |