Submission #656415

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
656415	2022-11-07T11:33:08 Z	Dorost	T-Covering (eJOI19_covering)	C++17	100 / 100	152 ms	102400 KB

covering

/* 	* In the name of GOD  */

#include "bits/stdc++.h"

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
#define F first
#define S second
#define mk make_pair
const int N = 1012345, NI = -1123456789;
int n, m, k, ans = 0, t = 0;
vector <int> a[N];
vector <bool> mr[N];
int vis[N];
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1}, dx2[4] = {-1, 1, 1, -1}, dy2[4] = {1, 1, -1, -1}, bad[N], mn[N], ch[N];
vector <int> g[N];

bool val (int x, int y) {
	return ((x >= 1) && (y >= 1) && (x <= n) && (y <= m));
}

int h(int x, int y) {
	return (x - 1) * m + y;
}

void hal (int x, int y, int d) {
	mr[x][y] = false;
	ans += a[x][y];
	a[x][y] = NI;
	for (int i = 0; i < 4; i++) {
		if (i == d)
			continue;
		ans += a[x + dx[i]][y + dy[i]];
		a[x + dx[i]][y + dy[i]] = NI;
	}
}

void dfs (int v, int p) {
	vis[v] = 1;
	int x = (v - 1) / m + 1, y = (v - 1) % m + 1;
	for (int i = 0; i < 4; i++) 
		mn[t] = min(a[x + dx[i]][y + dy[i]], mn[t]);
	for (int u : g[v]) {
		if (u == p)
			continue;
		if (!vis[u])
			dfs(u, v);
		else if (vis[u] == 1) { 
			bad[t]++;
		}
	}
	vis[v] = 2;
}

int32_t main() {
	ios::sync_with_stdio(false);
	cin.tie();
	cout.tie();
	cin >> n >> m;
	for (int i = 0; i < n + 5; i++)
		for (int j = 0; j < m + 5; j++) {
			mr[i].push_back(false);
			a[i].push_back(NI);
		}
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			cin >> a[i][j];
	cin >> k;
	for (int i = 1; i <= k; i++) {
		int x, y;
		cin >> x >> y;
		x++;
		y++;
		mr[x][y] = true;
	}
	for (int x = 1; x <= n; x++) {
		for (int y = 1; y <= m; y++) {
			for (int i = 0; i < 4; i++) {
				if (mr[x][y] && mr[x + dx[i]][y + dy[i]]) {
					hal (x, y, i);
					hal (x + dx[i], y + dy[i], (i + 2) & 3);
				}
				if (mr[x][y] && mr[x + dx2[i]][y + dy2[i]]) {
					hal (x, y, i);
					hal (x + dx2[i], y + dy2[i], (i + 2) & 3);
				}
			}
		}
	}
	for (int x = 1; x <= n; x++) 
		for (int y = 1; y <= m; y++) {
			if (!mr[x][y])
				continue;
			ans += a[x][y];
			for (int i = 0; i < 4; i++) {
				ans += a[x + dx[i]][y + dy[i]];
			}
		}
	for (int x = 1; x <= n; x++) {
		for (int y = 1; y <= m; y++) {
			for (int i = 0; i < 2; i++) {
				if (val(x + 2 * dx[i], y + 2 * dy[i]) && mr[x][y] && mr[x + 2 * dx[i]][y + 2 * dy[i]]) {
					int l = h(x, y);
					int r = h(x + 2 * dx[i], y + 2 * dy[i]);
					ans -= a[x + dx[i]][y + dy[i]];
					g[l].push_back(r);
					g[r].push_back(l);
				}
			}
		}
	}
	for (int x = 1; x <= n; x++) {
		for (int y = 1; y <= m; y++) {
			if (!mr[x][y]) {
				continue;
			}
			int v = h(x, y);
			if (vis[v])
				continue;
			++t;
			mn[t] = -NI;
			dfs(v, v);
			if (bad[t] > 1) {
				cout << "No";
				exit(0);
			}
			if (bad[t] == 0)
				ans -= mn[t];
		}
	}
	if (ans < 0) {
		cout << "No";
	} else {
		cout << ans;
	}
}

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	39 ms	87532 KB	Output is correct
2	Correct	48 ms	87876 KB	Output is correct
3	Correct	47 ms	88652 KB	Output is correct
4	Correct	61 ms	91200 KB	Output is correct
5	Correct	118 ms	97996 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	43 ms	87516 KB	Output is correct
2	Correct	42 ms	87868 KB	Output is correct
3	Correct	47 ms	88572 KB	Output is correct
4	Correct	63 ms	91104 KB	Output is correct
5	Correct	119 ms	97936 KB	Output is correct

