CSES - Datatähti 2025 alku

Submission details
Task:	Tikut
Sender:	Vludo
Submission time:	2024-11-10 21:17:27 +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	RUNTIME ERROR	0
#6	RUNTIME ERROR	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.00 s	2, 5, 6	details
#6	ACCEPTED	0.00 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.01 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	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	RUNTIME ERROR	0.00 s	5, 6	details
#17	RUNTIME ERROR	0.00 s	5, 6	details
#18	RUNTIME ERROR	0.00 s	5, 6	details
#19	RUNTIME ERROR	0.00 s	5, 6	details
#20	RUNTIME ERROR	0.03 s	6	details
#21	RUNTIME ERROR	0.01 s	6	details
#22	RUNTIME ERROR	0.03 s	6	details

Code

#include<bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<n;++i)
#define forN(i,k,n) for(int i=k;i<n;++i)
#define pb push_back
#define F first
#define S second
#define all(x) (x.begin()),(x.end())
#define rall(x) (x.rbegin()),(x.rend())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define inf ((int)(1.01e9))
#define N ((int)(1e5+5))
 
int n, m, k, a[N], minimi=inf, maksimi=0, r, result[N], K[N];

void rf(int i, int R, int mn, int mx, int cuts) {
    //if (k==3) cout<<i<<' '<<R<<' '<<mn<<' '<<mx<<' '<<cuts<<endl;
    if (i<0) {
        result[k-cuts] = min(result[k-cuts], mx-mn);
        return;
    }
 
    result[k-cuts] = min(result[k-cuts], max(mx, a[i])-mn);
 
    int L = 2;
    if (i) L = a[i] / a[i-1];
    R = min(R, a[i]);
 
    for (int j = 2; j <= R && j-1 <= cuts; j++) {
        int t1 = a[i] / j; 
        int t2 = a[i] / j + (a[i]%j>0);
        if (i) result[k-(cuts-j+1)] = min(result[k-(cuts-j+1)], max(a[i-1],max(mx,t2))-min(mn,t1));
        if (j >= L) rf(i-1, j, min(mn, t1), max(mx, t2), cuts-j+1);
    }
}

int osa3() {
     
    forn(i,n) {
        cin>>a[i];
        minimi = min(minimi, a[i]);
    }
    fill(result, result+m+1, inf);
 
    sort(a, a+n);
 
    k = m;
    r = inf;
    rf(n-1, a[n-1], minimi, 0, k);
 
    forN(i,1,m+1) cout << result[i] << ' ';
    
    return 0;
}

int main() {
    cin.tie(0) -> sync_with_stdio(0);
    cout.tie(0);

    cin >> n >> m;

    if (m<=2) return osa3(); 
    forn(i,n) {
        cin>>a[i];
        minimi = min(minimi, a[i]);
        maksimi = max(maksimi, a[i]);
    }
    sort(a, a+n);

    fill(K, K+N, inf);

    for (int L=1; L<=minimi; L++) {
        for (int R=L; R<=maksimi; R++) {
            bool np=false;
            int Kmin=0, Kmax=0;
            forn(i,n) {
                int kmin = a[i] / R + (a[i]%R>0) - 1;
                int kmax = a[i] / L - 1;
                if (kmin > kmax) {
                    np = true;
                    break;
                }
                Kmin += kmin;
                Kmax += kmax;
            }
            if (!np) for (int i=Kmin; i<=min(Kmax, m); i++) 
                K[i] = min(K[i], R-L);
            
        }
    }

    forN(i,1,m+1) cout << K[i] << ' ';
}

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: RUNTIME ERROR

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

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

user output
(empty)

Test 17

Group: 5, 6

Verdict: RUNTIME ERROR

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

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

user output
(empty)

Test 18

Group: 5, 6

Verdict: RUNTIME ERROR

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

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

user output
(empty)

Test 19

Group: 5, 6

Verdict: RUNTIME ERROR

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

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

user output
(empty)

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