제출 #685011

#제출 시각아이디문제언어결과실행 시간메모리
685011moonheroNewspapers (CEOI21_newspapers)C++14
0 / 100
0 ms212 KiB
#include<bits/stdc++.h> using namespace std; using ll = long long; int p[1005]; int get (int x) { if (x == p[x]) return x; return p[x] = get(p[x]); } void u (int x, int y) { x = get(x), y = get(y); if (x == y) return; p[x] = y; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; bool ok = 1; for (int i = 1; i <= n; i++) p[i] = i; for (int i = 1; i <= m; i++) { int x, y; cin >> x >> y; if (get(x) == get(y)) ok = 0; u(x, y); } if (ok) cout << "YES\n0"; else cout << "NO\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...