oj.uz

Submission #944557

# Submission time Handle Problem Language Result Execution time Memory
944557 2024-03-12T23:19:02 Z rainboy 수족관 2 (KOI13_aqua2) C
100 / 100
 87 ms 13140 KB 
#include <stdio.h>

#define N	150000

double max(double a, double b) { return a > b ? a : b; }

int main() {
	static int xx[N + 1], yy[N], ll[N], rr[N], pp[N], qu[N], dd[N], kk[N];
	static double tt[N];
	int n, k, cnt, i, j, lower, upper, x;
	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 (dd[j] == 0) {
			if (kk[j] > 0)
				tt[j] += (double) (xx[rr[j]] - xx[ll[j] + 1]) * (yy[j] - (pp[j] == -1 ? 0 : yy[pp[j]])) / kk[j];
			dd[j] = -1, kk[pp[j]] += kk[j], tt[pp[j]] = max(tt[pp[j]], tt[j]), dd[pp[j]]--, j = pp[j];
		}
	}
	for (i = 0; i < n; i++)
		if (pp[i] == -1) {
			printf("%.2f\n", tt[i]);
			break;
		}
	area = 0;
	for (i = 0; i < n; i++)
	 	if (kk[i] == 0)
			area += (long long) (xx[rr[i]] - xx[ll[i] + 1]) * (yy[i] - (pp[i] == -1 ? 0 : yy[pp[i]]));
	printf("%lld\n", area);
	return 0;
}

Compilation message

aqua2.c: In function 'main':
aqua2.c:33:37: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   33 |   pp[i] = rr[i] == n || ll[i] != -1 && yy[ll[i]] > yy[rr[i]] ? ll[i] : rr[i];
      |                         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
aqua2.c:13:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |  scanf("%d%*d%*d", &n), n = n / 2 - 1;
      |  ^~~~~~~~~~~~~~~~~~~~~
aqua2.c:16:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |   scanf("%*d%*d%d%d", &xx[i + 1], &yy[i]);
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
aqua2.c:17:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |  scanf("%*d%*d");
      |  ^~~~~~~~~~~~~~~
aqua2.c:37:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |  scanf("%d", &k);
      |  ^~~~~~~~~~~~~~~
aqua2.c:39:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |   scanf("%d%*d%*d%*d", &x);
      |   ^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4532 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4536 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4552 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 1 ms 4600 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 3 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 3 ms 4648 KB Output is correct
9 Correct 2 ms 4444 KB Output is correct
10 Correct 2 ms 4600 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 5972 KB Output is correct
2 Correct 66 ms 11544 KB Output is correct
3 Correct 84 ms 13060 KB Output is correct
4 Correct 72 ms 12372 KB Output is correct
5 Correct 79 ms 13064 KB Output is correct
6 Correct 44 ms 10320 KB Output is correct
7 Correct 87 ms 13140 KB Output is correct
8 Correct 46 ms 10748 KB Output is correct
9 Correct 80 ms 12628 KB Output is correct
10 Correct 68 ms 12112 KB Output is correct