[刷题]Codeforces 794C - Naming Company
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的更多相关文章
- CodeForces - 794C:Naming Company(博弈&简单贪心)
Oleg the client and Igor the analyst are good friends. However, sometimes they argue over little thi ...
- [刷题codeforces]650A.637A
650A Watchmen 637A Voting for Photos 点击查看原题 650A又是一个排序去重的问题,一定要注意数据范围用long long ,而且在写计算组合函数的时候注意也要用l ...
- [刷题codeforces]651B/651A
651B Beautiful Paintings 651A Joysticks 点击可查看原题 651B是一个排序题,只不过多了一步去重然后记录个数.每次筛一层,直到全为0.从这个题里学到一个正确姿势 ...
- [刷题]Codeforces 786A - Berzerk
http://codeforces.com/problemset/problem/786/A Description Rick and Morty are playing their own vers ...
- [刷题]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 ...
- CF刷题-Codeforces Round #481-G. Petya's Exams
题目链接:https://codeforces.com/contest/978/problem/G 题目大意:n天m门考试,每门考试给定三个条件,分别为:1.可以开始复习的日期.2.考试日期.3.必须 ...
- CF刷题-Codeforces Round #481-F. Mentors
题目链接:https://codeforces.com/contest/978/problem/F 题目大意: n个程序员,k对仇家,每个程序员有一个能力值,当甲程序员的能力值绝对大于乙程序员的能力值 ...
- CF刷题-Codeforces Round #481-D. Almost Arithmetic Progression
题目链接:https://codeforces.com/contest/978/problem/D 题解: 题目的大意就是:这组序列能否组成等差数列?一旦构成等差数列,等差数列的公差必定确定,而且,对 ...
- [刷题]Codeforces 785D - Anton and School - 2
Description As you probably know, Anton goes to school. One of the school subjects that Anton studie ...
随机推荐
- mysql创建数据表时如何判断是否已经存在?
>>> create table if not exists people(name text,age int(2),gender char(1)); 如上代码表示创建一个名为peo ...
- MYSQL性能优化--分库分表
1.分库分表 1>纵向分表 将本来可以在同一个表的内容,人为划分为多个表.(所谓的本来,是指按照关系型数据库的第三范式要求,是应该在同一个表的.) 分表理由:根据数据的活跃度进行分离,(因为不同 ...
- CSS前端开发学习总结、一
1. 属性选择器: 2. CSS伪类选择器: 3. CSS伪元素: 4. CSS优先级: 5. 行内标签: 6. 块级标签: 7. Display: 8. Line-height:行高 9. text ...
- dellR720重启找不到启动引导项,手动选择也无用。
机器重启后显示 no boot device available.(如下图)检查bios中设置也是没问题的,因为装完系统后根本没动过什么.F11手动选择启动项也还是会跳到这里来. 这台机子做的Raid ...
- Oracle存储过程的调用和执行
1.什么是存储过程: 用于在数据库中完成特定的操作或者任务.是一个PLSQL程序块,可以永久的保存在数据库中以供其他程序调用. 2.无参存储过程的使用: Normal 0 7.8 磅 0 2 fals ...
- 实时消息传输协议(RTMP)详解
一.概念与摘要 RTMP协议从属于应用层,被设计用来在适合的传输协议(如TCP)上复用和打包多媒体传输流(如音频.视频和互动内容).RTMP提供了一套全双工的可靠的多路复用消息服务,类似于TCP协议[ ...
- vuejs单一事件管理组件间的通信
<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8&quo ...
- Asp.net SignalR 应用并实现群聊功能 开源代码
ASP.NET SignalR 是为 ASP.NET 开发人员提供的一个库,可以简化开发人员将实时 Web 功能添加到应用程序的过程.实时 Web 功能是指这样一种功能:当所连接的客户端变得可用时服务 ...
- web console实现
一.效果图 二.实现 web console是基于websocket实现的. 以上做的效果嵌入项目中,因为项目本身是angular1的项目,所以console整体封装成一个angualr modul ...
- jQuery购物车
效果图 HTML代码:(非表格方式) <div class="nav2"> <input type="checkbox" class=&quo ...