Submission #70386

#	Time	Username	Problem	Language	Result	Execution time	Memory
70386		forestryks	Go (COCI16_go)	C++14	50 / 50	4 ms	868 KiB

go

///////////////////////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
using namespace std;

#define mp make_pair
#define pb push_back
#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define FILE_IO(x) freopen((string(x) + ".in").c_str(), "r", stdin); freopen((string(x) + ".out").c_str(), "w", stdout)
#define f first
#define s second
#define x1 x1qwer
#define y1 y1qwer
#define right right123
#define left left123
#define foreach(it, v) for (auto it : v)
#define rep(it, n) for (int it = 0; it < n; ++it)
#define forin(it, l, r) for (int it = l; it < r; ++it)
#define all(x) x.begin(), x.end()

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const double DINF = numeric_limits<double>::infinity();
const ll MOD = 1e9 + 7;
const double EPS = 1e-7;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
mt19937 mmtw_(MOD);
uniform_int_distribution<ll> rd_;
ll randomll() { return rd_(mmtw_);}
ll rnd(ll x, ll y) { return rd_(mmtw_) % (y - x + 1) + x; }
template <class T> T fact(T n) { if (n == 1) return 1; return n * fact(n - 1); }
////////////////////////////////////////////////////////////////////////////////////////////////

const int MAXN = 100;

int n;
string s[MAXN];
int res[MAXN];
int mx = 0;

int main() {
	FAST_IO;
	cin >> n;
	rep(i, n) {
		cin >> s[i];
		int k, m;
		cin >> k >> m;
		while (m >= k) {
			res[i]++;
			m -= k;
			m += 2;
		}

		if (res[i] > res[mx]) mx = i;
	}

	cout << accumulate(res, res + n, 0LL) << endl;
	cout << s[mx] << endl;
}

• Subtask 1: 50 / 50