CSES - Putka Open 2015 – 3/6 - Results
Submission details
Task:Kasat
Sender:
Submission time:2015-09-13 19:48:54 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1--1details
#2--2details
#3--3details

Code

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>

#define ll long long

using namespace std;


int main() {
    cin.sync_with_stdio(false);
    ll t, a, b, c, n;
    cin >> t;
    for (ll i = 0; i < t; ++i) {
        vector<ll> m;
        cin >> a >> b >> c >> n;
        m.push_back(a);
        m.push_back(b);
        m.push_back(c);
        sort(m.begin(), m.end());
        while (n != 0) {
            ll dif = m[2] - m[0];
            if (dif == 0) {
                if (n % 2 == 0) {
                    m[0]--;
                    m[2]++;
                    n = 0;
                }
            } else if (dif != 1) {
                ll difa = m[1] - m[0];
                ll difb = m[2] - m[1];
                if (difa < difb) {
                    if (difa == 0) {
                        if (difb/2 + difb % 2 > n) {
                            difb = 2*n - 1;
                        }
                        if (difb == 2) {
                            m[1] += difb/2;
                            m[2] -= difb/2 + difb % 2;
                            n -= 1;
                        } else {
                            m[0] += difb/2;
                            m[1] += difb/2;
                            m[1] += (difb/2 + difb%2) % 2;
                            m[2] -= difb/2 + difb%2;
                            n -= difb/2 + difb%2;
                        }
                    } else {
                        difa = min(n,difa);
                        m[0]+= difa;
                        m[2]-= difa;
                        n -= difa;
                    }
                } else {
                    if (difb == 0) {
                        if (difa/2 + difa % 2 > n) {
                            difa = 2*n - 1;
                        }
                        if (difa == 2) {
                            m[1] -= difb/2;
                            m[0] += difb/2 + difb % 2;
                            n -= 1;
                        } else {
                            m[0] += difb/2 + difb%2;
                            m[1] -= difb/2;
                            m[1] -= (difb/2 + difb%2) % 2;
                            m[2] -= difb/2;
                            n -= difb/2 + difb%2;
                        }

                    } else {
                        difb = min(n,difb);
                        m[0]+= difb;
                        m[2]-= difb;
                        n -= difb;
                    }

                }
            } else {
                    n = 0;
            }
        }
        for (ll k : m ) {
            cout << k << ' ';
        }
        cout << '\n';
    }
    return 0;
}

Test details

Test 1

Group: 1

Verdict:

input
1000
7 69 64 45
37 5 30 81
50 49 37 38
46 37 100 6
...

correct output
46 47 47
24 24 24
45 45 46
43 46 94
32 32 33
...

user output
(empty)

Test 2

Group: 2

Verdict:

input
1000
19 13 88 978977859
67 57 39 960003440
81 16 67 971611942
92 96 2 957979201
...

correct output
39 40 41
54 54 55
54 55 55
63 63 64
36 37 38
...

user output
(empty)

Test 3

Group: 3

Verdict:

input
1000
211358104 753479603 549127067 ...

correct output
504654924 504654925 504654925
589019272 589019272 589019273
101309993 101309994 101309994
436205296 436205297 436205298
351062567 351062568 351062568
...

user output
(empty)