Task: | Kulut |
Sender: | Tipu |
Submission time: | 2023-01-21 13:47:16 +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 <bits/stdc++.h>using namespace std;typedef long long ll;// Syöte:// 4// A 100// B 50// A 50// D 80map<string, int> h {{"A", 0},{"B",0}, {"C",0}, {"D",0}};int v = 0;string p(string a, string b, int c){v++;h[a] -= c;h[b] += c;return b + " " + a + " " + to_string(c) + "\n";}int main(){ios_base::sync_with_stdio(false);cin.tie(0);int n;cin >> n;int s= 0;for (int i = 0; i < n; i++){string a;cin >> a;int b;cin >> b;s += b;h[a] += b;}s /= 4;vector<string> vl;while(h["A"] > s){if(h["B"] < s){int c = min(h["A"] - s, s - h["B"]);vl.push_back(p("A","B",c));}else if(h["C"] < s){int c = min(h["A"] - s, s - h["C"]);vl.push_back(p("A","C",c));}else if(h["D"] < s){int c = min(h["A"] - s, s - h["D"]);vl.push_back(p("A","D",c));}}while(h["B"] > s){if(h["A"] < s){int c = min(h["B"] - s, s - h["A"]);vl.push_back(p("B","A",c));}else if(h["C"] < s){int c = min(h["B"] - s, s - h["C"]);vl.push_back(p("B","C",c));}else if(h["D"] < s){int c = min(h["B"] - s, s - h["D"]);vl.push_back(p("B","D",c));}}while(h["C"] > s){if(h["A"] < s){int c = min(h["C"] - s, s - h["A"]);vl.push_back(p("C","A",c));}else if(h["B"] < s){int c = min(h["C"] - s, s - h["B"]);vl.push_back(p("C","B",c));}else if(h["D"] < s){int c = min(h["C"] - s, s - h["D"]);vl.push_back(p("C","D",c));}}while(h["D"] > s){if(h["A"] < s){int c = min(h["D"] - s, s - h["A"]);vl.push_back(p("D","A",c));}else if(h["B"] < s){int c = min(h["D"] - s, s - h["B"]);vl.push_back(p("D","B",c));}else if(h["C"] < s){int c = min(h["D"] - s, s - h["C"]);vl.push_back(p("D","C",c));}}cout << v << endl;for (auto &&i : vl){cout << i;}}
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 A B 630 C B 1636 C D 1470 |
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 A 756 B C 1668 D C 1776 |
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 190 C D 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 B A 658 C A 978 D A 1594 |
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 A C 138 B C 164 B D 350 |
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 B A 285 B D 482 C D 839 |
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 C A 324 C B 1884 D B 2920 |
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 A B 24 D B 536 D C 1716 |
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 A C 115 B C 1631 D C 3791 |
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 25 C A 25 D A 25 |
Test 11
Verdict: ACCEPTED
input |
---|
4 A 25 B 25 C 25 D 25 |
correct output |
---|
0 |
user output |
---|
0 |