# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
931936 | hugsfromadicto | Go (COCI16_go) | C++14 | 1 ms | 468 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.
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mxN = 1e6;
int a[mxN], b[mxN];
int s[mxN];
void _()
{
int n;
cin >> n;
string ns;
int mx = 0;
int tot = 0;
for(int i = 0; i < n; ++i)
{
string s;
cin >> s;
int nd,hv;
cin >> s >> nd >> hv;
int ans = 0;
while(hv >= nd)
{
ans++;
hv = hv - nd + 2;
}
if(ans > mx)
{
mx = ans;
ns = s;
}
tot+=ans;
}
cout << tot << endl << ns;
}
main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tc = 1;
while(tc--)
{
_();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |