# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
590025 | Valaki2 | Road Construction (JOI21_road_construction) | C++14 | 1609 ms | 14832 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 int long long
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define fi first
#define se second
const int inf = 4e9 + 42;
int n, k;
vector<pii > points;
inline int new_x(pii a) {
return a.fi - a.se;
}
inline int new_y(pii a) {
return a.fi + a.se;
}
inline int dist(pii a, pii b) {
return abs(a.fi - b.fi) + abs(a.se - b.se);
}
bool cmp_1(pii a, pii b) {
if(new_x(a) == new_x(b)) {
return (a.fi < b.fi);
# | 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... |