oj.uz

Submission #699673

# Submission time Handle Problem Language Result Execution time Memory
699673 2023-02-17T16:44:24 Z shmad Monthly railway pass (LMIO18_menesinis_bilietas) C++17
100 / 100
 707 ms 65260 KB 
#pragma GCC optimize("O3", "unroll-loops") // "Ofast" 	
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") 

#include <bits/stdc++.h>

//#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vvt = vt< vt<ll> >;

const int N = 1e6 + 5, mod = 1e9 + 7, B = 500;
const ll inf = 1e9 + 7, LIM = (1ll << 60);
const double eps = 1e-6;

int n, m, p[N], r[N], cnt[N], kol;
map<pii, bool> used;  

int getp (int v) {
	return (p[v] == v ? v : p[v] = getp(p[v]));
}
 
void unite (int a, int b) {
	a = getp(a);
	b = getp(b);
	if (a == b) return;
	if (r[a] > r[b]) swap(a, b);
	p[a] = b;
	r[b] += r[a];
	r[a] = 0;
}

vt<pii> v;

void solve () {
	cin >> n >> m;
	for (int i = 1; i <= n; i++) p[i] = i, r[i] = 1;
	for (int i = 1; i <= m; i++) {
		int x, y;
		char c;
		cin >> x >> y >> c;
		if (c == 'A') v.pb({x, y});
		else unite(x, y);
	}
	for (int i = 1; i <= n; i++) if (r[i] != 0) kol++;
	for (auto [x, y]: v) {
		x = getp(x), y = getp(y);
		if (x == y || used[{x, y}] || used[{y, x}]) continue;
		cnt[x]++, cnt[y]++;		
		used[{x, y}] = used[{y, x}] = 1;
	}
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		if (cnt[i] == kol - 1) ans += r[i];
	}
	cout << ans;
	cout << '\n';
}

bool testcases = 0;

signed main() {
	cin.tie(0) -> sync_with_stdio(0);
	int test = 1;
	if (testcases) cin >> test;
	for (int cs = 1; cs <= test; cs++) {
		solve();
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 9436 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 3 ms 3924 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 31 ms 2696 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3924 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 7 ms 1320 KB Output is correct
6 Correct 678 ms 49044 KB Output is correct
7 Correct 707 ms 65260 KB Output is correct
8 Correct 13 ms 2644 KB Output is correct
9 Correct 31 ms 4496 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 7 ms 1320 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 3 ms 628 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 4 ms 724 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 2 ms 464 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 468 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 3 ms 628 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 4 ms 724 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 2 ms 464 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 7 ms 1320 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 13 ms 2644 KB Output is correct
23 Correct 31 ms 4496 KB Output is correct
24 Correct 31 ms 2696 KB Output is correct
25 Correct 8 ms 1000 KB Output is correct
26 Correct 118 ms 8352 KB Output is correct
27 Correct 39 ms 3956 KB Output is correct
28 Correct 251 ms 18960 KB Output is correct
29 Correct 36 ms 3144 KB Output is correct
30 Correct 168 ms 16324 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 3 ms 628 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 4 ms 724 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 2 ms 464 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 8 ms 1000 KB Output is correct
17 Correct 118 ms 8352 KB Output is correct
18 Correct 39 ms 3956 KB Output is correct
19 Correct 251 ms 18960 KB Output is correct
20 Correct 36 ms 3144 KB Output is correct
21 Correct 168 ms 16324 KB Output is correct
22 Correct 99 ms 9436 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 3 ms 3924 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 7 ms 1320 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 678 ms 49044 KB Output is correct
31 Correct 707 ms 65260 KB Output is correct
32 Correct 13 ms 2644 KB Output is correct
33 Correct 31 ms 4496 KB Output is correct
34 Correct 31 ms 2696 KB Output is correct
35 Correct 30 ms 3880 KB Output is correct
36 Correct 199 ms 16240 KB Output is correct
37 Correct 61 ms 5772 KB Output is correct