CSES - Datatähti 2025 alku

Submission details
Task:	Tikut
Sender:	MikaelM
Submission time:	2026-06-10 21:50:00 +0300
Language:	C++ (C++17)
Status:	READY
Result:	27

Feedback
subtask	verdict	score
#1	ACCEPTED	7
#2	ACCEPTED	8
#3	ACCEPTED	12
#4	WRONG ANSWER	0
#5	WRONG ANSWER	0
#6	WRONG ANSWER	0

Test results
test	verdict	time	subtask
#1	ACCEPTED	0.00 s	1, 3, 4, 5, 6	details
#2	ACCEPTED	0.00 s	1, 4, 5, 6	details
#3	ACCEPTED	0.00 s	1, 4, 5, 6	details
#4	ACCEPTED	0.00 s	1, 4, 5, 6	details
#5	ACCEPTED	0.01 s	2, 5, 6	details
#6	ACCEPTED	0.01 s	2, 5, 6	details
#7	ACCEPTED	0.00 s	3, 5, 6	details
#8	ACCEPTED	0.00 s	3, 5, 6	details
#9	ACCEPTED	0.00 s	3, 5, 6	details
#10	ACCEPTED	0.00 s	3, 5, 6	details
#11	ACCEPTED	0.00 s	3, 5, 6	details
#12	ACCEPTED	0.00 s	4, 5, 6	details
#13	WRONG ANSWER	0.00 s	4, 5, 6	details
#14	WRONG ANSWER	0.00 s	4, 5, 6	details
#15	WRONG ANSWER	0.00 s	4, 5, 6	details
#16	ACCEPTED	0.01 s	5, 6	details
#17	WRONG ANSWER	0.01 s	5, 6	details
#18	WRONG ANSWER	0.01 s	5, 6	details
#19	WRONG ANSWER	0.01 s	5, 6	details
#20	WRONG ANSWER	0.19 s	6	details
#21	WRONG ANSWER	0.12 s	6	details
#22	WRONG ANSWER	0.19 s	6	details

Code

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

static inline ll ceil_div(ll a, ll b) {
    return (a + b - 1) / b;
}

/* ---------------------------------------------------------
   R_p = minimum possible maximum piece length with p pieces
   --------------------------------------------------------- */

struct MaxNode {
    ll cur;   // ceil(a / t)
    ll nxt;   // ceil(a / (t+1))
    int id;

    bool operator<(const MaxNode& o) const {
        if (cur != o.cur) return cur < o.cur;   // larger cur first
        return nxt > o.nxt;                     // smaller nxt first
    }
};

/* ---------------------------------------------------------
   M_p = maximum possible minimum piece length with p pieces
   --------------------------------------------------------- */

struct NextNode {
    ll nxt; // floor(a / (t+1))
    int id;

    bool operator<(const NextNode& o) const {
        if (nxt != o.nxt) return nxt < o.nxt;   // larger nxt first
        return id > o.id;
    }
};

struct MinNode {
    ll cur; // floor(a / t)
    int id;
    int ver;

    bool operator>(const MinNode& o) const {
        if (cur != o.cur) return cur > o.cur;
        return id > o.id;
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m;
    cin >> n >> m;

    vector<ll> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];

    int P = n + m;

    /* -------------------- R_p -------------------- */

    vector<ll> R(P + 1);

    vector<ll> tR(n, 1);
    priority_queue<MaxNode> pqR;

    ll mx = 0;
    for (int i = 0; i < n; i++) {
        pqR.push({
            a[i],
            ceil_div(a[i], 2),
            i
        });
        mx = max(mx, a[i]);
    }

    R[n] = mx;

    for (int p = n + 1; p <= P; p++) {
        auto x = pqR.top();
        pqR.pop();

        int id = x.id;

        ++tR[id];

        ll cur = ceil_div(a[id], tR[id]);
        ll nxt = ceil_div(a[id], tR[id] + 1);

        pqR.push({cur, nxt, id});

        R[p] = pqR.top().cur;
    }

