Submission #1294734

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll=long long;
using vi=vector<int>;
using vl=vector<long long>;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
#define ITR(i,c) for(auto i=begin(c);i!=end(c);++i)
#define FORE(x,c) for(auto &x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define REPW(i,n) for(i=0;i<(int)(n);++i)
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)   // c++14
#define SZ(c) ((int)c.size())
#define EXIST(c,x) (c.find(x)!=end(c))
#define OUTOFRANGE(y,x,h,w) (y<0||x<0||y>=h||x>=w)
#define dump(...)
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
#define INF (1001001001)
#define INFLL (1001001001001001001ll)
template<class T> ostream& operator << (ostream &os,const vector<T> &v) {
    ITR(i,v) os << *i << (i==end(v)-1 ? "" : "\n"); return os; }
template<class T> istream& operator >> (istream &is,vector<T> &v) {
    ITR(i,v) is >> * i; return is; }
template<class T> istream& operator >> (istream &is, pair<T,T> &p) {
        is >> p.first >> p.second; return is; }
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
//------------------------------------------------------------------------------
struct before_main_function {
    before_main_function() {
        #ifdef int
            #undef INF
            #define INF INFLL
            #define stoi stoll
        #endif
        cin.tie(0);ios::sync_with_stdio(false);
        cout<<setprecision(15)<<fixed;
    }
} before_main_function;
//------------------------------------------------------------------------------

struct union_find {
    vector<int> data;
    vector<char> c;
    union_find(int size) : data(size, -1), c(size, '#') { }
    void unite(int x, int y) {
        x = root(x); y = root(y);
        if(x != y) {
            if(c[x]!='#' && c[y]=='#') c[y]=c[x];
            if(c[x]=='#' && c[y]!='#') c[x]=c[y];
            if(data[y] < data[x]) swap(x, y);
            data[x] += data[y];
            data[y] = x;
        }
    }
    bool same(int x, int y) {
        return root(x) == root(y);
    }
    char get_char(int x) {
        return c[root(x)];
    }
    int root(int x) {
        return data[x] < 0 ? x : data[x] = root(data[x]);
    }
    int size(int x) {
        return -data[root(x)];
    }
};
bool isNum(char x) {
    return ('0'<=x and x<='9');
}
signed main() {
    int n;
    string s1,s2;
    cin>>n>>s1>>s2;
    union_find uf(26);
    vector<bool> ap(26,false);
    int top=-1;
    REP(i,n) {
        if(isNum(s1[i]) && !isNum(s2[i])) {
            uf.c[uf.root(s2[i]-'A')]=s1[i];
            ap[s2[i]-'A']=true;
        }
        if(!isNum(s1[i]) && isNum(s2[i])) {
            uf.c[uf.root(s1[i]-'A')]=s2[i];
            ap[s1[i]-'A']=true;
        }
        if(!isNum(s1[i]) && !isNum(s2[i])) {
            uf.unite(s1[i]-'A',s2[i]-'A');
            if(i==0) top=s1[i]-'A';
            ap[s1[i]-'A']=ap[s2[i]-'A']=true;
        }
    }
    unordered_set<int> roots;
    REP(i,26) {
        roots.insert(uf.root(i));
    }
    int ans=1;
    for(auto itr=roots.begin(); itr!=roots.end(); itr++) {
        if(!ap[*itr]) continue;
        if(top!=-1 && *itr==uf.root(top)) {
            if(uf.get_char(*itr)=='#') {
                ans*=9;
            }
        }
        else {
            if(uf.get_char(*itr)=='#') {
                ans*=10;
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result