oj.uz

Submission #639589

# Submission time Handle Problem Language Result Execution time Memory
639589 2022-09-10T17:07:55 Z LeticiaFCS Monthly railway pass (LMIO18_menesinis_bilietas) C++17
16 / 100
 1139 ms 87596 KB 
#include "bits/stdc++.h"
#define st first
#define nd second
using lint = int64_t;
constexpr int MOD = int(1e9) + 7;
constexpr int INF = 0x3f3f3f3f;
constexpr int NINF = 0xcfcfcfcf;
constexpr lint LINF = 0x3f3f3f3f3f3f3f3f;
const long double PI = acosl(-1.0);
// Returns -1 if a < b, 0 if a = b and 1 if a > b.
int cmp_double(double a, double b = 0, double eps = 1e-9) {
	return a + eps > b ? b + eps > a ? 0 : 1 : -1;
}
using namespace std;
struct UF {
	vector<int> e, sz;
	UF(int n) : e(n, -1) {}
	bool same_set(int a, int b) { return find(a) == find(b); }
	int size(int x) { return -e[find(x)]; }
	int find(int x) { return e[x] < 0 ? x : e[x] = find(e[x]); }
	bool unite(int a, int b) {
		a = find(a), b = find(b);
		if (a == b) return 0;
		if (e[a] > e[b]) swap(a, b);
		e[a] += e[b]; e[b] = a;
		return 1;
	}
};

int main() {
	cin.tie(nullptr)->sync_with_stdio(false);
	//int __; cin >> __; for( int _ = 1 ; _ <= __ ; _++ ){ }
	int n, m;
	cin>>n>>m;
	using pii = pair<int, int>;
	vector<pii> bus;
	
	UF uf(n);
	
	while(m--){
		int u, v;
		cin>>u>>v;
		u--, v--;
		string type;
		cin>>type;
		if(type == "A"){
			bus.emplace_back(u, v);
		} else {
			uf.unite(u, v);	
		}
	}
	
	map<int, int> compr;
	
	int id = 0;
	for(int u=0; u<n; u++)
		if(!compr.count(uf.find(u)))
			compr[uf.find(u)] = id++;
	
	vector<set<int>> cg(id);
	for(auto &[u, v]: bus){
		u = uf.find(u);
		v = uf.find(v);
		cg[compr[u]].insert(compr[v]);
		cg[compr[v]].insert(compr[u]);
	}
	int answer = 0;
	for(auto &[u, c]: compr)
		if((int) cg[c].size() == id-1)
			answer += uf.size(u);
	cout<<answer<<"\n";
	
	return 0;
}
/*
[  ]Leu o problema certo???
[  ]Ver se precisa de long long
[  ]Viu o limite dos fors (é n? é m?)
[  ]Tamanho do vetor, será que é 2e5 em vez de 1e5??
[  ]Testar sample
[  ]Testar casos de  borda
[  ]1LL no 1LL << i
[  ]Testar mod (é 1e9+7, mesmo?, será que o mod não ficou negativo?)
*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 8260 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 158 ms 46248 KB Output is correct
5 Correct 3 ms 1492 KB Output is correct
6 Correct 44 ms 2684 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 46248 KB Output is correct
2 Correct 3 ms 1492 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 6 ms 1108 KB Output is correct
6 Correct 639 ms 42752 KB Output is correct
7 Correct 1139 ms 87596 KB Output is correct
8 Correct 14 ms 3412 KB Output is correct
9 Correct 29 ms 4936 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 6 ms 1108 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 316 KB Output is correct
8 Correct 1 ms 360 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Incorrect 4 ms 596 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 360 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Incorrect 4 ms 596 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 360 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Incorrect 4 ms 596 KB Output isn't correct
6 Halted 0 ms 0 KB -