oj.uz

Submission #850912

# Submission time Handle Problem Language Result Execution time Memory
850912 2023-09-17T18:49:34 Z pakapu Monthly railway pass (LMIO18_menesinis_bilietas) C++17
100 / 100
 442 ms 62144 KB 
#include <bits/stdc++.h>

using namespace std;

set<int> used_cc;

vector<int> used;
vector<int> cc_size;
vector<int> distribute_used;
vector<int> answer_used;
vector<int> cc_leader;

vector<vector<int>> bus_g;
vector<vector<int>> train_g;

int calculate_cc_size(int u, int leader) {
	cc_leader[u] = leader;
	used[u] = true;
	int curr_size = 1;

	for(auto v : train_g[u]) {
		if(used[v]) {
			continue;
		}

		curr_size += calculate_cc_size(v, leader);
	}

	return curr_size;
}

int calculate_cheap_routes(int u) {
	answer_used[u] = true;
	int ans = 0;

	for(auto v : train_g[u]) {
		if(answer_used[v]) {
			continue;
		}

		ans += calculate_cheap_routes(v);
	}

	for(auto v : bus_g[u]) {
		if(used_cc.count(cc_leader[v])) {
			continue;
		}
		used_cc.insert(cc_leader[v]);
		ans += cc_size[cc_leader[v]];
	}

	return ans;
}

signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	int n, m;
	cin >> n >> m;

	bus_g = vector<vector<int>>(n);
	train_g = vector<vector<int>>(n);

	for(int i = 0; i < m; i++) {
		int from, to;
		char type;
		cin >> from >> to >> type;
		from--;
		to--;

		if(type == 'T') {
			train_g[to].push_back(from);
			train_g[from].push_back(to);
		}
		if(type == 'A') {
			bus_g[to].push_back(from);
			bus_g[from].push_back(to);
		}
	}

	cc_leader = vector<int>(n, -1);

	used = vector<int>(n);
	cc_size = vector<int>(n);
	distribute_used = vector<int>(n);
	for(int i = 0; i < n; i++) {
		if(!used[i]) {
			int curr = calculate_cc_size(i, i);
			cc_size[cc_leader[i]] = curr;
		}
	}

	// Calculate the number of reachable cities for every node
	int ans = 0;
	answer_used = vector<int>(n);
	vector<int> cheap_cities(n);
	for(int i = 0; i < n; i++) {
		if(!answer_used[i]) {
			used_cc.clear();
			used_cc.insert(cc_leader[i]); // Forgor to insert leader of the component i belongs to
			cheap_cities[cc_leader[i]] = cc_size[cc_leader[i]] + calculate_cheap_routes(i);
			//assert(cheap_cities[cc_leader[i]] <= n);
		}
	}

	for(int i = 0; i < n; i++) {
		assert(cc_leader[i] != -1);
		if(cheap_cities[cc_leader[i]] == n) {
			ans++;
		}
	}
	cout << ans << '\n';

	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 240 ms 41040 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 25 ms 33368 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 33 ms 3860 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 33368 KB Output is correct
2 Correct 1 ms 1372 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 170 ms 9868 KB Output is correct
7 Correct 442 ms 62144 KB Output is correct
8 Correct 8 ms 2648 KB Output is correct
9 Correct 12 ms 2904 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 3 ms 600 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 604 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 3 ms 600 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 2 ms 600 KB Output is correct
21 Correct 1 ms 1372 KB Output is correct
22 Correct 8 ms 2648 KB Output is correct
23 Correct 12 ms 2904 KB Output is correct
24 Correct 33 ms 3860 KB Output is correct
25 Correct 6 ms 1112 KB Output is correct
26 Correct 84 ms 11144 KB Output is correct
27 Correct 29 ms 3920 KB Output is correct
28 Correct 60 ms 5120 KB Output is correct
29 Correct 23 ms 3152 KB Output is correct
30 Correct 63 ms 6224 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 3 ms 600 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 6 ms 1112 KB Output is correct
17 Correct 84 ms 11144 KB Output is correct
18 Correct 29 ms 3920 KB Output is correct
19 Correct 60 ms 5120 KB Output is correct
20 Correct 23 ms 3152 KB Output is correct
21 Correct 63 ms 6224 KB Output is correct
22 Correct 240 ms 41040 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 25 ms 33368 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 2 ms 600 KB Output is correct
29 Correct 1 ms 1372 KB Output is correct
30 Correct 170 ms 9868 KB Output is correct
31 Correct 442 ms 62144 KB Output is correct
32 Correct 8 ms 2648 KB Output is correct
33 Correct 12 ms 2904 KB Output is correct
34 Correct 33 ms 3860 KB Output is correct
35 Correct 28 ms 4696 KB Output is correct
36 Correct 182 ms 21184 KB Output is correct
37 Correct 116 ms 24144 KB Output is correct