| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1236999 | i_love_mriti | Monthly railway pass (LMIO18_menesinis_bilietas) | C++20 | 242 ms | 27388 KiB |
#include <bits/stdc++.h>
using namespace std;
const int mxN = 5e5 + 100;
vector<int> adj[mxN];
bool vis[mxN];
int ans = 0;
void dfs(int u){
if(vis[u]) return;
vis[u] = 1, ++ans;
for(auto it : adj[u]) dfs(it);
}
int main(){
int n, m, u, v;
cin >> n >> m;
char ch;
for(int i = 0; i < m; ++i){
cin >> u >> v >> ch;
adj[u].push_back(v);
adj[v].push_back(u);
}
dfs(1);
cout << (ans == n ? n : 0) << "\n";
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
