http://codeforces.com/contest/794/problem/C

Description

Oleg the client and Igor the analyst are good friends. However, sometimes they argue over little things. Recently, they started a new company, but they are having trouble finding a name for the company.

To settle this problem, they've decided to play a game. The company name will consist of n letters. Oleg and Igor each have a set of n letters (which might contain multiple copies of the same letter, the sets can be different). Initially, the company name is denoted by n question marks. Oleg and Igor takes turns to play the game, Oleg moves first. In each turn, a player can choose one of the letters c in his set and replace any of the question marks with c. Then, a copy of the letter c is removed from his set. The game ends when all the question marks has been replaced by some letter.

For example, suppose Oleg has the set of letters {i, o, i} and Igor has the set of letters {i, m, o}. One possible game is as follows :

Initially, the company name is ???.

Oleg replaces the second question mark with 'i'. The company name becomes ?i?. The set of letters Oleg have now is {i, o}.

Igor replaces the third question mark with 'o'. The company name becomes ?io. The set of letters Igor have now is {i, m}.

Finally, Oleg replaces the first question mark with 'o'. The company name becomes oio. The set of letters Oleg have now is {i}.

In the end, the company name is oio.

Oleg wants the company name to be as lexicographically small as possible while Igor wants the company name to be as lexicographically large as possible. What will be the company name if Oleg and Igor always play optimally?

A string $s = s_1s_2...s_m$ is called lexicographically smaller than a string $t = t_1t_2...t_m$ (where $s ≠ t$) if $si < ti$ where $i$ is the smallest index such that $s_i ≠ t_i$. (so $s_j = t_j$ for all $j < i$)

Input

The first line of input contains a string $s$ of length $n$ ($1 ≤ n ≤ 3·10^5$). All characters of the string are lowercase English letters. This string denotes the set of letters Oleg has initially.

The second line of input contains a string $t$ of length $n$. All characters of the string are lowercase English letters. This string denotes the set of letters Igor has initially.

Output

The output should contain a string of $n$ lowercase English letters, denoting the company name if Oleg and Igor plays optimally.

Examples

input
tinkoff
zscoder output
fzfsirk input
xxxxxx
xxxxxx output
xxxxxx input
ioi
imo output
ioi

Note

One way to play optimally in the first sample is as follows :

Initially, the company name is ???????.

Oleg replaces the first question mark with 'f'. The company name becomes f??????.

Igor replaces the second question mark with 'z'. The company name becomes fz?????.

Oleg replaces the third question mark with 'f'. The company name becomes fzf????.

Igor replaces the fourth question mark with 's'. The company name becomes fzfs???.

Oleg replaces the fifth question mark with 'i'. The company name becomes fzfsi??.

Igor replaces the sixth question mark with 'r'. The company name becomes fzfsir?.

Oleg replaces the seventh question mark with 'k'. The company name becomes fzfsirk.

For the second sample, no matter how they play, the company name will always be xxxxxx.

Announcement

Problem C. Naming Company

$*****$

The two players know the letters in both sets.

Key

题意:甲乙两人各持有一个长度均为n的字符串,轮着向一个新的长也为n的字符串里放字符,甲先行。甲每一步都试图让字符串按字典序最小化,乙每一步都试图让字符串按字典序最大化。问最后这新字符串是什么。

思路:做题做到一半时出题人推送了一个Announcement(如上面所示):甲乙均知道对面的情况。这是个很重要的提示。

显然的是,先排个序,甲从小到大,乙从大到小。然后两个字符串的后一半肯定是用不上了,砍掉。最后甲字符串长度$(len + 1) / 2$,乙字符串长度$(len) / 2$。

甲乙试图让自己走的每一步最优,那就是贪心无误了。

1.当$甲最小的字符<乙最大的字符$时,两者均靠左放置最小/大字符。

2.当$甲最小的字符>=乙最大的字符$时,两者均靠右放置最大/小字符。

如何找当前最优情况想了很久,一开始想的情况很复杂,如何换个角度思考问题很不容易啊。要注意的是第2种情况的等于号,一开始我放在第1种情况上了(“<=”),这是不对的,找了好久最后才发现竟然错在了一个小小的等于号。“=”号一删,瞬间AC。

Code

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 3e5 + 10;
char s1[maxn], s2[maxn], ans[maxn];
int len; bool cmp1(const char &a, const char &b) {
return a < b;
}
bool cmp2(const char &a, const char &b) {
return a > b;
} int main()
{
ios::sync_with_stdio(false);
cin >> s1 >> s2;
len = strlen(s1);
sort(s1, s1 + len, cmp1);
sort(s2, s2 + len, cmp2); int i = 0;
char *pl[2] = { s1, s2 };
for (; (i < len) && (*pl[0] < *pl[1]); ++i) {
ans[i] = *(pl[i & 1]++);
} int j = len - 1;
char *pr[2] = { s1 + (len + 1) / 2 - 1, s2 + (len) / 2 - 1 };
for (; i < len; ++i, --j) {
ans[j] = *(pr[i & 1]--);
} ans[len] = '\0';
cout << ans;
return 0;
}

