# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
944505 | rainboy | 수족관 1 (KOI13_aqua1) | C11 | 2 ms | 600 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>
#define N 2500
int main() {
static int xx[N + 1], yy[N], ll[N], rr[N], pp[N], qu[N];
static char empty[N];
int n, k, cnt, i, lower, upper, x, ans;
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];
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... |