Submission #1371397
Source Code Expand
#include<iostream> #include<algorithm> #include<cstdio> #include<cstdlib> #include<vector> #include<string> #include<sstream> #include<cmath> #include<numeric> #include<map> #include<stack> #include<queue> #include<cassert> using namespace std; int inf = 1000000000; int main(void) { int n; cin >> n; string s, t; cin >> s >> t; for(int i=0; i<n; i++){ bool a = false; bool b = false; if( '0' <= s[i] && s[i] <= '9' ) a = true; if( '0' <= t[i] && t[i] <= '9' ) b = true; if( !a && !b ){ char p = s[i]; char q = t[i]; for(int j=0; j<n; j++){ if( s[j] == p ) s[j] = q; if( t[j] == p ) t[j] = q; } } } // cerr << s << endl << t << endl; for(int i=0; i<n; i++){ bool a = false; bool b = false; if( '0' <= s[i] && s[i] <= '9' ) a = true; if( '0' <= t[i] && t[i] <= '9' ) b = true; if( a && !b ){ for(int j=0; j<n; j++){ if( s[j] == t[i] ) s[j] = s[i]; if( t[j] == t[i] ) t[j] = s[i]; } } if( !a && b ){ for(int j=0; j<n; j++){ if( s[j] == s[i] ) s[j] = t[i]; if( t[j] == s[i] ) t[j] = t[i]; } } } long long int cnt = 1; for(int i=0; i<n; i++){ if( '0' <= s[i] && s[i] <= '9' ) continue; if( i == 0 ) cnt *= 9; else cnt *= 10; for(int j=0; j<n; j++){ if( s[j] == t[i] ) s[j] = '0'; } } cout << cnt << endl; return 0; } // EOF
Submission Info
Submission Time | |
---|---|
Task | B - 大事な数なのでZ回書きまLた。 |
User | yut071 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1512 Byte |
Status | WA |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 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 | WA | 1 ms | 256 KB |
subtask1-22.txt | AC | 1 ms | 256 KB |
subtask1-23.txt | WA | 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 | WA | 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 | WA | 1 ms | 256 KB |
subtask2-12.txt | WA | 1 ms | 256 KB |
subtask2-13.txt | AC | 2 ms | 256 KB |
subtask2-14.txt | WA | 1 ms | 256 KB |
subtask2-15.txt | WA | 1 ms | 256 KB |
subtask2-16.txt | AC | 1 ms | 256 KB |
subtask2-17.txt | WA | 1 ms | 256 KB |
subtask2-18.txt | WA | 1 ms | 256 KB |
subtask2-19.txt | WA | 1 ms | 256 KB |
subtask2-20.txt | WA | 1 ms | 256 KB |
subtask2-21.txt | WA | 1 ms | 256 KB |
subtask2-22.txt | WA | 1 ms | 256 KB |
subtask2-23.txt | WA | 1 ms | 256 KB |
subtask2-24.txt | WA | 1 ms | 256 KB |
subtask2-25.txt | WA | 1 ms | 256 KB |
subtask2-26.txt | AC | 1 ms | 256 KB |