oj.uz

Submission #632500

# Submission time Handle Problem Language Result Execution time Memory
632500 2022-08-20T08:10:36 Z mannshah1211 Best Place (NOI17_bestplace) C++14
100 / 100
 96 ms 3788 KB 
#include <bits/stdc++.h>
using namespace std;

int main(){
  long long n;
  cin >> n;
  
  long long x[n], y[n];
  for(long long i = 0; i < n; i++){
    cin >> x[i] >> y[i];
  }
  
  sort(x, x + n);
  sort(y, y + n);
  
  if(n % 2 == 1){
    cout << x[(n - 1)/2] << ' ' << y[(n - 1)/2];
  } else{
    long long sum1 = 0;
    long long sum2 = 0;
    long long opt1x = (x[n/2 - 1] + x[n/2])/2;
    long long opt1y = (y[n/2 - 1] + y[n/2])/2;
    
    for(long long i = 0; i < n; i++){
      sum1 += abs(opt1x - x[i]) + abs(opt1y - y[i]);
      sum2 += abs(opt1x - x[i] + 1) + abs(opt1y - y[i] + 1);
    }
    
    if(sum1 > sum2){
      cout << opt1x + 1 << ' ' << opt1y + 1;
    } else{
      cout << opt1x << ' ' << opt1y;
    }
  }
}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 2852 KB Output is correct
2 Correct 73 ms 3000 KB Output is correct
3 Correct 62 ms 2892 KB Output is correct
4 Correct 55 ms 2980 KB Output is correct
5 Correct 55 ms 2992 KB Output is correct
6 Correct 59 ms 2976 KB Output is correct
7 Correct 60 ms 2932 KB Output is correct
8 Correct 63 ms 2984 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 3760 KB Output is correct
2 Correct 86 ms 3744 KB Output is correct
3 Correct 96 ms 3756 KB Output is correct
4 Correct 66 ms 3076 KB Output is correct
5 Correct 83 ms 3760 KB Output is correct
6 Correct 93 ms 3788 KB Output is correct
7 Correct 85 ms 3740 KB Output is correct
8 Correct 87 ms 3744 KB Output is correct