Submission #246400

#TimeUsernameProblemLanguageResultExecution timeMemory
246400NONAMERonald (COCI17_ronald)C++14
0 / 120
52 ms65540 KiB
#include <bits/stdc++.h> #define dbg(x) cerr << #x << " = " << x << "\n" #define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie() using namespace std; using ll = long long; using ld = long double; const int N = 1e4; int n, m; bool mk[N]; vector <int> g[N]; void dfs(int v, int pr, int &e, int &cnt) { if (mk[v]) return; e += int(g[v].size()); ++cnt; for (int u : g[v]) if (u != pr) dfs(u, v, e, cnt); } int main() { fast_io; cin >> n >> m; for (int i = 0; i < m; ++i) { int v, u; cin >> v >> u; --v, --u; g[v].push_back(u); g[u].push_back(v); } for (int i = 0; i < n; ++i) { if (mk[i]) continue; int e = 0, cnt = 0; dfs(i, -1, e, cnt); if (e != (cnt * (cnt - 1))) return void(cout << "NE\n"), 0; } cout << "DA\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...