CSES - Putka Open 2015 – 3/6 - Results
 Task: Kasat Sender: Henrik Lievonen Submission time: 2015-09-12 11:10:57 +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>

using namespace std;

vector<int> test(int a, int b, int c, int n) {
vector<int> num = { a,b,c };
sort(num.begin(), num.end());

while (num[0] + 1 < num[2] && n > 10) {
/*if (num[0] == num[1] && num[0] + 3 <= num[2]) {
int d = num[2] - num[0];

if (n < 2 * (d / 3)) d = 3 * n / 2;

num[0] += d / 3;
num[1] += d / 3;
num[2] -= 2 * (d / 3);

n -= 2 * (d / 3);
}
else if (num[1] == num[2] && num[0] + 3 <= num[2]) {
int d = num[2] - num[0];

if (n < 2 * (d / 3)) d = 3 * n / 2;

num[0] += 2 * (d / 3);
num[1] -= d / 3;
num[2] -= d / 3;

n -= 2 * (d / 3);
}
else*/ {
int d = min(num[2] - num[1], num[1] - num[0]);
if (d > n) d = n;
num[2] -= d;
num[0] += d;
n -= d;
}
sort(num.begin(), num.end());
}

while (n > 0) {
if (num[0] == num[1] && num[1] == num[2]) {
if (n % 2 == 0) {
return num;
}
else {
num[0]--;
num[2]++;
return num;
}
}
if (num[0] == num[1] && num[1] + 1 == num[2]) {
return num;
}
if (num[0] + 1 == num[1] && num[1] == num[2]) {
return num;
}

num[2]--;
num[0]++;
n--;
sort(num.begin(), num.end());
}

return num;
}

int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int a, b, c, n;
cin >> a >> b >> c >> n;
auto r = test(a, b, c, n);
cout << r[0] << " " << r[1] << " " << r[2] << "\n";
}
}```

### Test details

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)