# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
869771 | ElenaBM | Go (COCI16_go) | C++17 | 1 ms | 360 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |