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;
#define ll long long
const int N = 1005;
vector<int> adj[N];
int col[N];
bool dfs(int i, int c) {
if (~col[i]) {
return col[i] == c;
}
col[i] = c;
bool ok = 1;
for (auto nxt : adj[i]) {
ok &= dfs(nxt, c ^ 1);
}
return ok;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
memset(col, -1, sizeof col);
int n, m;
cin >> n >> m;
for (int i = 0, u, v; i < m; i++) {
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
cout << (dfs(1, 0)? "YES\n0\n" : "NO\n0\n");
return 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... |