oj.uz

Submission #932834

# Submission time Handle Problem Language Result Execution time Memory
932834 2024-02-24T09:56:57 Z ishat_jha Best Place (NOI17_bestplace) C++14
23 / 100
 90 ms 2196 KB 
#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;
		return;
	}
	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();
	}
}

Compilation message

bestplace.cpp: In function 'void solvr()':
bestplace.cpp:26:17: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   26 |  else if(only_z = 1)
      |          ~~~~~~~^~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 83 ms 2040 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 90 ms 2196 KB Output isn't correct
2 Halted 0 ms 0 KB -