oj.uz

Submission #950383

# Submission time Handle Problem Language Result Execution time Memory
950383 2024-03-20T09:05:35 Z viwlesxq Best Place (NOI17_bestplace) C++17
100 / 100
 33 ms 3928 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define size(x) (int)x.size()
#define all(x) x.begin(), x.end()

template<class S, class T>
bool chmin(S& a, const T& b) {
  return a > b ? (a = b) == b : false;
}
template<class S, class T>
bool chmax(S& a, const T& b) {
  return a < b ? (a = b) == b : false;
}

signed main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n; cin >> n;
  int x[n], y[n];
  for (int i = 0; i < n; ++i) {
    cin >> x[i] >> y[i];
  }
  sort(x, x + n), sort(y, y + n);
  int res = 0;
  for (int i = 0; i < n; ++i) {
    res += abs(x[i] - x[n / 2]);
    res += abs(y[i] - y[n / 2]);
  }
  cout << x[n / 2] << ' ' << y[n / 2];
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 348 KB Output is correct
6 Correct 1 ms 456 KB Output is correct

Subtask #2
20.0 / 20.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 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 2908 KB Output is correct
2 Correct 20 ms 3152 KB Output is correct
3 Correct 19 ms 3164 KB Output is correct
4 Correct 14 ms 3416 KB Output is correct
5 Correct 18 ms 3160 KB Output is correct
6 Correct 18 ms 3416 KB Output is correct
7 Correct 19 ms 3116 KB Output is correct
8 Correct 20 ms 3176 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 3928 KB Output is correct
2 Correct 27 ms 3924 KB Output is correct
3 Correct 21 ms 3924 KB Output is correct
4 Correct 26 ms 3160 KB Output is correct
5 Correct 31 ms 3676 KB Output is correct
6 Correct 28 ms 3924 KB Output is correct
7 Correct 33 ms 3784 KB Output is correct
8 Correct 28 ms 3916 KB Output is correct