oj.uz

Submission #721016

# Submission time Handle Problem Language Result Execution time Memory
721016 2023-04-10T05:28:31 Z Radin_Zahedi2 Virus Experiment (JOI19_virus) C++17
100 / 100
 472 ms 78104 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (int)x.size()
#define endl '\n'
const int inf = 1e9;

int m, r, c;
const int R = 8e2 + 5;
const int dire[4][2] = {{-1, 0}, {0, 1}, {0, -1}, {1, 0}};
string s;
int u[R][R];

int give[16];

pair<int, int> bel[R][R];

pair<int, int> par[R][R];
int len[R][R];

int inted(char c) {
	if (c == 'N') {
		return 0;
	}
	if (c == 'E') {
		return 1;
	}
	if (c == 'W') {
		return 2;
	}

	return 3;
}

pair<int, int> get(pair<int, int> u) {
	if (par[u.fi][u.se] == u) {
		return u;
	}

	par[u.fi][u.se] = get(par[u.fi][u.se]);
	return par[u.fi][u.se];
}

void unio(pair<int, int> u, pair<int, int> v) {
	pair<int, int> p1 = get(u), p2 = get(v);
	if (p1 == p2) {
		return;
	}

	if (len[p1.fi][p1.se] < len[p2.fi][p2.se]) {
		swap(p1, p2);
	}


	len[p1.fi][p1.se] += len[p2.fi][p2.se];
	par[p2.fi][p2.se] = p1;
}

void input() {
	cin >> m >> r >> c;
	cin >> s;

	for (int i = 1; i <= r; i++) {
		for (int j = 1; j <= c; j++) {
			cin >> u[i][j];
		}
	}
}

void cregive() {
	for (int mask = 0; mask < 16; mask++) {
		vector<int> inds;
		
		for (int i = 0; i < m; i++) {
			if (!((mask >> inted(s[i])) & 1)) {
				inds.pb(i);
			}
		}

		if (inds.empty()) {
			give[mask] = inf;
			continue;
		}
		
		for (int i = 0; i < sz(inds) - 1; i++) {
			give[mask] = max(give[mask], inds[i + 1] - inds[i] - 1);
		}
		give[mask] = max(give[mask], inds[0] + m - inds.back() - 1);
	}
}

bool can(int x, int y, int x0, int y0) {
	if (!u[x][y]) {
		return false;
	}

	int mask = 0;
	for (int d = 0; d < 4; d++) {
		if (bel[x + dire[d][0]][y + dire[d][1]] == mp(x0, y0)) {
			mask |= (1 << d);
		}
	}

	return (give[mask] >= u[x][y]);
}

pair<int, int> bfs() {
	vector<pair<int, int>> cands[r + 1][c + 1];

	vector<pair<int, int>> q;
	for (int i = 1; i <= r; i++) {
		for (int j = 1; j <= c; j++) {
			if (u[i][j]) {
				bel[i][j] = mp(i, j);
				par[i][j] = mp(i, j);
				len[i][j] = 1;

				cands[i][j].pb(mp(i, j));

				q.pb(mp(i, j));
			}
		}
	}

	vector<pair<int, int>> actis;
	for (int i = 1; i <= r; i++) {
		for (int j = 1; j <= c; j++) {
			if (u[i][j]) {
				actis.pb(mp(i, j));
			}
		}
	}


	int result;
	for (int m = 1; m <= r * c + 1; m++) {
		bool done = false;
		for (auto p : actis) {
			if (cands[p.fi][p.se].empty()) {
				done = true;
				break;
			}
		}
		if (done) {
			result = m - 1;
			break;
		}


		vector<pair<int, int>> nactis;
		for (auto p : actis) {
			pair<int, int> pc = cands[p.fi][p.se].back();

			if (get(pc) != get(p)) {
				cands[p.fi][p.se].clear();
				unio(pc, p);
				continue;
			}
			else {
				nactis.pb(p);
			}
		}

		actis = nactis;

		for (auto p : actis) {
			pair<int, int> pc = cands[p.fi][p.se].back();
			cands[p.fi][p.se].pop_back();
			int x = pc.fi;
			int y = pc.se;


			for (int d = 0; d < 4; d++) {
				int x2 = x + dire[d][0];
				int y2 = y + dire[d][1];

				if (bel[x2][y2] == p) {
					continue;
				}

				
				bel[x][y] = mp(0, 0);
				bool bef = can(x2, y2, p.fi, p.se);
				bel[x][y] = p;
				bool now = can(x2, y2, p.fi, p.se);

				if (!bef && now) {
					cands[p.fi][p.se].pb(mp(x2, y2));
				}
			}
		}
	}


	int t = 0;
	for (auto p : actis) {
		if (cands[p.fi][p.se].empty()) {
			t++;
		}
	}

	return mp(result, t);
}

