CSES - Datatähti 2025 alku

CSES - Datatähti 2025 alku - Results

Submission details
Task:	Tikut
Sender:	vgtcross
Submission time:	2024-10-28 02:59:43 +0200
Language:	C++ (C++20)
Status:	READY
Result:	27

Feedback
group	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	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.01 s	3, 5, 6	details
#8	ACCEPTED	0.01 s	3, 5, 6	details
#9	ACCEPTED	0.01 s	3, 5, 6	details
#10	ACCEPTED	0.01 s	3, 5, 6	details
#11	ACCEPTED	0.01 s	3, 5, 6	details
#12	ACCEPTED	0.00 s	4, 5, 6	details
#13	WRONG ANSWER	0.01 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.00 s	5, 6	details
#17	WRONG ANSWER	0.01 s	5, 6	details
#18	WRONG ANSWER	0.00 s	5, 6	details
#19	WRONG ANSWER	0.01 s	5, 6	details
#20	WRONG ANSWER	0.18 s	6	details
#21	WRONG ANSWER	0.12 s	6	details
#22	WRONG ANSWER	0.16 s	6	details

Code

#include <bits/stdc++.h>
 
#define MODE 0
 
#if MODE
#define debug(x) cout << #x << ": " << (x) << endl
#define log(x) cout << (x) << endl
#define test(x) x
#else
#define debug(x)
#define log(x)
#define test(x)
#endif
 
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fi first
#define se second
#define X real()
#define Y imag()
 
using namespace std;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using P = complex<ll>;
 
template<typename S, typename T = S> void chmin(S &s, T t) {s = s < t ? s : t;}
template<typename S, typename T = S> void chmax(S &s, T t) {s = s > t ? s : t;}
 
const ll M = 1000000007; // 998244353
 
void solve2(int n, int m);
 
void solve() {
    int n, m;
    cin >> n >> m;
    
    if (m <= 2) {
        solve2(n, m);
        return;
    }
    
    priority_queue<array<int, 5>> pq, pq2;
    int minl = 1e9;
    vector<int> cur(n);
    for (int i = 0; i < n; ++i) {
        int a;
        cin >> a;
        chmin(minl, a);
        cur[i] = 2;
        pq.push({a, a/2, a, 2, i});
        pq2.push({a/2, a, a, 2, i});
    }
    
    for (int i = 0; i < m; ++i) {
        auto a = pq.top();
        pq.pop();
        
        log("");
        debug(a[0]);
        debug(a[1]);
        debug(a[2]);
        debug(a[3]);
        debug(a[4]);
        
        if (a[0] - minl < (pq.size() ? max(pq.top()[0], (a[2] - 1) / a[3] + 1) : (a[2] - 1) / a[3] + 1) - min(minl, a[2] / a[3])) {
            debug("here");
            while (pq2.size() && pq2.top()[0] >= minl) {
                if (pq2.top()[3] != cur[pq2.top()[4]]) pq2.pop();
                else {
                    pq.push(a);
                    a = pq2.top();
                    pq2.pop();
                    swap(a[0], a[1]);
                    break;
                }
            }
        }
        
        log("");
        debug(a[0]);
        debug(a[1]);
        debug(a[2]);
        debug(a[3]);
        debug(a[4]);
        
        chmin(minl, a[2] / a[3]);
        
        cur[a[4]] = a[3] + 1;
        pq.push({(a[2] - 1) / a[3] + 1, a[2] / (a[3] + 1), a[2], a[3] + 1, a[4]});
        pq2.push({a[2] / (a[3] + 1), (a[2] - 1) / a[3] + 1, a[2], a[3] + 1, a[4]});
        log("");
        debug((a[2] - 1) / a[3] + 1);
        debug(a[2] / (a[3] + 1));
        debug(a[2]);
        debug(a[3] + 1);
        debug(a[4]);
        
        while (pq.size() && pq.top()[3] != cur[pq.top()[4]]) pq.pop();
        cout << pq.top()[0] - minl << " \n"[i == m-1];
    }
}
 
void solve2(int n, int m) {
    vector<int> a(n);
    for (int &i : a) cin >> i;
    
    sort(all(a));
    
    int ans = 2e9;
    for (int i = 0; i < n; ++i) if (a[i] >= 2) {
        int minl = 2e9, maxl = 0;
        if (n >= 2) {
            minl = i == 0 ? a[1] : a[0];
            maxl = i == n-1 ? a[n-2] : a[n-1];
        }
        chmin(minl, a[i]/2);
        chmax(maxl, (a[i]-1)/2+1);
        chmin(ans, maxl - minl);
    }
    
    cout << ans << ' ';
    ans = 2e9;
    
    if (m == 2) {
        for (int i = 0; i < n; ++i) if (a[i] >= 2) {
            if (a[i] >= 3) {
                int minl = 2e9, maxl = 0;
                if (n >= 2) {
                    minl = i == 0 ? a[1] : a[0];
                    maxl = i == n-1 ? a[n-2] : a[n-1];
                }
                chmin(minl, a[i]/3);
                chmax(maxl, (a[i]-1)/3+1);
                chmin(ans, maxl - minl);
            }
            for (int j = i+1; j < n; ++j) if (a[j] >= 2) {
                int minl = 2e9, maxl = 0;
                if (n >= 3) {
                    if (i == 0 && j == 1) minl = a[2];
                    else if (i == 0) minl = a[1];
                    else minl = a[0];
                    if (i == n-2 && j == n-1) maxl = a[n-3];
                    else if (j == n-1) maxl = a[n-2];
                    else maxl = a[n-1];
                }
                chmin(minl, a[i]/2);
                chmax(maxl, (a[i]-1)/2+1);
                chmin(minl, a[j]/2);
                chmax(maxl, (a[j]-1)/2+1);
                chmin(ans, maxl - minl);
            }
        }
        cout << ans << ' ';
    }
    cout << '\n';
}
 
int main() {
    cin.tie(0) -> sync_with_stdio(0);
    
    int t = 1;
    if (t == 0) cin >> t;
    while (t--) solve();
    
    return 0;
}

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

Test 14

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

Test 15

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

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: WRONG ANSWER

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: WRONG ANSWER

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: WRONG ANSWER

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

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

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

Test 21

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

Test 22

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

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