Submission #949178

# Submission time Handle Problem Language Result Execution time Memory
949178 2024-03-19T03:21:50 Z vjudge1 Best Place (NOI17_bestplace) C++17
100 / 100
31 ms 2020 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];
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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
# Verdict Execution time Memory Grader output
1 Correct 12 ms 1884 KB Output is correct
2 Correct 18 ms 1880 KB Output is correct
3 Correct 18 ms 1880 KB Output is correct
4 Correct 15 ms 2016 KB Output is correct
5 Correct 17 ms 1880 KB Output is correct
6 Correct 19 ms 2020 KB Output is correct
7 Correct 18 ms 1880 KB Output is correct
8 Correct 18 ms 1884 KB Output is correct
# 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 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 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 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 27 ms 1880 KB Output is correct
2 Correct 27 ms 1880 KB Output is correct
3 Correct 18 ms 1880 KB Output is correct
4 Correct 25 ms 1884 KB Output is correct
5 Correct 27 ms 1880 KB Output is correct
6 Correct 27 ms 1884 KB Output is correct
7 Correct 27 ms 1884 KB Output is correct
8 Correct 31 ms 1884 KB Output is correct