CSES - Datatähti 2023 loppu - Results
Submission details
Task:Kulut
Sender:vgtcross
Submission time:2023-01-21 13:16:05 +0200
Language:C++11
Status:READY
Result:0
Feedback
groupverdictscore
#10
Test results
testverdicttime
#10.00 sdetails
#20.00 sdetails
#30.00 sdetails
#40.00 sdetails
#50.00 sdetails
#60.00 sdetails
#70.00 sdetails
#80.00 sdetails
#90.00 sdetails
#100.00 sdetails
#11ACCEPTED0.00 sdetails

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:67:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Code

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using pii = pair<int, int>;

void solve() {
    int n;
    cin >> n;

    int sum = 0;
    int paid[4] = {0, 0, 0, 0};

    for (int i = 0; i < n; ++i) {
        char h;
        int x;
        cin >> h >> x;
        sum += x;
        paid[h-'A'] += x;
    }

    int goal = sum / 4;
    stack<pii> more;
    stack<pii> less;

    for (int i = 0; i < 4; ++i) {
        if (paid[i] > goal) {
            more.push({i, paid[i] - goal});
        } else if (paid[i] < goal) {
            more.push({i, goal - paid[i]});
        }
    }

    vector<string> ans;
    while (!more.empty()) {
        pii &a = more.top();
        pii &b = less.top();

        int change = min(a.second, b.second);
        string s;
        s.push_back(char(a.first+'A'));
        s += " ";
        s.push_back(char(b.first+'A'));
        s += " ";
        s += to_string(change);

        ans.push_back(s);

        a.second -= change;
        b.second -= change;
        if (a.second == 0)
            more.pop();
        if (b.second == 0)
            less.pop();
    }

    cout << ans.size() << '\n';
    for (string s: ans) {
        cout << s << '\n';
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    freopen("input.txt", "r", stdin);

    solve();

    return 0;
}

Test details

Test 1

Verdict:

input
100
C 224
D 4
D 624
D 64
...

correct output
3
A B 630
C B 1636
C D 1470

user output
0

Test 2

Verdict:

input
100
D 768
B 608
A 116
C 80
...

correct output
3
B A 756
B C 1668
D C 1776

user output
0

Test 3

Verdict:

input
100
B 184
C 840
D 648
A 876
...

correct output
3
A B 1131
B C 190
C D 297

user output
0

Test 4

Verdict:

input
100
C 560
D 664
D 632
C 944
...

correct output
3
B A 3230
C B 2572
D C 1594

user output
0

Test 5

Verdict:

input
100
B 20
A 664
D 504
A 248
...

correct output
3
A B 138
B C 652
C D 350

user output
0

Test 6

Verdict:

input
100
B 204
D 520
C 500
C 256
...

correct output
3
B A 285
B C 482
C D 1321

user output
0

Test 7

Verdict:

input
100
B 672
B 840
A 712
C 640
...

correct output
3
B A 324
C B 5128
D C 2920

user output
0

Test 8

Verdict:

input
100
C 860
D 732
A 952
C 940
...

correct output
3
A B 24
C B 536
D C 2252

user output
0

Test 9

Verdict:

input
100
C 84
A 592
B 840
C 708
...

correct output
3
A B 115
B C 1746
D C 3791

user output
0

Test 10

Verdict:

input
1
A 100

correct output
3
B A 75
C B 50
D C 25

user output
0

Test 11

Verdict: ACCEPTED

input
4
A 25
B 25
C 25
D 25

correct output
0

user output
0