void solve() {
	cregive();

	pair<int, int> ans = bfs();

	cout << ans.fi << endl << ans.fi * ans.se;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);


	input();

	solve();

	return 0;
}

Compilation message

virus.cpp: In function 'std::pair<int, int> bfs()':
virus.cpp:138:6: warning: 'result' may be used uninitialized in this function [-Wmaybe-uninitialized]
  138 |  int result;
      |      ^~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 980 KB Output is correct
2 Correct 162 ms 74408 KB Output is correct
3 Correct 172 ms 76400 KB Output is correct
4 Correct 154 ms 74132 KB Output is correct
5 Correct 178 ms 76624 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 339 ms 74356 KB Output is correct
8 Correct 87 ms 30972 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 8 ms 1520 KB Output is correct
3 Correct 16 ms 1440 KB Output is correct
4 Correct 8 ms 1536 KB Output is correct
5 Correct 16 ms 1404 KB Output is correct
6 Correct 18 ms 1872 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 16 ms 1768 KB Output is correct
9 Correct 2 ms 1236 KB Output is correct
10 Correct 8 ms 1536 KB Output is correct
11 Correct 1 ms 1232 KB Output is correct
12 Correct 2 ms 1364 KB Output is correct
13 Correct 17 ms 1792 KB Output is correct
14 Correct 16 ms 1804 KB Output is correct
15 Correct 17 ms 1764 KB Output is correct
16 Correct 16 ms 1716 KB Output is correct
17 Correct 9 ms 1500 KB Output is correct
18 Correct 3 ms 1364 KB Output is correct
19 Correct 17 ms 1860 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 980 KB Output is correct
2 Correct 162 ms 74408 KB Output is correct
3 Correct 172 ms 76400 KB Output is correct
4 Correct 154 ms 74132 KB Output is correct
5 Correct 178 ms 76624 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 339 ms 74356 KB Output is correct
8 Correct 87 ms 30972 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 8 ms 1520 KB Output is correct
11 Correct 16 ms 1440 KB Output is correct
12 Correct 8 ms 1536 KB Output is correct
13 Correct 16 ms 1404 KB Output is correct
14 Correct 18 ms 1872 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 16 ms 1768 KB Output is correct
17 Correct 2 ms 1236 KB Output is correct
18 Correct 8 ms 1536 KB Output is correct
19 Correct 1 ms 1232 KB Output is correct
20 Correct 2 ms 1364 KB Output is correct
21 Correct 17 ms 1792 KB Output is correct
22 Correct 16 ms 1804 KB Output is correct
23 Correct 17 ms 1764 KB Output is correct
24 Correct 16 ms 1716 KB Output is correct
25 Correct 9 ms 1500 KB Output is correct
26 Correct 3 ms 1364 KB Output is correct
27 Correct 17 ms 1860 KB Output is correct
28 Correct 360 ms 77164 KB Output is correct
29 Correct 272 ms 77104 KB Output is correct
30 Correct 284 ms 77196 KB Output is correct
31 Correct 320 ms 71228 KB Output is correct
32 Correct 289 ms 72408 KB Output is correct
33 Correct 163 ms 74188 KB Output is correct
34 Correct 441 ms 77292 KB Output is correct
35 Correct 251 ms 59084 KB Output is correct
36 Correct 472 ms 76172 KB Output is correct
37 Correct 353 ms 76168 KB Output is correct
38 Correct 341 ms 78104 KB Output is correct
39 Correct 239 ms 74440 KB Output is correct
40 Correct 290 ms 74684 KB Output is correct
41 Correct 165 ms 71660 KB Output is correct
42 Correct 192 ms 62244 KB Output is correct
43 Correct 248 ms 76620 KB Output is correct
44 Correct 81 ms 30976 KB Output is correct