# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
246743 | Vladikus004 | Go (COCI16_go) | C++14 | 5 ms | 512 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>
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
const int N = 71;
int n, a[N], b[N], res;
string s[N];
int get_count(int a, int b){
int ans = 0;
while (b - a >= 0){
b -= a;
b += 2;
ans++;
}
return ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif // LOCAL
cin >> n;
pii mx = {-inf, -inf};
for (int i = 0; i < n; i++){
cin >> s[i];
cin >> a[i] >> b[i];
int cnt = get_count(a[i], b[i]);
res += cnt;
mx = max(mx, {cnt, -i});
// cout << cnt << "!\n";
}
cout << res << "\n";
cout << s[-mx.second];
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |