oj.uz

Submission #481511

# Submission time Handle Problem Language Result Execution time Memory
481511 2021-10-21T05:33:02 Z Swarnava_Chattaraj Best Place (NOI17_bestplace) C++17
100 / 100
 97 ms 3012 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long int


void solve()
{
  int n;
  cin >> n; 
  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];
  }

  sort(X.begin(), X.end());
  sort(Y.begin(), Y.end());
  int m_x = 0, m_y = 0;
  if(n % 2 != 0)
    m_x= X[n / 2];
  else  
    m_x = (X[(n - 1) / 2] + X[(n + 1) / 2]) / 2;
  if(n % 2 != 0)
    m_y= Y[n / 2];
  else  
    m_y = (Y[(n - 1) / 2] + Y[(n + 1) / 2]) / 2;
  cout << m_x << ' ' << m_y << endl;
}



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

bestplace.cpp: In function 'void solve()':
bestplace.cpp:10:7: warning: unused variable 'maxi_x' [-Wunused-variable]
   10 |   int maxi_x = 0, maxi_y = 0;
      |       ^~~~~~
bestplace.cpp:10:19: warning: unused variable 'maxi_y' [-Wunused-variable]
   10 |   int maxi_x = 0, maxi_y = 0;
      |                   ^~~~~~
bestplace.cpp:11:7: warning: unused variable 'mini_x' [-Wunused-variable]
   11 |   int mini_x = INT_MAX, mini_y = INT_MAX;
      |       ^~~~~~
bestplace.cpp:11:25: warning: unused variable 'mini_y' [-Wunused-variable]
   11 |   int mini_x = INT_MAX, mini_y = INT_MAX;
      |                         ^~~~~~

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 972 KB Output is correct
2 Correct 60 ms 2212 KB Output is correct
3 Correct 58 ms 2212 KB Output is correct
4 Correct 64 ms 2204 KB Output is correct
5 Correct 55 ms 2116 KB Output is correct
6 Correct 59 ms 2196 KB Output is correct
7 Correct 56 ms 2160 KB Output is correct
8 Correct 60 ms 2216 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 224 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 1064 KB Output is correct
2 Correct 91 ms 2996 KB Output is correct
3 Correct 77 ms 2988 KB Output is correct
4 Correct 82 ms 2288 KB Output is correct
5 Correct 90 ms 2984 KB Output is correct
6 Correct 84 ms 3012 KB Output is correct
7 Correct 86 ms 2988 KB Output is correct
8 Correct 97 ms 2968 KB Output is correct