Mittel 0 gelöst 0% Erfolgsquote

Runoff Election

Run an instant runoff election on ranked ballots, eliminating the weakest candidates round by round.

Das lernst du

  • Count each ballot for its top remaining choice
  • Detect a majority winner and a full tie
  • Eliminate all candidates with the lowest count

Problem

Übersetzung anzeigen

In an instant runoff election, every voter ranks all the candidates. The count goes in rounds:

  1. Each ballot counts as one vote for its highest-ranked candidate who is still in the race.
  2. If a candidate has more than half of all ballots, that candidate wins.
  3. Otherwise, if every remaining candidate has the same number of votes, they are all tied and the election ends.
  4. Otherwise, every remaining candidate with the fewest votes is eliminated (all of them at once if several share the lowest count), and a new round starts.

Implement runoff_election(candidates, ballots).

Input

candidates: The candidates' names. Candidate i is candidates[i].

ballots: One row per voter: the candidate numbers (0-based) from most preferred to least preferred. Each row lists every candidate exactly once.

Output

Return a list with the winner's name, or, if the election ends in a tie, the names of all tied candidates in the order they appear in candidates. With no ballots, all candidates are tied.

Einschränkungen

1 ≤ length of candidates ≤ 9

0 ≤ number of ballots ≤ 200

Beispiele

Beispiel 1
Eingabe:
candidates = ["Ana", "Bo", "Cy"]
ballots = [
    [0, 1, 2],
    [0, 2, 1],
    [1, 2, 0],
    [1, 0, 2],
    [2, 0, 1]
]

Erwartete Ausgabe:
expected = ["Ana"]
Eingabe:
std::vector<std::string> candidates = {"Ana", "Bo", "Cy"};
std::vector<std::vector<long long>> ballots = {
    {0, 1, 2},
    {0, 2, 1},
    {1, 2, 0},
    {1, 0, 2},
    {2, 0, 1}
};

Erwartete Ausgabe:
std::vector<std::string> expected = {"Ana"};
Eingabe:
string[] candidates = new string[] {"Ana", "Bo", "Cy"};
long[][] ballots = new long[][] {
    new long[] {0, 1, 2},
    new long[] {0, 2, 1},
    new long[] {1, 2, 0},
    new long[] {1, 0, 2},
    new long[] {2, 0, 1}
};

Erwartete Ausgabe:
string[] expected = new string[] {"Ana"};

Erläuterung

Round 1: Ana 2, Bo 2, Cy 1; nobody has more than 2.5, so Cy is out. Cy's ballot moves to Ana, who wins with 3 of 5: ["Ana"].

Beispiel 2
Eingabe:
candidates = ["Ana", "Bo", "Cy"]
ballots = [
    [0, 1, 2],
    [0, 1, 2],
    [1, 2, 0],
    [1, 2, 0],
    [2, 1, 0],
    [2, 1, 0]
]

Erwartete Ausgabe:
expected = ["Ana", "Bo", "Cy"]
Eingabe:
std::vector<std::string> candidates = {"Ana", "Bo", "Cy"};
std::vector<std::vector<long long>> ballots = {
    {0, 1, 2},
    {0, 1, 2},
    {1, 2, 0},
    {1, 2, 0},
    {2, 1, 0},
    {2, 1, 0}
};

Erwartete Ausgabe:
std::vector<std::string> expected = {"Ana", "Bo", "Cy"};
Eingabe:
string[] candidates = new string[] {"Ana", "Bo", "Cy"};
long[][] ballots = new long[][] {
    new long[] {0, 1, 2},
    new long[] {0, 1, 2},
    new long[] {1, 2, 0},
    new long[] {1, 2, 0},
    new long[] {2, 1, 0},
    new long[] {2, 1, 0}
};

Erwartete Ausgabe:
string[] expected = new string[] {"Ana", "Bo", "Cy"};

Erläuterung

Every candidate has 2 first-place votes out of 6, so the three of them are tied: ["Ana", "Bo", "Cy"].

So gehst du vor

Versuch es zuerst allein und öffne dann einen Hinweis nach dem anderen.

Hinweis 1

Keep a true/false list of who is still in the race and recount from scratch every round.

Hinweis 2

A majority means votes × 2 greater than the number of ballots.

Hinweis 3

Find the lowest count among remaining candidates only; if everyone remaining has it, the election is a tie.

Erwartete Komplexität

O(c^2 × b) time, O(c) extra space

Referenzen

Diese Aufgabe wurde für CodeUtility angepasst. Beachte die oben genannten Vorgaben und Einschränkungen.

Die beste bestandene Lösung jedes Coders. Schnellere, sparsamere und besser bewertete Lösungen stehen weiter oben.

Noch keine bestandene Lösung. Löse sie und hol dir Platz eins.

Von anderen lernen

Community-Lösungen

Noch keine veröffentlichten Lösungen. Löse die Aufgabe und teile als Erster eine Lösung.