Submission #1021694

#TimeUsernameProblemLanguageResultExecution timeMemory
1021694lHogMonthly railway pass (LMIO18_menesinis_bilietas)C++17
0 / 100
328 ms33676 KiB
#include <bits/stdc++.h> using namespace std; void dfs(int n, vector<vector<int>>& g, vector<bool>& v) { v[n] = true; for (int e : g[n]) { if (!v[e]) { dfs(e, g, v); } } } int c(int N, vector<pair<int, int>>& d) { vector<vector<int>> g(N); for (auto d : d) { g[d.first].push_back(d.second); g[d.second].push_back(d.first); } vector<bool> v(N, false); int u = 0; for (int i = 0; i < N; ++i) { if (!v[i]) { u++; dfs(i,g,v); } } return u; } int main() { int N, E; cin >> N >> E; vector<pair<int, int>> d(E); for (int i = 0; i < E; ++i) { char sodifjsd; cin >> d[i].first >> d[i].second >> sodifjsd; } cout << c(N,d); }
#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...