Submission #869772

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
869772	2023-11-05T15:35:45 Z	Ariadna	Go (COCI16_go)	C++14	50 / 50	1 ms	348 KB

go

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector < string > pokemon(n);
    vector < int > k(n), m(n);
    for (int i = 0; i < n; ++i) {
        cin >> pokemon[i] >> k[i] >> m[i];
    }
    
    int total = 0, max_evolutions = -1;
    string max_evolved;
    for (int i = 0; i < n; ++i) {
        int ev = 0;
        while (m[i] >= k[i]) {
            ev += m[i] / k[i];
            m[i] = (m[i] % k[i]) + 2 * (m[i] / k[i]);
        }
        if (ev > max_evolutions) {
            max_evolutions = ev;
            max_evolved = pokemon[i];
        }
        total += ev;
    }
    cout << total << '\n' << max_evolved << '\n';
    
    return 0;
}

Subtask #1

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct