CSES - Datatähti 2025 alku

CSES - Datatähti 2025 alku - Results

Submission details
Task:	Tikut
Sender:	Pikaksi
Submission time:	2024-11-05 10:27:05 +0200
Language:	C++ (C++20)
Status:	READY
Result:	12

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#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	WRONG ANSWER	0.00 s	1, 4, 5, 6	details
#3	WRONG ANSWER	0.00 s	1, 4, 5, 6	details
#4	WRONG ANSWER	0.00 s	1, 4, 5, 6	details
#5	WRONG ANSWER	0.00 s	2, 5, 6	details
#6	WRONG ANSWER	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.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	WRONG ANSWER	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	WRONG ANSWER	0.00 s	5, 6	details
#17	WRONG ANSWER	0.00 s	5, 6	details
#18	WRONG ANSWER	0.00 s	5, 6	details
#19	WRONG ANSWER	0.00 s	5, 6	details
#20	WRONG ANSWER	0.06 s	6	details
#21	WRONG ANSWER	0.02 s	6	details
#22	WRONG ANSWER	0.06 s	6	details

Code

#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
 
struct Frac
{
    int number;
    int divisor;
    int resultBigger;
 
    Frac(int _number, int _divisor)
    {
        number = _number;
        divisor = _divisor;
        
        resultBigger = _number / _divisor;
        if (_number % _divisor != 0) {
            resultBigger += 1;
        }
    }
 
    bool operator<(Frac frac) const
    {
        if (resultBigger == frac.resultBigger) {
            //cout << "first = " << (number / (divisor + 1)) << "\n";
            //cout << "second = " << (frac.number / (frac.divisor + 1)) << "\n";
 
            return (number / (divisor + 1)) < (frac.number / (frac.divisor + 1));
        }
        return resultBigger < frac.resultBigger;
    }
};
 
multiset<Frac> numbersSorted;
int minNumber = INT_MAX;
 
void printSet()
{
    cout << "printing set:\n";
    for (Frac frac : numbersSorted) {
        cout << frac.number << " " << frac.divisor << " " << frac.resultBigger << "\n";
    }
}
 
int getWorkingDifference()
{
    Frac fracBig = *numbersSorted.rbegin();
    int biggestNumber = fracBig.number / fracBig.divisor;
    if (fracBig.number % fracBig.divisor != 0) {
        biggestNumber += 1;
    }
    return biggestNumber - minNumber;
}
 
void shuffle(int& n, int& m, vector<int>& testNumbers)
{
    minNumber = INT_MAX;
    n = (rand() % 1000) + 1;
    
    int sum = 0;
    numbersSorted.clear();
    testNumbers.clear();
    for (int i = 0; i < n; i++) {
        int random = (rand() % 10) + 1;
        testNumbers.push_back(random);
        sum += random;
    }
    sum -= n;
    m = min((rand() % 2) + 1, sum);
}

int getMax(int number, int div)
{
    int ans = number / div;
    if (number % div != 0) {
        ans += 1;
    }
    return ans;
}

int getMin(int number, int div)
{
    int ans = number / div;
    return ans;
}

void bruteForce(vector<int> sticks, int m, int& ans1, int& ans2)
{
    if (sticks.size() == 1) {
        if (m >= 1) {
            int difference = getMax(sticks[0], 2) - getMin(sticks[0], 2);
            ans1 = difference;
        }
        if (m == 2) {
            int difference = getMax(sticks[0], 3) - getMin(sticks[0], 3);
            ans2 = difference;
        }
        return;
    }
    sort(sticks.begin(), sticks.end(), greater<>());

    if (m >= 1) {
        int difference = max(getMax(sticks[0], 2), sticks[1]) - min(getMin(sticks[0], 2), sticks.back());
        ans1 = difference;
    }
    if (m == 2) {
        int maxLenDiv2 = max(getMax(sticks[0], 2), getMax(sticks[1], 2));
        if (sticks.size() >= 3) {
            maxLenDiv2 = max(maxLenDiv2, sticks[2]);
        }
        int minLenDiv2 = min(getMin(sticks[0], 2), getMin(sticks[1], 2));
        if (sticks.size() >= 3) {
            minLenDiv2 = min(minLenDiv2, sticks.back());
        }
        int div2Difference = maxLenDiv2 - minLenDiv2;
        
        int maxLenDiv3 = max(getMax(sticks[0], 3), sticks[1]);
        int minLenDiv3 = min(getMin(sticks[0], 3), sticks.back());
        int div3Difference = maxLenDiv3 - minLenDiv3;
        int ans = min(div2Difference, div3Difference);
        ans2 = ans;
    }
}

void runBruteForce()
{
    int n, m;
    cin >> n >> m;
    vector<int> sticks;
    
    for (int i = 0; i < n; i++) {
        int number;
        cin >> number;
        sticks.push_back(number);
    }
    int ans1, ans2;
    bruteForce(sticks, m, ans1, ans2);
    cout << ans1;
    if (m == 2) {
        cout << " " << ans2;
    }
}
 
