Submission #1293264
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pi M_PI
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;
int p[111],r[111];
void init(){rep(i,111)p[i]=i,r[i]=0;}
int find(int x){return (p[x]==x)?x:(p[x]=find(p[x]));}
void unite(int x,int y) {
x=find(x),y=find(y);
if(x==y)return;
if(r[x]<r[y])p[x]=y;
else{p[y]=x;if(r[x]==r[y])r[x]++;}
}
void Main() {
init();
int n;
string s,t;
cin >> n >> s >> t;
rep(k,n) {
rep(i,n) {
if(isdigit(s[i])||isdigit(t[i])) {
char c=s[i],d=t[i];
if(isdigit(d)) swap(c,d);
rep(j,n) {
if(s[j]==d) s[j]=c;
if(t[j]==d) t[j]=c;
}
}
}
}
rep(i,n) {
REP(j,i+1,n) {
if(s[i]==s[j]||s[i]==t[j]||t[i]==s[j]||t[i]==t[j]) unite(i,j);
}
}
ll ans=1;
set<int> se;
rep(i,n) {
if(!isdigit(s[i])||!isdigit(t[i])) {
if(se.count(find(i))) continue;
if(i) ans*=10;
else ans*=9;
se.insert(find(i));
}
}
pr(ans);
}
int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}
Submission Info
Submission Time |
|
Task |
B - 大事な数なのでZ回書きまLた。 |
User |
kzyKT |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
2033 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Score / Max Score |
0 / 0 |
30 / 30 |
70 / 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 |
AC |
1 ms |
256 KB |
subtask2-13.txt |
AC |
1 ms |
256 KB |
subtask2-14.txt |
AC |
1 ms |
256 KB |
subtask2-15.txt |
AC |
1 ms |
256 KB |
subtask2-16.txt |
AC |
1 ms |
256 KB |
subtask2-17.txt |
AC |
1 ms |
256 KB |
subtask2-18.txt |
AC |
1 ms |
256 KB |
subtask2-19.txt |
AC |
1 ms |
256 KB |
subtask2-20.txt |
AC |
1 ms |
256 KB |
subtask2-21.txt |
AC |
1 ms |
256 KB |
subtask2-22.txt |
AC |
1 ms |
256 KB |
subtask2-23.txt |
AC |
1 ms |
256 KB |
subtask2-24.txt |
AC |
1 ms |
256 KB |
subtask2-25.txt |
AC |
1 ms |
256 KB |
subtask2-26.txt |
AC |
1 ms |
256 KB |