Submission #1503315

---

Source Code Expand

#include "bits/stdc++.h"

using namespace std;

using ll = long long int;
using ld = long double;

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vb>;

const int INF = (1 << 30) - 1;
const ll INF64 = ((ll)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;

const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { -1, 0, 1, 0 };

int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }

struct UnionFind {
	vi par;
	vi size;

	UnionFind(int n) : par(n), size(n, 1) {
		for (int i = 0; i < n; i++) par[i] = i;
	}

	int find(int x) {
		if (x == par[x]) return x;
		return par[x] = find(par[x]);
	}

	void unite(int x, int y) {
		int px = find(x);
		int py = find(y);
		if (px == py) return;
		if (size[px] < size[py]) swap(px, py);

		par[py] = px;
		size[px] += size[py];
	}

	bool same(int x, int y) {
		return find(x) == find(y);
	}
};

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	int n;
	string a, b;
	cin >> n >> a >> b;

	UnionFind uf(36);
	for (int i = 0; i < n; i++) {
		int aPos = isalpha(a[i]) ? a[i] - 'A' + 10 : a[i] - '0';
		int bPos = isalpha(b[i]) ? b[i] - 'A' + 10 : b[i] - '0';

		uf.unite(aPos, bPos);
	}

	ll res = 1;
	vb visited(36);
	for (int i = 0; i < n; i++) {
		int aPos = isalpha(a[i]) ? a[i] - 'A' + 10 : a[i] - '0';
		int bPos = isalpha(b[i]) ? b[i] - 'A' + 10 : b[i] - '0';

		if (visited[uf.find(aPos)] && visited[uf.find(bPos)]) {
			continue;
		}

		visited[uf.find(aPos)] = true;
		visited[uf.find(bPos)] = true;

		vi sames;
		for (int i = 0; i < 10; i++) {
			if (uf.same(aPos, i)) {
				sames.push_back(i);
			}
		}

		if (sames.size() == 0) {
			res *= (i == 0) ? 9 : 10;
		} else {
			res *= sames.size();
		}
	}

	cout << res << endl;
	return 0;
}

Submission Info

Judge Result