Subtask #3

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	41 ms	87640 KB	Output is correct
2	Correct	44 ms	87756 KB	Output is correct
3	Correct	48 ms	88448 KB	Output is correct
4	Correct	66 ms	91184 KB	Output is correct
5	Correct	122 ms	97932 KB	Output is correct

Subtask #4

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	39 ms	87408 KB	Output is correct
2	Correct	39 ms	87496 KB	Output is correct
3	Correct	44 ms	88124 KB	Output is correct
4	Correct	43 ms	87868 KB	Output is correct
5	Correct	50 ms	88648 KB	Output is correct

Subtask #5

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	43 ms	87500 KB	Output is correct
2	Correct	42 ms	87496 KB	Output is correct
3	Correct	40 ms	87556 KB	Output is correct
4	Correct	40 ms	87480 KB	Output is correct
5	Correct	40 ms	87500 KB	Output is correct

Subtask #6

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	39 ms	87532 KB	Output is correct
2	Correct	48 ms	87876 KB	Output is correct
3	Correct	47 ms	88652 KB	Output is correct
4	Correct	61 ms	91200 KB	Output is correct
5	Correct	118 ms	97996 KB	Output is correct
6	Correct	43 ms	87516 KB	Output is correct
7	Correct	42 ms	87868 KB	Output is correct
8	Correct	47 ms	88572 KB	Output is correct
9	Correct	63 ms	91104 KB	Output is correct
10	Correct	119 ms	97936 KB	Output is correct
11	Correct	41 ms	87640 KB	Output is correct
12	Correct	44 ms	87756 KB	Output is correct
13	Correct	48 ms	88448 KB	Output is correct
14	Correct	66 ms	91184 KB	Output is correct
15	Correct	122 ms	97932 KB	Output is correct
16	Correct	39 ms	87408 KB	Output is correct
17	Correct	39 ms	87496 KB	Output is correct
18	Correct	44 ms	88124 KB	Output is correct
19	Correct	43 ms	87868 KB	Output is correct
20	Correct	50 ms	88648 KB	Output is correct
21	Correct	44 ms	87548 KB	Output is correct
22	Correct	44 ms	87788 KB	Output is correct
23	Correct	48 ms	88672 KB	Output is correct
24	Correct	63 ms	91108 KB	Output is correct
25	Correct	117 ms	97932 KB	Output is correct

Subtask #7

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	39 ms	87532 KB	Output is correct
2	Correct	48 ms	87876 KB	Output is correct
3	Correct	47 ms	88652 KB	Output is correct
4	Correct	61 ms	91200 KB	Output is correct
5	Correct	118 ms	97996 KB	Output is correct
6	Correct	43 ms	87516 KB	Output is correct
7	Correct	42 ms	87868 KB	Output is correct
8	Correct	47 ms	88572 KB	Output is correct
9	Correct	63 ms	91104 KB	Output is correct
10	Correct	119 ms	97936 KB	Output is correct
11	Correct	41 ms	87640 KB	Output is correct
12	Correct	44 ms	87756 KB	Output is correct
13	Correct	48 ms	88448 KB	Output is correct
14	Correct	66 ms	91184 KB	Output is correct
15	Correct	122 ms	97932 KB	Output is correct
16	Correct	39 ms	87408 KB	Output is correct
17	Correct	39 ms	87496 KB	Output is correct
18	Correct	44 ms	88124 KB	Output is correct
19	Correct	43 ms	87868 KB	Output is correct
20	Correct	50 ms	88648 KB	Output is correct
21	Correct	43 ms	87500 KB	Output is correct
22	Correct	42 ms	87496 KB	Output is correct
23	Correct	40 ms	87556 KB	Output is correct
24	Correct	40 ms	87480 KB	Output is correct
25	Correct	40 ms	87500 KB	Output is correct
26	Correct	44 ms	87548 KB	Output is correct
27	Correct	44 ms	87788 KB	Output is correct
28	Correct	48 ms	88672 KB	Output is correct
29	Correct	63 ms	91108 KB	Output is correct
30	Correct	117 ms	97932 KB	Output is correct
31	Correct	152 ms	102400 KB	Output is correct
32	Correct	116 ms	98060 KB	Output is correct
33	Correct	126 ms	102084 KB	Output is correct
34	Correct	124 ms	97608 KB	Output is correct
35	Correct	134 ms	102400 KB	Output is correct