제출 #242652

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
242652		Vimmer	Go (COCI16_go)	C++14	50 / 50	5 ms	384 KiB

go

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 200101
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 2> a2;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int kol, k, m;

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    int mx = -1, sm = 0;

    string name;

    cin >> n;

    for (int i = 0; i < n; i++)
    {
        string s;

        cin >> s;

        cin >> k >> m;

        kol = m / k;

        m = m % k + kol * 2;

        while (m >= k) {m -= k; kol++; m += 2;}

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

        sm += kol;
    }

    cout << sm << endl;

    cout << name << endl;
}

• Subtask 1: 50 / 50