제출 #964929

#제출 시각아이디문제언어결과실행 시간메모리
964929MinaRagy06Newspapers (CEOI21_newspapers)C++17
0 / 100
1 ms344 KiB
#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\n" : "NO\n"); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...