codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

749C.md (2788B)


      1 Source: https://codeforces.com/problemset/problem/749/C
      2 
      3 C. Voting
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 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.
     22 
     23 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:
     24 
     25 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).
     26 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.
     27 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.
     28 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.
     29 
     30 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.
     31 
     32 Input
     33 
     34 The first line of the input contains a single integer *n* (1 ≤ *n* ≤ 200 000) — the number of employees.
     35 
     36 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.
     37 
     38 Output
     39 
     40 Print 'D' if the outcome of the vote will be suitable for depublicans and 'R' if remocrats will win.
     41 
     42 Examples
     43 
     44 Input
     45 
     46 ```
     47 5  
     48 DDRRR
     49 ```
     50 
     51 Output
     52 
     53 ```
     54 D
     55 ```
     56 
     57 Input
     58 
     59 ```
     60 6  
     61 DDRRRR
     62 ```
     63 
     64 Output
     65 
     66 ```
     67 R
     68 ```
     69 
     70 Note
     71 
     72 Consider one of the voting scenarios for the first sample:
     73 
     74 1. Employee 1 denies employee 5 to vote.
     75 2. Employee 2 denies employee 3 to vote.
     76 3. Employee 3 has no right to vote and skips his turn (he was denied by employee 2).
     77 4. Employee 4 denies employee 2 to vote.
     78 5. Employee 5 has no right to vote and skips his turn (he was denied by employee 1).
     79 6. Employee 1 denies employee 4.
     80 7. Only employee 1 now has the right to vote so the voting ends with the victory of depublicans.