Submission #1680715


Source Code Expand

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define imfor(i, n) for(int i = 0; i < n; i++)
using namespace std;
ll MOD = 1000000007;

int main() {
    int n;
    string s1, s2;
    int a[26];
    imfor(i, 26) {
        a[i] = -1;
    }
    cin >> n;
    cin >> s1;
    cin >> s2;
    imfor(i, s1.size()) {
        if (isdigit(s1[i]) && !isdigit(s2[i])) {
            a[s2[i] - 'A'] = 1;
            s2[i] = s1[i];
        }
        else if (isdigit(s2[i]) && !isdigit(s1[i])) {
            a[s1[i] - 'A'] = 1;
            s1[i] = s2[i];
        }
    }
    imfor(i, s1.size()) {
        if (!isdigit(s1[i]) && a[s1[i] - 'A'] != -1) {
            s1[i] = '1';
        }
        if (!isdigit(s2[i]) && a[s1[i] - 'A'] != -1) {
            s2[i] = '1';
        }
    }
    ll ans = 1;
    imfor(i, s1.size()) {
        if (!isdigit(s1[i]) && !isdigit(s2[i])) {
            if(a[s1[i] - 'A'] == -1 && a[s2[i] - 'A'] == -1) {
                a[s1[i] - 'A'] = 1;
                a[s2[i] - 'A'] = 1;
                if (i == 0) {
                    ans *= 9;
                }
                else {
                    ans *= 10;
                }
            }
        }
        if (!isdigit(s1[i]) && a[s1[i] - 'A'] != -1) {
            a[s2[i] - 'A'] = 1;
        }
        if (!isdigit(s2[i]) && a[s2[i] - 'A'] != -1) {
            a[s1[i] - 'A'] = 1;
        }
    }
    cout << ans << endl;
}

Submission Info

Submission Time
Task B - 大事な数なのでZ回書きまLた。
User imaizumi14
Language C++14 (GCC 5.4.1)
Score 30
Code Size 1734 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 0 / 70
Status
AC × 3
AC × 29
AC × 51
WA × 4
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 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 AC 1 ms 256 KB
subtask2-13.txt WA 1 ms 256 KB
subtask2-14.txt AC 1 ms 256 KB
subtask2-15.txt WA 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