# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
223774 | Minnakhmetov | Hamburg Steak (JOI20_hamburg) | C++14 | 897 ms | 1048580 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 all(aaa) aaa.begin(), aaa.end()
const int N = 4e5 + 5;
struct R {
int xl, yl, xr, yr;
bool contains(int x, int y) const {
return x >= xl && x <= xr && y >= yl && y <= yr;
}
};
vector<R> rcs;
vector<int> vx, vy;
vector<pair<int, int>> ans;
bool solve_for_line(vector<pair<int, int>> v, int k, bool hor, int x) {
sort(all(v));
int last = N;
vector<int> w;
for (int i = (int)v.size() - 1; i >= 0; i--) {
if (v[i].second < last) {
if (k == 0)
return false;
k--;
last = v[i].first;
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |