oj.uz

Submission #703255

# Submission time Handle Problem Language Result Execution time Memory
703255 2023-02-26T18:54:22 Z rainboy T-Covering (eJOI19_covering) C
100 / 100
 111 ms 32772 KB 
#include <stdio.h>
#include <string.h>

#define NM	1000000
#define INF	0x3f3f3f3f

int min(int a, int b) { return a < b ? a : b; }

int di[] = { -1, 1, 0, 0 };
int dj[] = { 0, 0, -1, 1 };

int ds[NM], vv[NM], ee[NM], ww[NM];

int find(int i) {
	return ds[i] < 0 ? i : (ds[i] = find(ds[i]));
}

void join(int i, int j) {
	i = find(i);
	j = find(j);
	if (i == j) {
		ee[i]++;
		return;
	}
	if (ds[i] > ds[j])
		ds[i] = j, vv[j] += vv[i], ee[j] += ee[i] + 1, ww[j] = min(ww[j], ww[i]);
	else {
		if (ds[i] == ds[j])
			ds[i]--;
		ds[j] = i, vv[i] += vv[j], ee[i] += ee[j] + 1, ww[i] = min(ww[i], ww[j]);
	}
}

int main() {
	static int aa[NM], ej[NM][2], eo[NM];
	static char special[NM];
	int n, m, nm, k, h, i, j, ij;
	long long ans;

	scanf("%d%d", &n, &m), nm = n * m;
	for (i = 0; i < nm; i++)
		scanf("%d", &aa[i]);
	scanf("%d", &k);
	memset(ww, 0x3f, nm * sizeof *ww);
	ans = 0;
	while (k--) {
		scanf("%d%d", &i, &j), ij = i * m + j;
		ans += aa[ij];
		special[ij] = 1;
		aa[ij] = -INF;
	}
	for (ij = 0; ij < nm; ij++)
		if (special[ij]) {
			i = ij / m, j = ij % m;
			for (h = 0; h < 4; h++) {
				int i_ = i + di[h], j_ = j + dj[h], ij_ = i_ * m + j_;

				if (i_ >= 0 && i_ < n && j_ >= 0 && j_ < m) {
					if (eo[ij_] == 2) {
						printf("No\n");
						return 0;
					}
					ej[ij_][eo[ij_]++] = ij;
					ans += aa[ij_];
					ww[ij] = min(ww[ij], aa[ij_]);
				} else {
					ans += -INF;
					ww[ij] = -INF;
				}
			}
		}
	memset(ds, -1, nm * sizeof *ds);
	for (i = 0; i < nm; i++)
		vv[i] = 1;
	for (i = 0; i < nm; i++)
		if (eo[i] == 2)
			join(ej[i][0], ej[i][1]), ans -= aa[i];
	for (i = 0; i < nm; i++)
		if (ds[i] < 0) {
			if (vv[i] < ee[i]) {
				printf("No\n");
				return 0;
			}
			if (vv[i] > ee[i] && ww[i] != INF)
				ans -= ww[i];
		}
	if (ans < 0) {
		printf("No\n");
		return 0;
	}
	printf("%lld\n", ans);
	return 0;
}

Compilation message

covering.c: In function 'main':
covering.c:40:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |  scanf("%d%d", &n, &m), nm = n * m;
      |  ^~~~~~~~~~~~~~~~~~~~~
covering.c:42:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |   scanf("%d", &aa[i]);
      |   ^~~~~~~~~~~~~~~~~~~
covering.c:43:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |  scanf("%d", &k);
      |  ^~~~~~~~~~~~~~~
covering.c:47:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |   scanf("%d%d", &i, &j), ij = i * m + j;
      |   ^~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 3 ms 1076 KB Output is correct
3 Correct 8 ms 3028 KB Output is correct
4 Correct 29 ms 8500 KB Output is correct
5 Correct 79 ms 26624 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 3 ms 980 KB Output is correct
3 Correct 8 ms 3284 KB Output is correct
4 Correct 25 ms 9624 KB Output is correct
5 Correct 84 ms 30592 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 8 ms 3324 KB Output is correct
4 Correct 24 ms 9524 KB Output is correct
5 Correct 82 ms 30376 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 4 ms 1236 KB Output is correct
4 Correct 4 ms 852 KB Output is correct
5 Correct 9 ms 2260 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 3 ms 1076 KB Output is correct
3 Correct 8 ms 3028 KB Output is correct
4 Correct 29 ms 8500 KB Output is correct
5 Correct 79 ms 26624 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 3 ms 980 KB Output is correct
8 Correct 8 ms 3284 KB Output is correct
9 Correct 25 ms 9624 KB Output is correct
10 Correct 84 ms 30592 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 1108 KB Output is correct
13 Correct 8 ms 3324 KB Output is correct
14 Correct 24 ms 9524 KB Output is correct
15 Correct 82 ms 30376 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 4 ms 1236 KB Output is correct
19 Correct 4 ms 852 KB Output is correct
20 Correct 9 ms 2260 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 3 ms 1208 KB Output is correct
23 Correct 9 ms 3460 KB Output is correct
24 Correct 29 ms 9548 KB Output is correct
25 Correct 87 ms 30712 KB Output is correct

Subtask #7
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 3 ms 1076 KB Output is correct
3 Correct 8 ms 3028 KB Output is correct
4 Correct 29 ms 8500 KB Output is correct
5 Correct 79 ms 26624 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 3 ms 980 KB Output is correct
8 Correct 8 ms 3284 KB Output is correct
9 Correct 25 ms 9624 KB Output is correct
10 Correct 84 ms 30592 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 1108 KB Output is correct
13 Correct 8 ms 3324 KB Output is correct
14 Correct 24 ms 9524 KB Output is correct
15 Correct 82 ms 30376 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 4 ms 1236 KB Output is correct
19 Correct 4 ms 852 KB Output is correct
20 Correct 9 ms 2260 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 3 ms 1208 KB Output is correct
28 Correct 9 ms 3460 KB Output is correct
29 Correct 29 ms 9548 KB Output is correct
30 Correct 87 ms 30712 KB Output is correct
31 Correct 111 ms 30840 KB Output is correct
32 Correct 80 ms 23980 KB Output is correct
33 Correct 83 ms 31904 KB Output is correct
34 Correct 80 ms 23676 KB Output is correct
35 Correct 96 ms 32772 KB Output is correct