| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 210421 | Fasho | Go (COCI16_go) | C++14 | 6 ms | 504 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define N 1000005
#define ll long long int 	
#define MP make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int,int>
#define lli pair<ll,ll>
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
#define fast2 freopen ("badhair.gir","r",stdin);freopen ("badhair.cik","w",stdout);
#define mod 1000000007
#define fs(x,y) for(ll i=1;i<=y;i++) cin>>x[i]
#define fo(i,x,y) for(ll i=x;i<=y;i++)
#define INF 1000000000005
#define ull unsigned long long int
using namespace std;
ll n,m,ar[N],sum,t,mk;
string s,ans;
ll f(ll a,ll b)
{
	ll cnt=0;
	while(a<=b)
	{
		cnt++;
		b-=a;
		b+=2;
	}
	return cnt;
}
int main()
{
	fast;
	cin>>n;
	mk=-1;
	fo(i,1,n)
	{
		cin>>s;
		ll top=0;
		int a,b;
		cin>>a>>b;
		top=f(a,b);
		if(top>mk)
		{
			mk=top;
			ans=s;
		}
		sum+=top;
	}
	cout<<sum<<endl<<ans;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
