Submission #1271419

#TimeUsernameProblemLanguageResultExecution timeMemory
1271419kawhietRonald (COCI17_ronald)C++20
15 / 120
23 ms3652 KiB
#include <bits/stdc++.h> using namespace std; const int N = 1e3; vector<int> g[N]; bool vis[N]; int cnt = 0; void dfs(int u) { vis[u] = 1; cnt++; for (auto v : g[u]) { if (!vis[v]) { dfs(v); } } } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, m; cin >> n >> m; for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; u--; v--; g[u].push_back(v); g[v].push_back(u); } for (int i = 0; i < n; i++) { if (!vis[i]) { dfs(i); if (cnt >= 3) { cout << "NE" << '\n'; return 0; } cnt = 0; } } cout << "DA" << '\n'; return 0; }
#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...