제출 #1020268

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1020268		ajay	Go (COCI16_go)	C++17	50 / 50	1 ms	604 KiB

go

/* Ajay Jadhav */
 
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <deque>
#include <vector>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <ctime>
#include <string.h>
#include <climits>
#include <cstring>
using namespace std;
 
 
#define ll          long long
#define pb          push_back
#define pii         pair<int,int>
#define vi          vector<int>
#define vii         vector<pii>
#define mi          map<int,int>
#define mii         map<pii,int>
#define all(a)      (a).begin(),(a).end()
#define x           first
#define y           second
#define sz(x)       (int)x.size()
#define hell        1000000007
#define rep(i,a,b)  for(int i=a;i<b;i++)
#define endl        '\n'
 
 
 
void solve()
{
    int n;
    cin>>n;
    vi k(n), m(n);
    int most_eveolved_cnt = 0, ans = 0;
    string most_eveolved_pokemon;

    rep(i,0,n)
    {
		string s;
		cin>>s;
		cin>>k[i]>>m[i];
		int c = 0;
		while(k[i] <= m[i])
		{
			m[i] -= k[i];
			m[i] += 2;
			c++;
		}

		ans += c;
		if (c > most_eveolved_cnt)
		{
			most_eveolved_cnt = c;
			most_eveolved_pokemon = s;
		}

    } 

    cout<<ans<<endl;
    cout<<most_eveolved_pokemon<<endl;


}
 
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin>>t;
    while (t--)
    {
        solve();
    }
    return 0;
}

• Subtask 1: 50 / 50