CSES - Datatähti 2025 alku

Submission details
Task:	Tikut
Sender:	aatukaj
Submission time:	2024-11-01 14:15:13 +0200
Language:	C++ (C++20)
Status:	READY
Result:	51

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

Test results
test	verdict	time	group
#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.31 s	2, 5, 6	details
#6	ACCEPTED	0.43 s	2, 5, 6	details
#7	ACCEPTED	0.01 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.01 s	4, 5, 6	details
#13	ACCEPTED	0.01 s	4, 5, 6	details
#14	ACCEPTED	0.01 s	4, 5, 6	details
#15	ACCEPTED	0.01 s	4, 5, 6	details
#16	ACCEPTED	0.77 s	5, 6	details
#17	WRONG ANSWER	0.69 s	5, 6	details
#18	ACCEPTED	0.32 s	5, 6	details
#19	ACCEPTED	0.69 s	5, 6	details
#20	RUNTIME ERROR	0.99 s	6	details
#21	RUNTIME ERROR	0.99 s	6	details
#22	RUNTIME ERROR	0.98 s	6	details

Code

// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <algorithm>
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<class T> using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

using ll = long long;
using ull = unsigned long long;
using ld = long double;

using pii = pair<int, int>;
using pll = pair<ll, ll>;

// const ll M = 998244353;
const ll M = 1e9 + 7;
// ll M;


#define all(v) (v).begin(), (v).end()
#define ff first
#define ss second
#define PI 3.141592653589793238462643383279502884L

const ll INFL = 1e18;
const int INF = 1e9;
const ll maxN = 5e5+1;


bool comp(array<int, 3> l, array<int, 3> r) {
    if (l[0]==r[0]) {
        return l[2]<r[2];
    } return l[0]>r[0];

}

void solve() {
    int n = 5, m =100;
    cin >> n >> m;
    vector<int> a(n);
    for (auto &u: a) cin >> u;
    // for (auto &u: a) u = random(1, 1000);
    vector<array<int, 3>> maxs, mins;
    for (int i=0; i<n; i++) {
        for (int j=1; j<=m+1; j++) {
            maxs.push_back({(a[i]+j-1)/j, i, j});
            if (j!=1) mins.push_back({a[i]/j, i, j});
        }
    }
    sort(all(maxs), comp);
    sort(all(mins), comp);
    // maxs.resize(m+1);
    // mins.resize(m+1);
    multiset<int> difs;
    set<array<int, 3>> under;
    int mx = *max_element(all(a));
    int mn = *min_element(all(a));
    int nxt_mn = mn;
    for (int k=0; k<m; k++) {
        int idx = maxs[k][1];
        mn = min(mins[k][0], mn);
        nxt_mn = min(nxt_mn, a[idx]/(maxs[k][2]+1));
        nxt_mn = min(nxt_mn, mn);
        int nxt_mx = maxs[k+1][0];
        under.insert({nxt_mn, nxt_mx, k});
        difs.insert({nxt_mx-nxt_mn});

        while (under.size() && (*under.begin())[0]>=mn) {
            auto [x, y, _] = *under.begin();
            difs.erase(difs.find(y-x));
            under.erase(under.begin());
            mx = min(mx, y);
        }
        int ans = (mx-mn);
        if (difs.size()) ans = min(ans, *difs.begin());
        cout << ans << ' ';
    }
}
int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    cout << setprecision(12);


    int tc = 1;
    // cin >>tc;
    while (tc--) solve();

}

Test details

Test 1

Group: 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

Group: 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

Group: 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

Group: 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

Group: 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

Group: 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

Group: 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

Group: 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

Group: 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

Group: 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

Group: 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

Group: 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

Group: 4, 5, 6

Verdict: ACCEPTED

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

Test 14

Group: 4, 5, 6

Verdict: ACCEPTED

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

Test 15

Group: 4, 5, 6

Verdict: ACCEPTED

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

Test 16

Group: 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

Group: 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

Test 18

Group: 5, 6

Verdict: ACCEPTED

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

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

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

Test 19

Group: 5, 6

Verdict: ACCEPTED

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

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

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

Test 20

Group: 6

Verdict: RUNTIME ERROR

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

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

user output
(empty)

Test 21

Group: 6

Verdict: RUNTIME ERROR

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

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

user output
(empty)

Test 22

Group: 6

Verdict: RUNTIME ERROR

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

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

user output
(empty)

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 (aatukaj)