题解
题意:当两个全是数字的字符串,满足下标 i < j i<j i<j, s i > w i s_i>w_i si>wi , 且 s j < w j s_j<w_j sj<wj 时,算作1组符合条件的不可比的字符串,现给出两个字符串,其中部分位置是 ? \texttt{?} ? ,代表 0 ∼ 9 0\sim9 0∼9 中任意一个数字,问符合条件的不可比的字符串有多少组
学习来源 ↓
CodeForces - 296B Yaroslav and Two Strings (容斥)
先计算总共有多少组字符串,每遇到一个 ? \texttt{?} ? ,答案乘10,
然后计算不符合条件的字符串有多少组,
符合条件的字符串满足: i < j i<j i<j, s i > w i s_i>w_i si>wi , 且 s j < w j s_j<w_j sj<wj
那不符合条件的情况就是
1. { s i > w i s j ≥ w j ← 1.\begin{cases}s_i>w_i \\ s_j\ge w_j ← \end{cases} 1.{si>wisj≥wj←
2. { s i ≤ w i ← s j < w j 2.\begin{cases}s_i\le w_i ←\\ s_j< w_j \end{cases} 2.{si≤wi←sj<wj
筛选的时候从总方案数里去掉 s j ≥ w j s_j\ge w_j sj≥wj 的字符串组 和 s i ≤ w i s_i\le w_i si≤wi的字符串组,其中 s i = w i s_i=w_i si=wi 的那部分删了两次,需要加回来
模意义下,注意负数
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
int n, m, K;
string s, w;
ll f1() { // 统计s[j]>=w[j]
ll res = 1;
for (int i = 0; i < n; ++i) {
if (s[i] == '?' && w[i] == '?') res = res * 55 % mod;
else if (s[i] == '?') res = res * (10 - (w[i] - '0')) % mod;
else if (w[i] == '?') res = res * (s[i] - '0' + 1) % mod;
else if (s[i] < w[i]) {
return 0;
}
}
return res;
}
ll f2() { // 统计s[i]<=w[i]
ll res = 1;
for (int i = 0; i < n; ++i) {
if (s[i] == '?' && w[i] == '?') res = res * 55 % mod;
else if (s[i] == '?') res = res * (w[i] - '0' + 1) % mod;
else if (w[i] == '?') res = res * (10 - (s[i] - '0')) % mod;
else if (s[i] > w[i]) {
return 0;
}
}
return res;
}
ll f3() { //统计s[i]==w[i]
ll res = 1;
for (int i = 0; i < n; ++i) {
if (s[i] == '?' && w[i] == '?') res = res * 10 % mod;
else if (s[i] == '?' || w[i] == '?');
else if (s[i] != w[i]) {
return 0;
}
}
return res;
}
int main() {
ios::sync_with_stdio(0);
cin >> n;
cin >> s >> w;
ll ans = 1;
for (int i = 0; i < n; ++i) {
if (s[i] == '?')ans = ans * 10 % mod;
if (w[i] == '?')ans = ans * 10 % mod;
}
cout << ((ans - f1() - f2() + mod + f3()) % mod) << endl;
return 0;
}