Codeforces Round #324 (Div. 2) C. Marina and Vasya（贪心）

最新推荐文章于 2016-03-07 17:04:20 发布

原创最新推荐文章于 2016-03-07 17:04:20 发布 · 403 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#贪心

贪心专栏收录该内容

35 篇文章

订阅专栏

题意:

$给定2个长度为N\le 10^5的字符串a, b, 定义f(a,b)为a与b相同位置不同字符的个数$
$现要求构造一个同样长度的字符串c,使得f(c,a)=f(c,b)=t, t\le N$

分析:

$显然相同的不变, 不然构造相同的需要2个字符,一个和a相同, 一个和b相同$
$需要相同的个数same = n-t, 假设已有相同的个数为cnt, 如果(n-cnt)/2+cnt<same, 显然不可构造$
$构造办法, 先选相同的, 然后每2个构造剩下要求相同的, 然后构造不同的$
$被这个水题的题意坑了。。。$

代码:

//
//  Created by TaoSama on 2016-01-28
//  Copyright (c) 2015 TaoSama. All rights reserved.
//
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>

using namespace std;
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;

int n, d;
char s[N], t[N], ans[N];

int main() {
#ifdef LOCAL
    freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);
//  freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);
#endif
    ios_base::sync_with_stdio(0);

    while(scanf("%d%d%s%s", &n, &d, s + 1, t + 1) == 4) {
        memset(ans, 0, sizeof ans);
        int cnt = 0;
        for(int i = 1; i <= n; ++i) cnt += s[i] == t[i];
        int same = n - d;
        if((n - cnt) / 2 + cnt < same) {
            puts("-1");
            continue;
        }

        cnt = min(cnt, same);
        for(int i = 1, j = 1; i <= n && j <= cnt; ++i)
            if(s[i] == t[i]) ans[i] = s[i], ++j;
        same -= cnt;
        for(int i = 1, j = 1; i <= n && j <= same; ++i)
            if(s[i] != t[i] && !ans[i]) ans[i] = s[i], ++j;
        for(int i = 1, j = 1; i <= n && j <= same; ++i)
            if(s[i] != t[i] && !ans[i]) ans[i] = t[i], ++j;
        for(int i = 1; i <= n; ++i) {
            if(ans[i]) continue;
            for(int j = 'a'; j <= 'z'; ++j)
                if(s[i] != j && t[i] != j) {ans[i] = j; break;}
        }
        puts(ans + 1);
    }
    return 0;
}