# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
944543 | rainboy | 수족관 2 (KOI13_aqua2) | C11 | 0 ms | 0 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 <math.h>
#include <stdio.h>
#define N 150000
int main() {
static int xx[N + 1], yy[N], ll[N], rr[N], pp[N], qu[N], dd[N], kk[N];
int n, k, cnt, i, j, lower, upper, x;
double t;
long long area;
scanf("%d%*d%*d", &n), n = n / 2 - 1;
xx[0] = 0;
for (i = 0; i < n; i++)
scanf("%*d%*d%d%d", &xx[i + 1], &yy[i]);
scanf("%*d%*d");
cnt = 0;
for (i = 0; i < n; i++) {
while (cnt && yy[qu[cnt - 1]] > yy[i])
cnt--;
ll[i] = cnt == 0 ? -1 : qu[cnt - 1];
qu[cnt++] = i;
}
cnt = 0;
for (i = n - 1; i >= 0; i--) {
while (cnt && yy[qu[cnt - 1]] >= yy[i])
cnt--;
rr[i] = cnt == 0 ? n : qu[cnt - 1];
qu[cnt++] = i;
}
for (i = 0; i < n; i++) {
pp[i] = rr[i] == n || ll[i] != -1 && yy[ll[i]] > yy[rr[i]] ? ll[i] : rr[i];
if (pp[i] != -1)
dd[pp[i]]++;
}
scanf("%d", &k);
while (k--) {
scanf("%d%*d%*d%*d", &x);
lower = 0, upper = n;
while (upper - lower > 1) {
i = (lower + upper) / 2;
if (xx[i] <= x)
lower = i;
else
upper = i;
}
kk[lower]++;
}
for (i = 0; i < n; i++) {
j = i;
while (pp[j] != -1 && dd[j] == 0)
dd[j] = -1, kk[pp[j]] += kk[j], dd[pp[j]]--, j = pp[j];
}
t = 0, area = 0;
for (i = 0; i < n; i++)
if (kk[i] > 0)
t += (double) (xx[rr[i]] - xx[ll[i] + 1]) * (yy[i] - yy[pp[i]]) / kk[i];
else
area += (long long) (xx[rr[i]] - xx[ll[i] + 1]) * (yy[i] - yy[pp[i]]);
printf("%.2f\n", round(t * 1000) / 1000);
printf("%lld\n", area);
return 0;
}