제출 #932837

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
932837		ishat_jha	Best Place (NOI17_bestplace)	C++14	36 / 100	1036 ms	1884 KiB

bestplace

#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ff first
#define ss second

void solvr()
{
	ll n;
	cin >> n;
	vector<pair<ll, ll>> v(n);
	ll only_z = 1;
	for(ll i = 0; i < n; i++)
	{
		cin >> v[i].ff >> v[i].ss;
		if(v[i].ss != 0)
		{
			only_z = 0;
		}
	}
	if(n == 2)
	{
		cout << v[0].ff << " " << v[0].ss << endl;
	}
	else if(only_z == 1)
	{
		ll tt = 0;
		ll minn = LLONG_MAX;
		for(ll i = 0; i < 1000; i++)
		{
			ll sum = 0;
			for(ll j = 0; j < n; j++)
			{
				sum += abs(v[j].ff - i);
			}
			if(minn > sum)
			{
				tt = i;
				minn = sum;
			}
		}
		cout << tt << " " << 0 << endl;
	}
	else
	{
		pair<ll, ll> minn;
		ll mnn = LLONG_MAX;
		for(ll x = 0; x <= 100; x++)
		{
			for(ll y = 0; y <= 100; y++)
			{
				ll sum = 0;
				for(ll i = 0; i < n; i++)
				{
					sum += (abs(v[i].ff - x) + abs(v[i].ss - y));
				}
				if(sum < mnn)
				{
					mnn = sum;
					minn = make_pair(x, y);
				}
			}
		}
		cout << minn.ff << " " << minn.ss << endl;
	}
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	long long int t = 1;
	//cin >> t;
	while(t--)
	{
		solvr();
	}
}

• Subtask 1: 3 / 3
• Subtask 2: 20 / 20
• Subtask 3: 0 / 28
• Subtask 4: 13 / 13
• Subtask 5: 0 / 17
• Subtask 6: 0 / 19