Codeforces Round #388(Div. 2)C. Voting【贪心+模拟】

C. Voting

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

There are n employees in Alternative Cake Manufacturing (ACM). They are now voting on some very important question and the leading world media are trying to predict the outcome of the vote.

Each of the employees belongs to one of two fractions: depublicans or remocrats, and these two fractions have opposite opinions on what should be the outcome of the vote. The voting procedure is rather complicated:

1. Each of n employees makes a statement. They make statements one by one starting from employees 1 and finishing with employeen. If at the moment when it's time for the i-th employee to make a statement he no longer has the right to vote, he just skips his turn (and no longer takes part in this voting).
2. When employee makes a statement, he can do nothing or declare that one of the other employees no longer has a right to vote. It's allowed to deny from voting people who already made the statement or people who are only waiting to do so. If someone is denied from voting he no longer participates in the voting till the very end.
3. When all employees are done with their statements, the procedure repeats: again, each employees starting from 1 and finishing withn who are still eligible to vote make their statements.
4. The process repeats until there is only one employee eligible to vote remaining and he determines the outcome of the whole voting. Of course, he votes for the decision suitable for his fraction.

You know the order employees are going to vote and that they behave optimal (and they also know the order and who belongs to which fraction). Predict the outcome of the vote.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 200 000) — the number of employees.

The next line contains n characters. The i-th character is 'D' if the i-th employee is from depublicans fraction or 'R' if he is from remocrats.

Output

Print 'D' if the outcome of the vote will be suitable for depublicans and 'R' if remocrats will win.

Examples

input

5
DDRRR

output

D

input

6
DDRRRR

output

R

Note

Consider one of the voting scenarios for the first sample:

1. Employee 1 denies employee 5 to vote.
2. Employee 2 denies employee 3 to vote.
3. Employee 3 has no right to vote and skips his turn (he was denied by employee 2).
4. Employee 4 denies employee 2 to vote.
5. Employee 5 has no right to vote and skips his turn (he was denied by employee 1).
6. Employee 1 denies employee 4.
7. Only employee 1 now has the right to vote so the voting ends with the victory of depublicans.

题目大意;

有两伙人，一伙人用编号D来表示，一伙人用编号R来表示，我们游戏规则是这样的：

每一轮游戏从第一个人开始，如果当前这个人已经被禁言了，那么其没有说话资格，就相当于出局了。那么跳过这个人，如果当前这个人没有出局

那么这个人要么不进行操作，要么对于敌方一个人，让其禁言，即让其出局。

一伙人胜利的标志就是对方没有人还在场。

问两伙人的选择都是最优的，那么谁能赢。

思路：

1、因为胜利的标志是让对方所有人都出局（禁言），那么很明显，如果一个人还在场，那么肯定不会不进行操作，肯定要选择让对方一个人出局，才是最优的选择。

2、那么接下来我们模拟每一局的游戏即可，注意姿势，姿势不好会各种TLE........

3、如果使用了队列的小伙伴们千万注意队列为空的时候不要提取队头元素，忘记处理会RE一发- -

Ac代码：

#include<stdio.h>
#include<string.h>
#include<queue>
#include<algorithm>
using namespace std;
char a[200600];
int b[200600];
int r[200600];
int vis[200600];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        memset(vis,0,sizeof(vis));
        scanf("%s",a);
        queue<int >d;
        queue<int >r;
        for(int i=0;i<n;i++)
        {
            if(a[i]=='D')d.push(i);
            else r.push(i);
        }
        while(d.size()>0&&r.size()>0)
        {
            for(int i=0;i<n;i++)
            {
                if(vis[i]==1)continue;
                if(a[i]=='D')
                {
                    int u=d.front();
                    d.pop();d.push(u);
                    int v=r.front();
                    vis[v]=1;
                    r.pop();
                }
                else
                {
                    int u=r.front();
                    r.pop();r.push(u);
                    int v=d.front();
                    vis[v]=1;
                    d.pop();
                }
                if(d.size()==0||r.size()==0)break;
            }
            if(d.size()==0||r.size()==0)break;
        }
        if(d.size()==0)printf("R\n");
        else printf("D\n");
    }
}