| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1342221 | mantaggez | Best Place (NOI17_bestplace) | C++20 | 104 ms | 1588 KiB |
#include <bits/stdc++.h>
using namespace std;
struct point {
int x, y;
};
int n;
vector<point> p;
int dist(point& a, point& b) { return abs(a.x - b.x) + abs(a.y - b.y); }
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin >> n;
for(int i=0;i<n;i++) {
int x, y;
cin >> x >> y;
p.push_back({x, y});
}
point ans;
int mn = 1e9;
for(int x=0;x<=1000;x++) {
int d = 0;
for(int i=0;i<n;i++) {
point cord = {x, 0};
d += dist(cord, p[i]);
}
if(d < mn) {
mn = d;
ans = {x, 0};
}
}
cout << ans.x << ' ' << ans.y << '\n';
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
