Kulut

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;


// Syöte:
// 4
// A 100
// B 50
// A 50
// D 80
map<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 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED