codeforces-D. Colored Boots

'?‘可以匹配所有的字符问最多有多少个匹配的字符对
贪心
s1串和s2串中只要有一样的字符就凑一对
剩下的用’?‘和另一串中非’?‘的匹配
剩下的两串’?'匹配
这样就是最多的了

#include <bits/stdc++.h>using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;const double PI=acos(-1.0);
const double eps=1e-6;
const ll mod=1e9+7;
const int inf=0x3f3f3f3f;
#define N 200005int n;
string s1;
string s2;
vector<int> arr1[200];
vector<int> arr2[200];
int he1[200];
int he2[200];
int add=0;
int t1,t2;
int main(){#ifdef LOCALfreopen("in.txt","r",stdin);//freopen("out.txt","w",stdout);
#endifscanf("%d%*c",&n);getline(cin,s1);getline(cin,s2);for(int i=0; i<n; i++){arr1[s1[i]].push_back(i+1);he1[s1[i]]++;arr2[s2[i]].push_back(i+1);he2[s2[i]]++;}t1=he1['?'];t2=he2['?'];for(int i='a'; i<='z'; i++){add+=min(he1[i],he2[i]);}int ttt1=min(n-add-t2,t1);int ttt2=min(n-add-t1,t2);add+=ttt2;t2-=ttt2;add+=ttt1;t1-=ttt1;add+=min(t1,t2);printf("%d\n",add);int tt;for(int i='a'; i<='z'; i++){tt=min(he1[i],he2[i]);while(tt--){printf("%d %d\n",arr1[i].back(),arr2[i].back());arr1[i].pop_back();arr2[i].pop_back();}}int f='a';while(ttt1--){if(!arr2[f].empty()){printf("%d %d\n",arr1['?'].back(),arr2[f].back());arr1['?'].pop_back();arr2[f].pop_back();} else{ttt1++;f++;}}f='a';while(ttt2--){if(!arr1[f].empty()){printf("%d %d\n",arr1[f].back(),arr2['?'].back());arr1[f].pop_back();arr2['?'].pop_back();} else{ttt2++;f++;}}int ttt3=min(t1,t2);while(ttt3--){printf("%d %d\n",arr1['?'].back(),arr2['?'].back());arr1['?'].pop_back();arr2['?'].pop_back();}return 0;
}

codeforces-D. Colored Boots相关推荐

CodeForces - 1141D Colored Boots(暴力+水题)
题目链接:点击查看题目大意:给出两个字符串s和t,两个字符串中相同的字母可以匹配,问号可以和任意字符匹配,现在问两个字符串最多能匹配多少个字符,并给出匹配的下标题目分析:挺好玩的一道水题,大体思路 ...
Colored Boots
https://codeforces.com/contest/1141/problem/D 题解: 记录第一个字符串每个字母的位置历遍第二个字符串,先跳过?字符,因为?不可以与?字符配对先,造成浪费 ...
[CodeForces-1141D] Colored Boots
题意:从两串长度为n的字符串中找到相同的字符,问号可以和任意字符匹配,然后输出最多可以匹配多少个字符(每个字符最多匹配一次),输出个数x并在接下来x行中输出x对相匹配的字符分别在两串字符中的位置. 题 ...
codeforces 424E Colored Jenga (状态压缩，概率dp用hash记忆优化搜索)
题意: 给出以最多6层的积木,每层可以由三个木块拼成,总共有三种颜色的木块,开始时给出了积木的排列情况,我们每次可以从积木中抽一块木块,抽木块的规则是投骰子,骰子分别投到red,blue,green, ...
CodeForces - 780C Andryusha and Colored Balloons（dfs染色）
Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, ...
C. Colored Balls: Revisited codeforces 1728A
Problem - 1728A - Codeforces 题目大意:有n个袋子,每个袋子有cnt个球,每次可以拿出两个不同袋子的球,问最后可能剩下的是编号为多少的袋子思路:奇数个球每次拿2个,最后至 ...
codeforces Kyoya and Colored Balls
题解见:http://blog.csdn.net/libin56842/article/details/46650209 注意这里的组合数取模~~~ 1 /*Author :usedrose */ 2 ...
Codeforces Round #336 (Div. 2) D. Zuma 记忆化搜索
D. Zuma 题目连接: http://www.codeforces.com/contest/608/problem/D Description Genos recently installed t ...
【Codeforces】 Round #374 (Div. 2)
Position:http://codeforces.com/contest/721 我的情况开始还是rank1,秒出C.(11:00机房都走光了,我ma到11:05才走,只打了一个小时) 结果.. ...

codeforces-D. Colored Boots

codeforces-D. Colored Boots相关推荐

最新文章

热门文章