oj.uz

Submission #921035

# Submission time Handle Problem Language Result Execution time Memory
921035 2024-02-03T09:03:28 Z kxd Monthly railway pass (LMIO18_menesinis_bilietas) C++17
10 / 100
 206 ms 32908 KB 
#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 = 5e5+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;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 206 ms 32908 KB Output is correct
2 Correct 4 ms 12888 KB Output is correct
3 Correct 4 ms 12888 KB Output is correct
4 Correct 3 ms 12892 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 52 ms 19256 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 3 ms 12892 KB Output is correct
3 Incorrect 4 ms 12888 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 12888 KB Output is correct
2 Correct 4 ms 12888 KB Output is correct
3 Incorrect 4 ms 12888 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 12888 KB Output is correct
2 Correct 4 ms 12888 KB Output is correct
3 Incorrect 4 ms 12888 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 206 ms 32908 KB Output is correct
2 Correct 4 ms 12888 KB Output is correct
3 Correct 4 ms 12888 KB Output is correct
4 Correct 3 ms 12892 KB Output is correct
5 Incorrect 4 ms 12888 KB Output isn't correct
6 Halted 0 ms 0 KB -