Submission #1235574

#TimeUsernameProblemLanguageResultExecution timeMemory
1235574gry3125Monthly railway pass (LMIO18_menesinis_bilietas)C++20
10 / 100
1162 ms45816 KiB
#include <bits/stdc++.h> #define ll long long int #define pb push_back #define fi first #define se second using namespace std; map<int,vector<int>> adj; vector<bool> vis; void dfs(int v) { vis[v] = 1; for (auto u : adj[v]) { if (!vis[u]) { vis[u] = 1; dfs(u); } } } int main() { int n, m; cin >> n >> m; for (int i = 0; i < m; i++) { int a, b; char c; cin >> a >> b >> c; adj[a].pb(b); adj[b].pb(a); } vis.resize(n+1); dfs(1); int cnt = 0; for (int i = 1; i <= n; i++) { cnt += vis[i]; } cout << (cnt == n ? n : 0); 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...