int main()
{
    runBruteForce();
    return 0;
    /*Frac frac1(14, 7);
    Frac frac2(13, 9);
    cout << (frac1 < frac2) << " " << (frac2 < frac1);
    return 0;*/
    /*cout << "start";
    for (int x = 0; x < 100; x++) {
        for (int y = 0; y < 100; y++) {
            for (int xd = 1; xd < 100; xd++) {
                for (int yd = 1; yd < 100; yd++) {
                    if (x == y) {
                        continue;
                    }
                    Frac fracX(x, xd);
                    Frac fracY(y, yd);
                    if ((fracX < fracY) == (fracY < fracX)) {
                        //cout << "yes = " << x << " " << y << " " << xd << " " << yd << "\n";
 
                        Frac fracX1(x, xd + 1);
                        Frac fracY1(y, yd + 1);
 
                        int minX = fracX.number / fracX.divisor;
                        int minY = fracY.number / fracY.divisor;
                        int minX1 = fracX1.number / fracX1.divisor;
                        int minY1 = fracY1.number / fracY1.divisor;
 
                        int maxX = minX;
                        if (fracX.number % fracX.divisor != 0) {
                            maxX += 1;
                        }
                        int maxY = minY;
                        if (fracY.number % fracY.divisor != 0) {
                            maxY += 1;
                        }
                        int maxX1 = minX1;
                        if (fracX1.number % fracX1.divisor != 0) {
                            maxX1 += 1;
                        }
                        int maxY1 = minY1;
                        if (fracY1.number % fracY1.divisor != 0) {
                            maxY1 += 1;
                        }
 
                        if (!(min(minX, minY1) == min(minY, minX1))) {
                            cout << "WHAT\n";
                            cout << x << " " << y << " " << xd << " " << yd << "\n";
                            cout << minX << " " << minY << " " << minX1 << " " << minY1 << "\n";
                        }
                    }
                }
            }
        }
    }
    cout << "end";
    return 0;*/
    int n, m;
    //cin >> n >> m;
    //n = 3; m = 9; vector<int> testNumbers = {3, 4, 5};
    //n = 2; m = 6; vector<int> testNumbers = {2, 6};
    //m = 9; vector<int> testNumbers = {1000, 999, 999, 500, 500, 100}; n = testNumbers.size();
    //m = 10; vector<int> testNumbers = {3, 5, 5, 9, 9}; n = testNumbers.size();
    //m = 10; vector<int> testNumbers = {10, 11}; n = testNumbers.size();
    m = 2; vector<int> testNumbers = {3}; n = testNumbers.size();
 
    for (int test = 0; test < 100; test++) {
        shuffle(n, m, testNumbers);
 
        //vector<int> resultsWorking;
        //runWorkingProgram(n, m, testNumbers, resultsWorking);
        int ans1 = -1, ans2 = -1;
        bruteForce(testNumbers, m, ans1, ans2);
        cout << "ans = " << ans1 << " ";
        if (m == 2) {
            cout << ans2 << " ";
        }
 
        for (int i = 0; i < n; i++) {
            int number;
            //cin >> number;
            number = testNumbers[i];
            minNumber = min(minNumber, number);
            numbersSorted.emplace(number, 1);
        }
        //cout << "min number = " << minNumber << "\n";
 
        //if (test == 1)
            //printSet();
        for (int k = 0; k < m; k++) {
            //cout << "k=" << k << "\n";
            //if (test == 1)
                //printSet();
 
            Frac frac = *numbersSorted.rbegin();
            Frac newFrac = Frac(frac.number, frac.divisor + 1);
            
            numbersSorted.erase(--numbersSorted.end());
            //cout << "size = " << numbersSorted.size() << "\n";
            numbersSorted.insert(newFrac);
            minNumber = min(minNumber, newFrac.number / newFrac.divisor);
            //cout << "size = " << numbersSorted.size() << "\n";
 
            int ans = getWorkingDifference();
            cout << ans << " ";
            if (k == 0) {
                if (ans != ans1) {
                    cout << "WHAT\n";
                }
            }
            if (k == 1) {
                if (ans != ans2) {
                    cout << "WHAT2\n";
                }
            }
            /*cout << ans;
            if (k != m - 1) {
                cout << " ";
            }*/
        }
        cout << "\n";
        //cout << "end";
        //if (test == 1)
            //printSet();
 
    }
}

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

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` view save

Test 3

Group: 1, 4, 5, 6

Verdict: WRONG ANSWER

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` view save

Test 4

Group: 1, 4, 5, 6

Verdict: WRONG ANSWER

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` view save

Test 5

Group: 2, 5, 6

Verdict: WRONG ANSWER

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` view save

Test 6

Group: 2, 5, 6

Verdict: WRONG ANSWER

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

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` 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` 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` 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` view save

Test 16

Group: 5, 6

Verdict: WRONG ANSWER

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

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

user output
`991676844` 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` 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` 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` 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` 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` 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` 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 (Pikaksi)