    /* -------------------- M_p -------------------- */

    vector<ll> M(P + 1);

    vector<ll> tM(n, 1);
    vector<int> ver(n, 0);

    priority_queue<NextNode> pqNext;
    priority_queue<MinNode,
                   vector<MinNode>,
                   greater<MinNode>> pqMin;

    for (int i = 0; i < n; i++) {
        pqMin.push({a[i], i, 0});
        pqNext.push({a[i] / 2, i});
    }

    auto current_min = [&]() -> ll {
        while (true) {
            auto x = pqMin.top();
            if (x.ver == ver[x.id]) return x.cur;
            pqMin.pop();
        }
    };

    M[n] = current_min();

    for (int p = n + 1; p <= P; p++) {
        auto x = pqNext.top();
        pqNext.pop();

        int id = x.id;

        ++tM[id];
        ++ver[id];

        ll cur = a[id] / tM[id];
        ll nxt = a[id] / (tM[id] + 1);

        pqMin.push({cur, id, ver[id]});
        pqNext.push({nxt, id});

        M[p] = current_min();
    }

    /* -------------------- answers -------------------- */

    for (int k = 1; k <= m; k++) {
        int p = n + k;
        ll ans = max(0LL, R[p] - M[p]);

        if (k > 1) cout << ' ';
        cout << ans;
    }
    cout << '\n';

    return 0;
}

Test details

Test 1

Subtask: 1, 3, 4, 5, 6

Verdict: ACCEPTED

input
`1 1 6` view save

correct output
`0` view save

user output
`0` view save

Test 2

Subtask: 1, 4, 5, 6

Verdict: ACCEPTED

input
`5 10 4 8 6 2 7` view save

correct output
`5 4 2 2 2 1 1 1 1 1` view save

user output
`5 4 2 2 2 1 1 1 1 1` view save

Test 3

Subtask: 1, 4, 5, 6

Verdict: ACCEPTED

input
`5 10 5 5 8 6 7` view save

correct output
`3 3 2 3 2 2 1 1 1 2` view save

user output
`3 3 2 3 2 2 1 1 1 2` view save

Test 4

Subtask: 1, 4, 5, 6

Verdict: ACCEPTED

input
`5 10 8 7 9 6 10` view save

correct output
`4 4 3 3 2 2 1 2 2 1` view save

user output
`4 4 3 3 2 2 1 2 2 1` view save

Test 5

Subtask: 2, 5, 6

Verdict: ACCEPTED

input
`1000 1071 3 2 3 1 3 3 2 3 2 3 2 2 2 1 2 ...` view save

correct output
`2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...` view save

user output
`2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...` view save

Test 6

Subtask: 2, 5, 6

Verdict: ACCEPTED

input
`1000 1500 3 2 2 3 2 3 2 2 2 3 2 2 3 3 3 ...` view save

correct output
`2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...` view save

user output
`2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...` view save

Test 7

Subtask: 3, 5, 6

Verdict: ACCEPTED

input
`1000 2 15 710 210 347 398 66 318 277 ...` view save

correct output
`994 994` view save

user output
`994 994` view save

Test 8

Subtask: 3, 5, 6

Verdict: ACCEPTED

input
`1000 2 743 890 592 942 736 969 616 50...` view save

correct output
`498 496` view save

user output
`498 496` view save

Test 9

Subtask: 3, 5, 6

Verdict: ACCEPTED

input
`1000 2 987 968 920 994 988 918 914 95...` view save

correct output
`500 500` view save

user output
`500 500` view save

Test 10

Subtask: 3, 5, 6

Verdict: ACCEPTED

input
`1000 2 996 1000 998 998 999 997 997 9...` view save

correct output
`500 500` view save

user output
`500 500` view save

Test 11

Subtask: 3, 5, 6

Verdict: ACCEPTED

