# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
670022 | rainboy | Hamburg Steak (JOI20_hamburg) | C11 | 3086 ms | 4740 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 <stdio.h>
#include <stdlib.h>
#define N 200000
#define INF 0x3f3f3f3f
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }
int xx1[N], xx2[N], yy1[N], yy2[N], xx[N], yy[N], n;
int pierced(int i, int k) {
int h;
for (h = 0; h < k; h++)
if (xx1[i] <= xx[h] && xx[h] <= xx2[i] && yy1[i] <= yy[h] && yy[h] <= yy2[i])
return 1;
return 0;
}
void solve(int k_, int k) {
int h, i, x1, x2, y1, y2;
x1 = INF, x2 = -1, y1 = INF, y2 = -1;
for (i = 0; i < n; i++)
if (!pierced(i, k_)) {
x1 = min(x1, xx2[i]), x2 = max(x2, xx1[i]);
y1 = min(y1, yy2[i]), y2 = max(y2, yy1[i]);
}
if (x1 == INF) {
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... |