题目链接:http://codeforces.com/contest/1141/problem/D
解题心得:
模拟题,直接刚就行了。
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 100;
char s1[maxn], s2[maxn];
int n, cntz1[300], cntz2[300];//在字母和字母配对的时候记录每一种字母用了多少个
int sp1 = 0, sp2 = 0;//记录?用掉了多少个
vector<int> ve1[300], ve2[300];//记录每一类字符在字符串中的位置
vector<pair<int, int> > ans;//记录配对位置对应的答案
void letter_match_letter() {
for (char i = 'a'; i <= 'z'; i++) {
int Min = min(ve1[i].size(), ve2[i].size());
for (int j = 0; j < Min; j++) {//记录配对的位置
ans.push_back(make_pair(ve1[i][j], ve2[i][j]));
}
cntz1[i] = cntz2[i] = Min;
}
}
void mark_match_letter() {
//第一个字符串?和字符配对]
for (int j = 'a'; j <= 'z'; j++) {
while (cntz2[j] < ve2[j].size()) {
ans.push_back(make_pair(ve1['?'][sp1], ve2[j][cntz2[j]++]));
sp1++;
if (sp1 >= ve1['?'].size()) break;
}
if (sp1 >= ve1['?'].size()) break;
}
//第二个字符串?和字母配对
for (int j = 'a'; j <= 'z'; j++) {
while (cntz1[j] < ve1[j].size()) {
ans.push_back(make_pair(ve1[j][cntz1[j]++], ve2['?'][sp2]));
sp2++;
if (sp2 >= ve2['?'].size()) break;
}
if (sp2 >= ve2['?'].size()) break;
}
}
void mark_match_mark() {
while (sp1 < ve1['?'].size() && sp2 < ve2['?'].size()) {
ans.push_back(make_pair(ve1['?'][sp1++], ve2['?'][sp2++]));
}
}
int main() {
scanf("%d", &n);
scanf("%s%s", s1 + 1, s2 + 1);
for (int i = 1; i <= n; i++) {
ve1[s1[i]].push_back(i);
}
for (int i = 1; i <= n; i++) {
ve2[s2[i]].push_back(i);
}
//首先字母和字母配对
letter_match_letter();
//问号和字母配对
mark_match_letter();
//?和?配对
mark_match_mark();
printf("%d\n", ans.size());
for (int i = 0; i < ans.size(); i++) {
printf("%d %d\n", ans[i].first, ans[i].second);
}
return 0;
}