| Task: | Kasat |
| Sender: | |
| Submission time: | 2015-09-13 20:17:21 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | 21 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 21 |
| #2 | TIME LIMIT EXCEEDED | 0 |
| #3 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.05 s | 1 | details |
| #2 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #3 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int tt;
cin>>tt;
for(int xx = 0; xx < tt; ++xx) {
int t[3];
int n;
cin>>t[0]>>t[1]>>t[2];
cin>>n;
while(n > 0) {
sort(t, t+3);
if(t[0] == t[1] && t[1] == t[2]) {
if(n%2 == 0) {
cout<<t[0]<<' '<<t[1]<<' '<<t[2]<<'\n';
goto ohi;
}
else {
cout<<t[0]-1<<' '<<t[1]<<' '<<t[2]+1<<'\n';
goto ohi;
}
}
if(t[0] == t[1] && t[1]+1 == t[2]) {
cout<<t[0]<<' '<<t[1]<<' '<<t[2]<<'\n';
goto ohi;
}
if(t[0] == t[1]-1 && t[1] == t[2]) {
cout<<t[0]<<' '<<t[1]<<' '<<t[2]<<'\n';
goto ohi;
}
int q = min(t[2] - t[1] + 1, t[1] - t[0] + 1);
q = min(q, n);
n -= q;
t[0] += q;
t[2] -= q;
}
sort(t, t+3);
cout<<t[0]<<' '<<t[1]<<' '<<t[2]<<'\n';
ohi:;
}
}
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: TIME LIMIT EXCEEDED
| 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: TIME LIMIT EXCEEDED
| 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) |