Submission #1176158
Source Code Expand
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <random>
#include <deque>
#define INF_LL 1e18
#define INF 1e9
#define REP(i, n) for(int i = 0;i < (n);i++)
#define FOR(i, a, b) for(int i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
using namespace std;
using ll = long long;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;
const ll MOD = 1e9+7;
int dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
int dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
template<typename T>
void chmax(T &a, T &b){
a = max(a, b);
}
template<typename T>
void chmin(T &a, T &b){
a = min(a, b);
}
class Union_find{
private:
vector<int> par;
vector<int> rank;
int n;
public:
Union_find(int a){
n = a;
for(int i = 0;i < n;i++){
par.push_back(i);
rank.push_back(0);
}
}
int find(int x){
if(par[x] == x){
return x;
}else{
return par[x] = find(par[x]);
}
}
void unite(int x, int y){
x = find(x);
y = find(y);
if(x == y) return;
if(rank[x] < rank[y]){
par[x] = y;
}else{
par[y] = x;
if(rank[x] == rank[y]) rank[x]++;
}
}
bool same(int x, int y){
return find(x) == find(y);
}
};
class RMQ{
int n;
vector<int> dat;
public:
RMQ(int n_){
n = 1;
while(n < n_) n *= 2;
REP(i, n*2-1){
dat.push_back(INF);
}
}
void update(int x, int i){
i += n-1;
dat[i] = x;
while(i > 0){
i = (i-1)/2;
dat[i] = min(dat[i*2+1], dat[i*2+2]);
}
}
int query(int a, int b, int l, int r, int x){
if(a <= l && r <= b) return dat[x];
if(r <= a || b <= l) return INF;
int res = INF;
res = min(query(a, b, l, (l+r)/2, x*2+1), query(a, b, (l+r)/2, r, x*2+2));
return res;
}
int query(int a, int b){
return query(a, b, 0, n, 0);
}
};
const ll mod = 1e9+7;
int main(void){
int N;
Union_find uf(27);
string s1, s2;
cin >> N;
cin >> s1 >> s2;
REP(i, N){
if(s1[i]-='A' < 0) s1[i] -= 'A'-1;
else s1[i] = 0;
if(s2[i] -= 'A' < 0) s2[i] -= 'A'-1;
else s2[i] = 0;
uf.unite(s1[i], s2[i]);
}
ll res = 1;
bool used[27] = {};
REP(i, N){
if(i == 0){
if(!used[s1[i]] && uf.find(s1[i]) == s1[i]){
if(!uf.same(0, s1[i]))
res *= 9;
used[s1[i]] = true;
}
if(!used[s2[i]] && uf.find(s2[i]) == s2[i]){
if(!uf.same(0, s2[i]))
res *= 9;
used[s2[i]] = true;
}
}else{
if(!used[s1[i]] && uf.find(s1[i]) == s1[i]){
if(!uf.same(0, s1[i]))
res *= 10;
used[s1[i]] = true;
}
if(!used[s2[i]] && uf.find(s2[i]) == s2[i]){
if(!uf.same(0, s2[i]))
res *= 10;
used[s2[i]] = true;
}
}
}
cout << res << endl;
}
Submission Info
Submission Time |
|
Task |
B - 大事な数なのでZ回書きまLた。 |
User |
maze1230 |
Language |
C++14 (GCC 5.4.1) |
Score |
30 |
Code Size |
2912 Byte |
Status |
RE |
Exec Time |
103 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Score / Max Score |
0 / 0 |
30 / 30 |
0 / 70 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt |
Subtask1 |
subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask1-21.txt, subtask1-22.txt, subtask1-23.txt, subtask1-24.txt, subtask1-25.txt, subtask1-26.txt |
Subtask2 |
subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask1-21.txt, subtask1-22.txt, subtask1-23.txt, subtask1-24.txt, subtask1-25.txt, subtask1-26.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt, subtask2-16.txt, subtask2-17.txt, subtask2-18.txt, subtask2-19.txt, subtask2-20.txt, subtask2-21.txt, subtask2-22.txt, subtask2-23.txt, subtask2-24.txt, subtask2-25.txt, subtask2-26.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0-sample01.txt |
AC |
1 ms |
256 KB |
subtask0-sample02.txt |
AC |
1 ms |
256 KB |
subtask0-sample03.txt |
AC |
1 ms |
256 KB |
subtask1-01.txt |
AC |
1 ms |
256 KB |
subtask1-02.txt |
AC |
1 ms |
256 KB |
subtask1-03.txt |
AC |
1 ms |
256 KB |
subtask1-04.txt |
AC |
1 ms |
256 KB |
subtask1-05.txt |
AC |
1 ms |
256 KB |
subtask1-06.txt |
AC |
1 ms |
256 KB |
subtask1-07.txt |
AC |
1 ms |
256 KB |
subtask1-08.txt |
AC |
1 ms |
256 KB |
subtask1-09.txt |
AC |
1 ms |
256 KB |
subtask1-10.txt |
AC |
1 ms |
256 KB |
subtask1-11.txt |
AC |
1 ms |
256 KB |
subtask1-12.txt |
AC |
1 ms |
256 KB |
subtask1-13.txt |
AC |
1 ms |
256 KB |
subtask1-14.txt |
AC |
1 ms |
256 KB |
subtask1-15.txt |
AC |
1 ms |
256 KB |
subtask1-16.txt |
AC |
1 ms |
256 KB |
subtask1-17.txt |
AC |
1 ms |
256 KB |
subtask1-18.txt |
AC |
1 ms |
256 KB |
subtask1-19.txt |
AC |
1 ms |
256 KB |
subtask1-20.txt |
AC |
1 ms |
256 KB |
subtask1-21.txt |
AC |
1 ms |
256 KB |
subtask1-22.txt |
AC |
1 ms |
256 KB |
subtask1-23.txt |
AC |
1 ms |
256 KB |
subtask1-24.txt |
AC |
1 ms |
256 KB |
subtask1-25.txt |
AC |
1 ms |
256 KB |
subtask1-26.txt |
AC |
1 ms |
256 KB |
subtask2-01.txt |
AC |
1 ms |
256 KB |
subtask2-02.txt |
AC |
1 ms |
256 KB |
subtask2-03.txt |
AC |
1 ms |
256 KB |
subtask2-04.txt |
AC |
1 ms |
256 KB |
subtask2-05.txt |
AC |
1 ms |
256 KB |
subtask2-06.txt |
AC |
1 ms |
256 KB |
subtask2-07.txt |
AC |
1 ms |
256 KB |
subtask2-08.txt |
AC |
1 ms |
256 KB |
subtask2-09.txt |
AC |
1 ms |
256 KB |
subtask2-10.txt |
AC |
1 ms |
256 KB |
subtask2-11.txt |
AC |
1 ms |
256 KB |
subtask2-12.txt |
RE |
102 ms |
256 KB |
subtask2-13.txt |
RE |
103 ms |
256 KB |
subtask2-14.txt |
RE |
103 ms |
256 KB |
subtask2-15.txt |
RE |
97 ms |
256 KB |
subtask2-16.txt |
RE |
102 ms |
256 KB |
subtask2-17.txt |
RE |
102 ms |
256 KB |
subtask2-18.txt |
RE |
102 ms |
256 KB |
subtask2-19.txt |
RE |
102 ms |
256 KB |
subtask2-20.txt |
RE |
96 ms |
256 KB |
subtask2-21.txt |
RE |
97 ms |
256 KB |
subtask2-22.txt |
RE |
97 ms |
256 KB |
subtask2-23.txt |
RE |
96 ms |
256 KB |
subtask2-24.txt |
RE |
97 ms |
256 KB |
subtask2-25.txt |
RE |
96 ms |
256 KB |
subtask2-26.txt |
AC |
1 ms |
256 KB |