codeforces 749C 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 employee n. 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 with n 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，一次轮流投票,D的人可以说R里面的某个人不能投，也可以什么都不做，R里面的同理

思路：暴力模拟。把D和R分别的位置分别装到set里面，然后进行模拟，这里用到STL里面的set，不知道问什么自己写的vector不过，换成set后去可以直接过

set AC代码：

#include <iostream>
#include <cstdio>
#include <map>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
#include <cstring>

using namespace std;

const int max_n = 200005;
int n;
string s;
set<int>v1,v2;

int main() {
    cin >> n;
    cin >> s;
    for(int i = 0; i < n; i++) {
        if(s[i] == 'D') {
            v1.insert(i);
        } else {
            v2.insert(i);
        }
    }
    int pos = 0;//这里用来维护原始序列的下标
    set<int>::iterator it;
    while(v1.size()&&v2.size()) {
        pos%= n;
        if(s[pos] == 'D') {
            it = v2.upper_bound(pos);//删去当前pos后面的R，如果不存在删去第一个
            if(it == v2.end()) {
                it = v2.begin();
            }
            v2.erase(*it);
        }
        if(s[pos] == 'R') {
            it = v1.upper_bound(pos);//同理
            if(it == v1.end()) {
                it = v1.begin();
            }
            v1.erase(*it);
        }
        int mn = n;//这里用来确定下一个位是哪里。
        it = v2.upper_bound(pos);
        if(it != v2.end()) {
            mn = min(mn,*it);
        }
        it = v1.upper_bound(pos);
        if(it != v1.end()) {
            mn = min(mn,*it);
        }
        if(mn == n) {
            if(v2.size() != 0) {
                mn = min(mn,*v2.begin());
            }
            if(v1.size() != 0) {
                mn = min(mn,*v1.begin());
            }
        }
        pos = mn;
    }
    if(v1.size()!=0) {
        printf("D");
    } else {
        printf("R");
    }
    return 0;
}

写了好长时间，自己写的vector就是TLE，看了大牛的博客换成set直接过的。

附上自己写的TLE得vector代码：

#include <iostream>
#include <cstdio>
#include <map>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
#include <cstring>

using namespace std;

const int max_n = 200005;
int n;
string s;
vector<int>v1,v2,v;

int main() {
    cin >> n;
    cin >> s;
    for(int i = 0; i < n; i++) {
        if(s[i] == 'D') {
            v1.push_back(i);
        } else {
            v2.push_back(i);
        }
        v.push_back(i);
    }
    int pos = 0;
    vector<int>::iterator it;
    while(v1.size()!=0&&v2.size()!=0) {
        pos%= n;
        int g;
        if(s[pos] == 'D') {
            it = upper_bound(v2.begin(),v2.end(),pos);

            if(it == v2.end()) {
                it = v2.begin();
            }
            g = *it;
            v2.erase(it);
        }
        if(s[pos] == 'R') {
            it = upper_bound(v1.begin(),v1.end(),pos);
            if(it == v1.end()) {
                it = v1.begin();
            }
            g = *it;
            v1.erase(it);
        }
        it = lower_bound(v.begin(),v.end(),g);
        v.erase(it);
        int mn = n;
        it = upper_bound(v.begin(),v.end(),pos);
        if(it != v.end()){
            mn = min(mn,*it);
        }
        pos = mn;
    }
    if(v1.size()!=0) {
        printf("D");
    } else {
        printf("R");
    }
    return 0;
}