제출 #165932

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
165932		sans	Go (COCI16_go)	C++14	50 / 50	2 ms	380 KiB

go

#include <iostream>
#include <numeric>
#include <cmath>
#include <algorithm>
#include <vector>

using namespace std;

#define sp ' '
#define st first
#define nd second
#define pb push_back
#define mp make_pair
#define forn(YY, yy) for(long long int yy = 0; yy < YY; ++yy)
#define prn(XX) cout << XX << endl
#define prs(XX) cout << XX << " "

typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;

const int MOD = 1e9 + 7;
const int INF = 2e9 + 13;
const int mINF = -2e9 - 13;
const double PI = 3.14159265358979;
const double EPS = 1e-9;

vector<string> Names;
vector<int> K, M, Upgraded;

int main(int argc, char **argv){
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    int N; cin >> N;
    int ans = 0;
    Names.resize(N); K.resize(N); M.resize(N); Upgraded.assign(N, 0);
    for(int i = 0; i < N; ++i){
        cin >> Names[i] >> K[i] >> M[i];

        int u = 0;
        while(true){
            int x = M[i] / K[i];
            if(!x) break;
            M[i] %= K[i];
            M[i] += 2*x;
            u += x;
        }

        Upgraded[i] = u;
        ans += u;
    }

    auto itr = max_element(Upgraded.begin(), Upgraded.end());
    cout << ans << endl << Names[itr - Upgraded.begin()] << endl;

    return 0;
}

//cikisir

• Subtask 1: 50 / 50