[刷题]Codeforces 794C - Naming Company的更多相关文章

  1. CodeForces - 794C:Naming Company(博弈&简单贪心)

    Oleg the client and Igor the analyst are good friends. However, sometimes they argue over little thi ...

  2. [刷题codeforces]650A.637A

    650A Watchmen 637A Voting for Photos 点击查看原题 650A又是一个排序去重的问题,一定要注意数据范围用long long ,而且在写计算组合函数的时候注意也要用l ...

  3. [刷题codeforces]651B/651A

    651B Beautiful Paintings 651A Joysticks 点击可查看原题 651B是一个排序题,只不过多了一步去重然后记录个数.每次筛一层,直到全为0.从这个题里学到一个正确姿势 ...

  4. [刷题]Codeforces 786A - Berzerk

    http://codeforces.com/problemset/problem/786/A Description Rick and Morty are playing their own vers ...

  5. [刷题]Codeforces 746G - New Roads

    Description There are n cities in Berland, each of them has a unique id - an integer from 1 to n, th ...

  6. CF刷题-Codeforces Round #481-G. Petya's Exams

    题目链接:https://codeforces.com/contest/978/problem/G 题目大意:n天m门考试,每门考试给定三个条件,分别为:1.可以开始复习的日期.2.考试日期.3.必须 ...

  7. CF刷题-Codeforces Round #481-F. Mentors

    题目链接:https://codeforces.com/contest/978/problem/F 题目大意: n个程序员,k对仇家,每个程序员有一个能力值,当甲程序员的能力值绝对大于乙程序员的能力值 ...

  8. CF刷题-Codeforces Round #481-D. Almost Arithmetic Progression

    题目链接:https://codeforces.com/contest/978/problem/D 题解: 题目的大意就是:这组序列能否组成等差数列?一旦构成等差数列,等差数列的公差必定确定,而且,对 ...

  9. [刷题]Codeforces 785D - Anton and School - 2

    Description As you probably know, Anton goes to school. One of the school subjects that Anton studie ...

随机推荐

  1. 腾讯云报告——MySQL成勒索新目标,数据服务基线安全问题迫在眉睫

    推荐理由 大数据时代,人类产生的数据越来越多,但数据越多的情况下,也会带来数据的安全性问题,如MySQL数据库上的数据,越来越多的黑客盯上了它,今天推荐的这篇文章来自于腾讯云技术社区,主要是针对MyS ...

  2. CSS盒模型和文本溢出

    CSS盒模型和文本溢出 学习目标 认识盒子模型 盒子模型的组成部分 学习盒子模型的相关元素margin padding 文本溢出相关的属性 一.认识盒子模型 盒模型是css布局的基石,它规定了网页元素 ...

  3. Spring Hiernate整合

    Spring整合Hibernate 一.整合目标 1.由IoC容器管理Hibernate的SessionFactory2.让Hibernate使用Spring的声明式事务 二.整合步骤 先加入Hibe ...

  4. 在app中屏蔽第三方键盘

    iOS8开放了安装第三方键盘的权限,但是在项目开发中,有些情况是需要禁用第三方键盘的.比如说,数字键盘上需要自定义按钮,但是在第三方键盘弹出时,按钮就覆盖在这上面了,在这中情况下,最好的办法是禁用第三 ...

  5. matlab实现可调节占空比的方波

    我大概讲一下实现的原理:正弦波移相φ,当使得大于sin(φ)的值为1,其他值为-1,占空比就跟这个φ值之间有联系. 占空比原理图如下所示. 结果上图,可以实现调节占空比,方波频率,方波个数. 下面是函 ...

  6. 用java写的一个程序,可以调用windows系统中自带的各种工具,例如截图,便签等

    由于图片资源没有上传,所以运行后不会有图片,感兴趣的同学可以@我,我打包上传, package SmallPrograme; import java.awt.*; import java.awt.ev ...

  7. CSS3实现一束光划过图片、和文字特效

    在打折图标里面 实现一道白光划过的动画效果 css: <!DOCTYPE html><html><head><meta charset="utf-8 ...

  8. Windows 解决mysql忘记密码怎么办?

    MySQL有时候忘记密码了怎么办?我给出案例和说明!一下就解决了! Windows下的实际操作如下 1.关闭正在运行的MySQL. 2.打开DOS窗口,转到mysql\bin目录. 3.输入mysql ...

  9. Ajax 与 Comet

    Ajax技术的核心是XMLHttpRequest对象(简称XHR). XMLHttpRequest对象 在浏览器中创建XHR对象要像下面这样,使用XMLHttpRequest构造函数. var xhr ...

  10. node-webkit学习之【无边框窗口用JS实现拖动改变大小等】

    效果如下图 原生的如下图(原生的用在自己的app上面太丑了,并且还带边框,所以重写了左上角的三个功能键) 1.首先了解一下nw底下的package.json 文件 { "name" ...