codeforces-scrape

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

1849B.md (2280B)


      1 Source: https://codeforces.com/problemset/problem/1849/B
      2 
      3 B. Monsters
      4 
      5 time limit per test
      6 
      7 2 seconds
      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 Monocarp is playing yet another computer game. And yet again, his character is killing some monsters. There are $n$ monsters, numbered from $1$ to $n$, and the $i$-th of them has $a_i$ health points initially.
     22 
     23 Monocarp's character has an ability that deals $k$ damage to the monster with the highest current health. If there are several of them, the one with the smaller index is chosen. If a monster's health becomes less than or equal to $0$ after Monocarp uses his ability, then it dies.
     24 
     25 Monocarp uses his ability until all monsters die. Your task is to determine the order in which monsters will die.
     26 
     27 Input
     28 
     29 The first line contains a single integer $t$ ($1 \le t \le 10^4$) — the number of test cases.
     30 
     31 The first line of each test case contains two integers $n$ and $k$ ($1 \le n \le 3 \cdot 10^5$; $1 \le k \le 10^9$) — the number of monsters and the damage which Monocarp's ability deals.
     32 
     33 The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 10^9$) — the initial health points of monsters.
     34 
     35 The sum of $n$ over all test cases doesn't exceed $3 \cdot 10^5$.
     36 
     37 Output
     38 
     39 For each test case, print $n$ integers — the indices of monsters in the order they die.
     40 
     41 Example
     42 
     43 Input
     44 
     45 ```
     46 3
     47 
     48 3 2
     49 
     50 1 2 3
     51 
     52 2 3
     53 
     54 1 1
     55 
     56 4 3
     57 
     58 2 8 3 5
     59 ```
     60 
     61 Output
     62 
     63 ```
     64 2 1 3 
     65 1 2 
     66 3 1 2 4
     67 ```
     68 
     69 Note
     70 
     71 In the first example, the health points change as follows: $[1, 2, \underline{3}] \rightarrow [1, \underline{2}, 1] \rightarrow [\underline{1}, 0, 1] \rightarrow [-1, 0, \underline{1}] \rightarrow [-1, 0, -1]$. The monster that is going to take damage the next time Monocarp uses his ability is underlined.
     72 
     73 In the second example, the health points change as follows: $[\underline{1}, 1] \rightarrow [-2, \underline{1}] \rightarrow [-2, -2]$.
     74 
     75 In the third example, the health points change as follows: $[2, \underline{8}, 3, 5] \rightarrow [2, \underline{5}, 3, 5] \rightarrow [2, 2, 3, \underline{5}] \rightarrow [2, 2, \underline{3}, 2] \rightarrow [\underline{2}, 2, 0, 2] \rightarrow [-1, \underline{2}, 0, 2] \rightarrow [-1, -1, 0, \underline{2}] \rightarrow [-1, -1, 0, -1]$.