Submission #242528

#	Time	Username	Problem	Language	Result	Execution time	Memory
242528		kartel	Go (COCI16_go)	C++14	50 / 50	5 ms	512 KiB

go

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +1000500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define pii pair <int, int>
#define err ld(1e-9)
#define last(x) x.back()
#define all(x) (x.begin(), x.end())
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

string st, s;
int k, p, i, n, mx, ans;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("D:/cpp/2/output.txt");
//    out("output.txt");

    cin >> n;
    for (i = 1; i <= n; i++)
    {
        int kol = 0;
        cin >> s >> k >> p;

        while (p >= k) p -= (k - 2), kol++;

        ans += kol;

        if (kol > mx)
        {
            st = s;
            mx = kol;
        }
    }

    cout << ans << el;
    cout << st;
}

//
//00000
//00110
//00111
//00011
//00000

• Subtask 1: 50 / 50