| Task: | Kasat |
| Sender: | |
| Submission time: | 2015-09-13 10:41:03 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 21 |
| #2 | ACCEPTED | 33 |
| #3 | ACCEPTED | 46 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.06 s | 1 | details |
| #2 | ACCEPTED | 0.05 s | 2 | details |
| #3 | ACCEPTED | 0.05 s | 3 | details |
Code
#include <iostream>
using namespace std;
int t;
int a,b,c;
int n;
int main() {
cin >> t;
for (int i=0;i<t;i++) {
cin >> a >> b >> c >> n;
if (a>b) swap(a,b);
if (b>c) swap(b,c);
if (a>b) swap(a,b);
int k = min(n, min(b-a,c-b));
a+=k;
c-=k;
n-=k;
if (b==c) {
k=min((n/2)*2, ((b-a)/3)*2);
a+=k;
b-=k/2;
c-=k/2;
n-=k;
}
if (a==b) {
k=min((n/2)*2,((c-b)/3)*2);
a+=k/2;
b+=k/2;
c-=k;
n-=k;
}
if (a==b && b==c) {
cout << a-(n%2) << " " << b << " " << c+(n%2) <<
"\n";
} else {
if (n>0) {
a++;
c--;
n--;
if (a>b) swap(a,b);
if (b>c) swap(b,c);
if (a>b) swap(a,b);
}
cout << a << " " << b << " " << c << "\n";
}
}
}
Test details
Test 1
Group: 1
Verdict: ACCEPTED
| 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 |
|---|
| 46 47 47 24 24 24 45 45 46 43 46 94 32 32 33 ... |
Test 2
Group: 2
Verdict: ACCEPTED
| 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 |
|---|
| 39 40 41 54 54 55 54 55 55 63 63 64 36 37 38 ... |
Test 3
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 1000 211358104 753479603 549127067 ... |
| correct output |
|---|
| 504654924 504654925 504654925 589019272 589019272 589019273 101309993 101309994 101309994 436205296 436205297 436205298 351062567 351062568 351062568 ... |
| user output |
|---|
| 504654924 504654925 504654925 589019272 589019272 589019273 101309993 101309994 101309994 436205296 436205297 436205298 351062567 351062568 351062568 ... |