input
`1000 2 501 501 501 501 501 501 501 50...` view save

correct output
`1 168` view save

user output
`1 168` view save

Test 12

Subtask: 4, 5, 6

Verdict: ACCEPTED

input
`100 200 145 136 74 83 73 36 196 115 11...` view save

correct output
`194 190 189 183 182 181 181 17...` view save

user output
`194 190 189 183 182 181 181 17...` view save

Test 13

Subtask: 4, 5, 6

Verdict: WRONG ANSWER

input
`100 200 157 110 168 155 192 107 146 15...` view save

correct output
`95 96 96 95 93 94 94 94 90 91 ...` view save

user output
`95 96 96 95 93 94 94 94 90 91 ...` view save

Feedback: Incorrect character on line 1 col 209: expected "63", got "62"

Test 14

Subtask: 4, 5, 6

Verdict: WRONG ANSWER

input
`50 200 137 118 160 118 146 160 140 18...` view save

correct output
`98 98 98 96 90 91 88 88 84 86 ...` view save

user output
`98 98 98 96 90 91 88 88 84 86 ...` view save

Feedback: Incorrect character on line 1 col 89: expected "64", got "63"

Test 15

Subtask: 4, 5, 6

Verdict: WRONG ANSWER

input
`100 200 147 174 186 148 155 128 158 18...` view save

correct output
`99 99 98 98 97 97 96 96 95 95 ...` view save

user output
`99 99 98 98 97 97 96 96 95 95 ...` view save

Feedback: Incorrect character on line 1 col 209: expected "65", got "64"

Test 16

Subtask: 5, 6

Verdict: ACCEPTED

input
`1000 2000 928772177 816188227 216592201 ...` view save

correct output
`991676844 990940224 990685481 ...` view save

user output
`991676844 990940224 990685481 ...` view save

Test 17

Subtask: 5, 6

Verdict: WRONG ANSWER

input
`1000 2000 665759876 597950008 615453266 ...` view save

correct output
`498801198 498681904 498504321 ...` view save

user output
`498801198 498681904 498504321 ...` view save

Feedback: Incorrect character on line 1 col 6426: expected "332398111", got "332393390"

Test 18

Subtask: 5, 6

Verdict: WRONG ANSWER

input
`500 2000 683288817 784230412 626685186 ...` view save

correct output
`497667621 498434895 495465990 ...` view save

user output
`497667621 498434895 495465990 ...` view save

Feedback: Incorrect character on line 1 col 3633: expected "331344123", got "330438103"

Test 19

Subtask: 5, 6

Verdict: WRONG ANSWER

input
`1000 2000 666667000 809309500 571572000 ...` view save

correct output
`499499500 499249250 498999000 ...` view save

user output
`499499500 499249250 498999000 ...` view save

Feedback: Incorrect character on line 1 col 6674: expected "332582750", got "332332667"

Test 20

Subtask: 6

Verdict: WRONG ANSWER

input
`100000 200000 861772559 734298084 983382252 ...` view save

correct output
`499973914 499985299 499985141 ...` view save

user output
`499973914 499985299 499985141 ...` view save

Feedback: Incorrect character on line 1 col 666635: expected "333320394", got "333315196"

Test 21

Subtask: 6

Verdict: WRONG ANSWER

input
`30000 200000 691834579 617419813 514778075 ...` view save

correct output
`499967533 499976270 499969810 ...` view save

user output
`499967533 499976270 499969810 ...` view save

Feedback: Incorrect character on line 1 col 200686: expected "333319371", got "333318998"

Test 22

Subtask: 6

Verdict: WRONG ANSWER

input
`100000 200000 820255000 960780000 741965000 ...` view save

correct output
`499995000 499992500 499990000 ...` view save

user output
`499995000 499992500 499990000 ...` view save

Feedback: Incorrect character on line 1 col 666676: expected "333327500", got "333326667"

Datatähti 2025 alku

Tikut

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Tasks

Submissions (MikaelM)