649 Dota2 Senate

1 题目

In the world of Dota2, there are two parties: the Radiant and the Dire.

The Dota2 senate consists of senators coming from two parties. Now the senate wants to make a decision about a change in the Dota2 game. The voting for this change is a round-based procedure. In each round, each senator can exercise one of the two rights:

1. Ban one senator's right:
   A senator can make another senator lose all his rights in this and all the following rounds.
2. Announce the victory:
   If this senator found the senators who still have rights to vote are all from the same party, he can announce the victory and make the decision about the change in the game.

 

Given a string representing each senator's party belonging. The character 'R' and 'D' represent the Radiant party and the Dire party respectively. Then if there are n senators, the size of the given string will be n.

The round-based procedure starts from the first senator to the last senator in the given order. This procedure will last until the end of voting. All the senators who have lost their rights will be skipped during the procedure.

Suppose every senator is smart enough and will play the best strategy for his own party, you need to predict which party will finally announce the victory and make the change in the Dota2 game. The output should be Radiant or Dire.

Example 1:

Input: "RD"
Output: "Radiant"
Explanation: The first senator comes from Radiant and he can just ban the next senator's right in the round 1. 
And the second senator can't exercise any rights any more since his right has been banned. 
And in the round 2, the first senator can just announce the victory since he is the only guy in the senate who can vote.

Example 2:

Input: "RDD"
Output: "Dire"
Explanation: 
The first senator comes from Radiant and he can just ban the next senator's right in the round 1. 
And the second senator can't exercise any rights anymore since his right has been banned. 
And the third senator comes from Dire and he can ban the first senator's right in the round 1. 
And in the round 2, the third senator can just announce the victory since he is the only guy in the senate who can vote.

Note:

1. The length of the given string will in the range [1, 10,000].

 2 尝试解

2.1 分析

由R和D组成的字符串中，每个字符代表来自R方或者D方的一个议员，按照字符串的顺序轮流发言。每个议员发言时可以对敌方的一个议员实行禁言，被禁言的议员永久失去所有权力而被跳过。直到一方所有的议员被禁言，另一方获胜。如果每个议员都以最优策略博弈，问获胜方。

每个议员的最优选择就是禁言掉下一个要发言的议员。如RDRD，第一个R议员禁言第一个D议员，可以为第二个R议员争取发言机会。

2.2 代码

class Solution {
public:
    string predictPartyVictory(string senate) {
        bool flagD = true, flagR = true;
        int D = 0, R = 0;
        while(flagD && flagR){
            flagD = false;
            flagR = false;
            for(int i = 0; i < senate.size();i++){
                if(senate[i]== 'D'){
                    if(D > 0){
                        D--;
                        senate[i] = '0';
                    }
                    else {
                        R++;
                        flagD = true;
                    } 
                }
                else if(senate[i]=='R'){
                    if(R > 0){
                        R--;
                        senate[i]='0';
                    }
                    else{
                        flagR = true;
                        D++;                        
                    }
                }
            }
        }
        return flagD?"Dire":"Radiant";
    }
};

3 标准解

class Solution {
public:
    string predictPartyVictory(string senate) {
        queue<int> q1, q2;
        int n = senate.length();
        for(int i = 0; i<n; i++)
            (senate[i] == 'R')?q1.push(i):q2.push(i);
        while(!q1.empty() && !q2.empty()){
            int r_index = q1.front(), d_index = q2.front();
            q1.pop(), q2.pop();
            (r_index < d_index)?q1.push(r_index + n):q2.push(d_index + n);
        }
        return (q1.size() > q2.size())? "Radiant" : "Dire";
    }
};