Submission #481393

#	Time	Username	Problem	Language	Result	Execution time	Memory
481393		Swarnava_Chattaraj	Best Place (NOI17_bestplace)	C++17	3 / 100	82 ms	2996 KiB

bestplace

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


int check(vector<int> arr, int r)
{
  int sum = 0;
  for(int i = 0; i < arr.size(); i++)
  {
    sum += abs(arr[i] - r);
  }
  return sum;
}

int binarySearch(vector<int> arr, int mini, int maxi)
{
  int left = mini;
  int right = maxi;
  int min_sum = INT_MAX;
  int best_r = INT_MIN / 2;
  while(left <= right)
  {
    int middle = left + (right - left) / 2;
    int curr_sum = check(arr, middle);
    if(curr_sum < min_sum)
    {
      min_sum = curr_sum;
      best_r = middle;
      left = middle + 1;
    }
    else
      right = middle - 1;
  }
  return best_r;


}

void solve()
{
  int n;
  cin >> n; 
  int x;
  int maxi_x = 0, maxi_y = 0;
  int mini_x = INT_MAX, mini_y = INT_MAX;
  vector<int> X(n);
  vector<int> Y(n);
  for(int i = 0; i < n; i++)
  {
    cin >> X[i] >> Y[i];
    maxi_x = max(maxi_x, X[i]);
    mini_x = min(mini_x, X[i]);
    maxi_y = max(maxi_y, Y[i]);
    mini_y = min(mini_y, Y[i]);    

  }
  int val1 = binarySearch(X, mini_x, maxi_x) ;//call for x
  int val2 = binarySearch(Y, mini_y, maxi_y) ;//call for y
  cout << val1 << ' ' << val2 << '\n';
}



int main(){

//   #ifndef ONLINE_JUDGE
//   freopen("input.txt","r",stdin);
//   freopen("output.txt","w",stdout);
//   #endif
//   // ll T;
//   // cin >> T;
//   // while(T--)
//   // {
//   //   solve();
//   // }
  solve();




  return 0;
}

Compilation message (stderr)

bestplace.cpp: In function 'int check(std::vector<int>, int)':
bestplace.cpp:9:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |   for(int i = 0; i < arr.size(); i++)
      |                  ~~^~~~~~~~~~~~
bestplace.cpp: In function 'void solve()':
bestplace.cpp:44:7: warning: unused variable 'x' [-Wunused-variable]
   44 |   int x;
      |       ^

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