oj.uz

Submission #858069

# Submission time Handle Problem Language Result Execution time Memory
858069 2023-10-07T11:31:03 Z rajpragur Best Place (NOI17_bestplace) C++14
100 / 100
 69 ms 3360 KB 
#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin>>n;
  vector<int> x;
  vector<int> y;
  for(int i = 0 ; i < n ; i++){
    int a,b;
    cin>>a>>b;
    x.push_back(a);
    y.push_back(b);
  }
  sort(x.begin(),x.end());
  sort(y.begin(),y.end());
  if(n%2!=0){
    cout << x[(n-1)/2] << " " << y[(n-1)/2];
  }else{
    int ansx,ansy;
    int a = x[(n/2) - 1], b = x[(n/2)] , c = y[(n/2) - 1] , d = y[(n/2)];
    if (b-a <= 1) {
      ansx = a;
    }else{
      ansx = a + 1;
    }
    if (d-c <= 1) {
      ansy = c;
    }else{
      ansy = c + 1;
    }
    cout<< ansx<< " "<<ansy;
  }
  return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 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 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 2404 KB Output is correct
2 Correct 51 ms 2804 KB Output is correct
3 Correct 46 ms 2512 KB Output is correct
4 Correct 42 ms 2500 KB Output is correct
5 Correct 46 ms 2504 KB Output is correct
6 Correct 48 ms 2508 KB Output is correct
7 Correct 46 ms 2504 KB Output is correct
8 Correct 47 ms 2448 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 3268 KB Output is correct
2 Correct 66 ms 3168 KB Output is correct
3 Correct 58 ms 3252 KB Output is correct
4 Correct 52 ms 2500 KB Output is correct
5 Correct 66 ms 3360 KB Output is correct
6 Correct 69 ms 3272 KB Output is correct
7 Correct 65 ms 3312 KB Output is correct
8 Correct 69 ms 3272 KB Output is correct