oj.uz

답안 #869771

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
869771 2023-11-05T15:33:53 Z ElenaBM Go (COCI16_go) C++17
50 / 50
 1 ms 360 KB 
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, totans = 0;
    cin>> n;
    vector<string>name(n);
    vector<int>ev(n), tot (n);
    pair<string, int> ans({"a", 0});
    for (int i = 0; i <n; ++i) cin>> name[i] >> ev[i] >> tot[i];
    for (int i = 0; i <n; ++i){
        int act = 0; //veces que se puede evolucionar en este caso
        while (tot[i] >= ev[i]){
            //dividir el total por las chuches necesarias para evolcionar, sumar 2*cociente al resto
            int coc = tot[i]/ev[i];
            int res = tot[i] - coc*ev[i];
            act += coc;
            tot[i] = res + 2*coc;
        }
        if (act > ans.second){
            ans.first = name[i];
            ans.second = act;
        }
        totans += act;
    }
    cout<< totans<< '\n';
    cout<< ans.first << '\n';
    return 0;
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 360 KB Output is correct
4 Correct 0 ms 348 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 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 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 348 KB Output is correct
15 Correct 0 ms 348 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 0 ms 344 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 348 KB Output is correct