2024.12.16 周一

合集 - 日常训练(56)

1.2025.2.19——150002-192.11.23 周六2024-11-243.11.24 周日2024-11-254.11.25 周一日常2024-11-265.2024.11.26 周二日常2024-11-266.2024.11.27 周三2024-11-277.2024.11.28周四2024-11-288.2024.11.29 周五2024-11-299.2024.11.30 周六2024-11-3010.2024.12.1 周日2024-12-0211.2024.12.2 周一2024-12-0212.2024.12.3 周二2024-12-0413.2024.12.4 周三2024-12-0514.2024.12.5 周四2024-12-0615.2024.12.7 周六2024-12-0816.2024.12.8 周日2024-12-0917.2024.12.9 周一2024-12-1018.2024.12.10 周二2024-12-1119.2024.12.11 周三2024-12-1220.2024.12.12 周四2024-12-1321.2024.12.13 周五2024-12-1422.2024.12.14 周六2024-12-15

23.2024.12.16 周一2024-12-17

24.2024.12.17 周二2024-12-1825.2024.12.18 周三2024-12-1926.2024.12.19 周四2024-12-2027.2024.12.20 周五2024-12-2128.2024.12.21 周六2024-12-2229.2024.12.22 周日2024-12-2330.2024.12.23 周一2024-12-2431.2024.12.24 周四2024-12-2532.2024.12.25 周三2024-12-2633.2024.12.26 周四2024-12-2834.2024.12.27 周五2024-12-2835.2024.12.28 周六2024-12-2936.2024.12.29 周日2024-12-3037.2024.12.30 周一01-0138.2025.1.5——120001-1439.2025.1.12——120001-1440.2025.1.14——120001-1541.2025.1.15——120001-1642.2025.1.16——120001-1743.2025.1.17——120001-1844.2025.1.18——130001-1945.2025.1.19——130001-2046.2025.1.20——130001-2147.2025.1.21——130001-2248.2025.1.22——130001-2449.2025.1.24——140001-2650.2025.1.26——140001-2851.2025.2.8——140002-0952.2025.2.9——140002-1153.2025.2.10——140002-1154.2025.2.14——140002-1455.2025.2.15——140002-1556.2025.2.17——140002-17

收起

2024.12.16 周一

---

Q1. 1000

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.

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.

Monocarp uses his ability until all monsters die. Your task is to determine the order in which monsters will die.

------------------------独自思考分割线------------------------

• 昨天数据结构考试+第二题被位运算加构造卡了，就润了，所以就一道题..

A1.

1. 在原有的基础上考虑加速加速操作。发现最终顺序和模 $k$ 之后大小有关。按照这种意义排序即可。

------------------------代码分割线------------------------

A1.

#include <bits/stdc++.h>
#define int long long //
#define endl '\n'     // 交互/调试 关
using namespace std;
#define bug(BUG) cout << "bug:# " << (BUG) << endl
#define bug2(BUG1, BUG2) cout << "bug:# " << (BUG1) << " " << (BUG2) << endl
#define bug3(BUG1, BUG2, BUG3) cout << "bug:# " << (BUG1) << ' ' << (BUG2) << ' ' << (BUG3) << endl
void _();
signed main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cout << fixed << setprecision(6);
    int T = 1;
    cin >> T;
    while (T--)
        _();
    return 0;
}

void _()
{
    int n, k;
    cin >> n >> k;
    struct Node
    {
        /* data */
        int x, i;
    };
    vector<Node> a(n);
    for (int i = 0; i < n; i++)
    {
        int t;
        cin >> t;
        // a[i].x = k - t % k;
        a[i].x = t % k;
        a[i].x = !a[i].x ? k : a[i].x;
        a[i].i = i;
        // bug2(i + 1, a[i].x);
    }
    sort(a.begin(), a.end(), [](Node &a, Node &b)
         { return a.x - b.x ? a.x > b.x : a.i < b.i; });
    for (auto [x, i] : a)
        cout
            << i + 1 << ' ';
    cout << endl;
}