Task: | Kulut |
Sender: | Laserr |
Submission time: | 2023-01-21 15:12:23 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 100 |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.00 s | details |
#2 | ACCEPTED | 0.00 s | details |
#3 | ACCEPTED | 0.00 s | details |
#4 | ACCEPTED | 0.00 s | details |
#5 | ACCEPTED | 0.00 s | details |
#6 | ACCEPTED | 0.00 s | details |
#7 | ACCEPTED | 0.00 s | details |
#8 | ACCEPTED | 0.00 s | details |
#9 | ACCEPTED | 0.00 s | details |
#10 | ACCEPTED | 0.00 s | details |
#11 | ACCEPTED | 0.00 s | details |
Code
#include <iostream> #include <algorithm> #include <vector> using namespace std; typedef long long ll; ll n; ll a, b, c, d; ll k, s, u; vector<pair<ll,char>> v; vector<pair<char,pair<char, ll>>> vastaus; bool balance(){ bool b = true; for (int i = 0; i < 4; i++){ if(v[i].first != s) b = false; } return b; } int main (){ cin >> n; v.resize(4); a = 0; b = 0; c = 0; d = 0; for(int i = 0; i < n; i++){ char cs; ll x; cin >> cs >> x; if(cs == 'A') a += x; if(cs == 'B') b += x; if(cs == 'C') c += x; if(cs == 'D') d += x; } v[0].first = a; v[0].second = 'A'; v[1].first = b; v[1].second = 'B'; v[2].first = c; v[2].second = 'C'; v[3].first = d; v[3].second = 'D'; k = a + b + c + d; s = k / 4; bool check = balance(); //cout << s << "\n"; while(!check){ sort(v.begin(), v.end()); //for(auto i : v) cout << i.first << " " << i.second << " "; //cout << "\n"; ll g = 0; if(v[3].first - s >= 1e9) g = 1e9; else g = v[3].first - s; vastaus.push_back({v[0].second,{v[3].second, g}}); v[0].first += g; v[3].first -= g; check = balance(); } cout << vastaus.size() << "\n"; for (auto i : vastaus) cout << i.first << " " << i.second.first << " " << i.second.second << "\n"; //for (auto i : v) cout << i.first << " "; }
Test details
Test 1
Verdict: ACCEPTED
input |
---|
100 C 224 D 4 D 624 D 64 ... |
correct output |
---|
3 A B 630 C B 1636 C D 1470 |
user output |
---|
3 C B 2266 C D 1470 A C 630 |
Test 2
Verdict: ACCEPTED
input |
---|
100 D 768 B 608 A 116 C 80 ... |
correct output |
---|
3 B A 756 B C 1668 D C 1776 |
user output |
---|
3 B C 3444 D B 1020 D A 756 |
Test 3
Verdict: ACCEPTED
input |
---|
100 B 184 C 840 D 648 A 876 ... |
correct output |
---|
3 A B 1131 B C 190 C D 297 |
user output |
---|
3 A B 941 A D 297 C A 107 |
Test 4
Verdict: ACCEPTED
input |
---|
100 C 560 D 664 D 632 C 944 ... |
correct output |
---|
3 B A 3230 C B 2572 D C 1594 |
user output |
---|
3 D A 3230 C D 1636 B C 658 |
Test 5
Verdict: ACCEPTED
input |
---|
100 B 20 A 664 D 504 A 248 ... |
correct output |
---|
3 A B 138 B C 652 C D 350 |
user output |
---|
3 B D 350 B C 302 A B 138 |
Test 6
Verdict: ACCEPTED
input |
---|
100 B 204 D 520 C 500 C 256 ... |
correct output |
---|
3 B A 285 B C 482 C D 1321 |
user output |
---|
3 C D 1321 B C 482 B A 285 |
Test 7
Verdict: ACCEPTED
input |
---|
100 B 672 B 840 A 712 C 640 ... |
correct output |
---|
3 B A 324 C B 5128 D C 2920 |
user output |
---|
3 D B 4804 C D 1884 C A 324 |
Test 8
Verdict: ACCEPTED
input |
---|
100 C 860 D 732 A 952 C 940 ... |
correct output |
---|
3 A B 24 C B 536 D C 2252 |
user output |
---|
3 D C 1716 D B 560 A D 24 |
Test 9
Verdict: ACCEPTED
input |
---|
100 C 84 A 592 B 840 C 708 ... |
correct output |
---|
3 A B 115 B C 1746 D C 3791 |
user output |
---|
3 D C 5537 B D 1746 A B 115 |
Test 10
Verdict: ACCEPTED
input |
---|
1 A 100 |
correct output |
---|
3 B A 75 C B 50 D C 25 |
user output |
---|
3 B A 75 C B 50 D C 25 |
Test 11
Verdict: ACCEPTED
input |
---|
4 A 25 B 25 C 25 D 25 |
correct output |
---|
0 |
user output |
---|
0 |