-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy path649. Dota2 Senate.cpp
145 lines (106 loc) · 4.34 KB
/
649. Dota2 Senate.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
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 decide on 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:
Ban one senator's right: A senator can make another senator lose all
his rights in this and all the following rounds.
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 decide
on the change in the game.
Given a string senate representing each senator's party belonging.
The character 'R' and 'D' represent the Radiant party and the Dire party.
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.
Predict which party will finally announce the victory and change the Dota2 game.
The output should be "Radiant" or "Dire".
Example 1:
Input: senate = "RD"
Output: "Radiant"
Explanation:
The first senator comes from Radiant and he can just ban the next senator's right in round 1.
And the second senator can't exercise any rights anymore since his right has been banned.
And in 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: senate = "RDD"
Output: "Dire"
Explanation:
The first senator comes from Radiant and he can just ban the next senator's right in 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 round 1.
And in round 2, the third senator can just announce the victory since he is the only guy in
the senate who can vote.
Constraints:
n == senate.length
1 <= n <= 10^4
senate[i] is either 'R' or 'D'.
********************************************************************************
# Approach 1:
class Solution {
public:
string predictPartyVictory(string senate) {
int n = senate.size(), rcnt = 0, dcnt = 0;
vector <bool> dead(n, false);
for (int i = 0; i < n; i++) {
if (senate[i] == 'R') rcnt++;
else dcnt++;
}
while (rcnt != 0 && dcnt != 0) {
for (int i = 0; i < n; i++) {
if (!dead[i]) {
int j = i + 1;
if (senate[i] == 'R') {
while (j % n != i) {
if (senate[j % n] == 'D' && !dead[j % n]) {
dead[j % n] = true;
dcnt--;
break;
}
j++;
}
} else {
while (j % n != i) {
if (senate[j % n] == 'R' && !dead[j % n]) {
dead[j % n] = true;
rcnt--;
break;
}
j++;
}
}
}
}
}
return rcnt > dcnt ? "Radiant" : "Dire";
}
};
TC -> O(n ^ 2), n is the size of senate
SC -> O(n), n is the size of senate
********************************************************************************
# Approach 2:
class Solution {
public:
string predictPartyVictory(string senate) {
int n = senate.size();
queue <int> rind, dind;
for (int i = 0; i < n; i++) {
if (senate[i] == 'R') rind.push(i);
else dind.push(i);
}
while (!rind.empty() && !dind.empty()) {
int rturn = rind.front();
rind.pop();
int dturn = dind.front();
dind.pop();
if (rturn < dturn) rind.push(rturn + n);
else dind.push(dturn + n);
}
return dind.empty() ? "Radiant" : "Dire";
}
};
TC -> O(n), n is the size of senate
SC -> O(n), n is the size of senate