Task: | Kasat |
Sender: | |
Submission time: | 2015-09-12 10:31:43 +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 <bits/stdc++.h> #define _ ios_base::sync_with_stdio(0);cin.tie(); #define mp make_pair #define pb push_back #define ll long long #define pii pair<int,int> #define vpii vector<pii> #define vi vector<int> #define EPS 2.220446e-02 #define PI 3.14159265358 using namespace std; bool compare(const pii&a, const pii&b) { return a.second>b.second; } int main() { _ vector<tuple<int,int,int,int>> qs; int t; cin >> t; for(int i=0;i<t;i++) { int a,b,c,n; cin >> a >> b >> c >> n; qs.push_back(make_tuple(a,b,c,n)); } for(auto x : qs) { int a = get<0>(x),b = get<1>(x),c = get<2>(x),n = get<3>(x); vector<int> arr = {a,b,c}; sort(arr.begin(), arr.end()); for(int i=0;i<n;i++) { arr[2]--; arr[0]++; sort(arr.begin(),arr.end()); } for(int y : arr) { cout << y << " "; } cout << endl; } return 0; }
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) |