Submission #921034

#TimeUsernameProblemLanguageResultExecution timeMemory
921034kxdMonthly railway pass (LMIO18_menesinis_bilietas)C++17
0 / 100
7 ms13400 KiB
#include <bits/stdc++.h> //#define DEBUG 1106 #define int long long #define ll long long #define ld long double #define pb push_back #define p_q priority_queue #define m_p make_pair #define pii pair<int,int> #define endl '\n' #define INIT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define FOR(i,a,b) for(int i = a; i <= b; i++) #define forn(i,n) for (int i = 0; i < n; i++) #define forn1(i,n) for (int i = 1; i <= n; i++) #define all(x) x.begin(),x.end() #define ft first #define sd second #define lowbit(x) (x&(-x)) #define chmax(x,y) x=max(x,y) #define chmin(x,y) x=min(x,y) #ifdef DEBUG #define debug(x) cout << #x << ": " << x << endl; #else #define debug(x) 1106; #endif using namespace std; const int N = 2e5+5; const int inf = 1e9; const int INF = 1e18; const int MOD = 1e9+7; int a[N]; bool vis[N]; vector<int> G[N]; signed main() { INIT #ifdef DEBUG freopen("input.txt", "r", stdin); #endif /////////// int n, m; cin >> n >> m; int x, y; char ch; while(m--) { cin >> x >> y >> ch; G[x].pb(y); G[y].pb(x); } queue<int> Q; Q.push(1); int c = 1; vis[1]=1; while(!Q.empty()) { int u = Q.front(); Q.pop(); for(auto v: G[u]) { if(!vis[v]) { vis[v]=1; Q.push(v); c++; } } } if(c==n) cout << n; else cout << 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...