# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
396358 | 4fecta | Road Construction (JOI21_road_construction) | C++17 | 5490 ms | 997256 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define boost() cin.tie(0), cin.sync_with_stdio(0)
const int MN = 250005;
int n, k;
pii a[MN];
int cost(pii p, pii q) {
return abs(p.f - q.f) + abs(p.s - q.s);
}
bool cmp(pii p, pii q) {
return cost(a[p.f], a[p.s]) > cost(a[q.f], a[q.s]);
}
int32_t main() {
boost();
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i].f >> a[i].s;
if (n <= 1) {
# | 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... |