J. Jinxed Betting

Codeforces

IDCF10248J

Time3000ms

Memory256MB

Difficulty—

English · Original

Formal · Original

Julia is betting on a large sporting competition involving matches between pairs of teams. There are no parallel matches and each bettor receives one point for every correct bet they make. Julia had a good streak and is in the lead. Now she worries that her good luck may be turning, and decides to change her strategy. She collaborates with a betting shop owner who tells her the bets made by everyone else. Whenever Julia makes a bet, she first checks the bets of all bettors with the most points so far (except herself of course) and then chooses the same team as the majority. In the case of a tie, she bets on her favourite of the two teams in the game. Julia wants to know for how many more matches she is guaranteed to stay in the lead in the worst case (i.e., no matter what bets the others make or what the outcomes of the games are). For this problem we consider Julia to be in the lead if there is no other bettor that has strictly more points than her. For example, suppose as in Sample Input 1 that Julia initially has three points, and there are two other bettors with three and two points respectively. For the first match, she will make the same bet as the other bettor with three points. If this person bets on the losing team and the other bets on the winning team all players have an equal score of three points. If for the next match the other two persons bet on different teams, Julia places the bet on her favourite, which of course may lose. Thus after two more matches she might lose the lead. The input consists of: Output the number of matches for which Julia is guaranteed to stay in the lead. ## Input The input consists of: One line with an integer $n$ ($3 <= n <= 10^5$), the number of people who place their bets. One line with $n$ integers $p_1, \\dots, p_n$ ($0 <= p_i <= 10^(16)$ for each $i$), the points of all people who play the betting game. The first of these numbers corresponds to the score of Julia. You may assume that no other score exceeds Julia's score in the beginning. ## Output Output the number of matches for which Julia is guaranteed to stay in the lead. [samples]

**Definitions** Let $ m \in \mathbb{Z} $, $ 1 \leq m \leq 8 $, and $ n \in \mathbb{Z} $, $ 1 \leq n \leq 10^{15} $, denote the dimensions of the chessboard. Let $ G = (V, E) $ be the graph where $ V = \{1, \dots, m\} \times \{1, \dots, n\} $, and $ E $ consists of knight moves between squares. **Constraints** 1. The knight must follow a closed walk (cycle) on $ G $, starting and ending at the same square. 2. The path formed by connecting consecutive visited squares with straight line segments must be a **simple polygon**: no two non-consecutive segments intersect or touch; only consecutive segments may share an endpoint. 3. The knight may not revisit any square. **Objective** Maximize the number of distinct squares visited in such a closed, non-crossing knight’s tour. If no such tour exists, output $ 0 $.

API Response (JSON)

{
  "problem": {
    "name": "J. Jinxed Betting",
    "description": {
      "content": "Julia is betting on a large sporting competition involving matches between pairs of teams. There are no parallel matches and each bettor receives one point for every correct bet they make. Julia had a",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 3000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF10248J"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Julia is betting on a large sporting competition involving matches between pairs of teams. There are no parallel matches and each bettor receives one point for every correct bet they make. Julia had a...",
      "is_translate": false,
      "language": "English"
    },
    {
      "statement_type": "Markdown",
      "content": "**Definitions**  \nLet $ m \\in \\mathbb{Z} $, $ 1 \\leq m \\leq 8 $, and $ n \\in \\mathbb{Z} $, $ 1 \\leq n \\leq 10^{15} $, denote the dimensions of the chessboard.  \nLet $ G = (V, E) $ be the graph where $...",
      "is_translate": false,
      "language": "Formal"
    }
  ]
}

Full JSON Raw Segments