oj.uz

답안 #227471

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
227471 2020-04-27T13:52:45 Z wilwxk 바이러스 (JOI19_virus) C++14
100 / 100
 687 ms 24272 KB 
#include <bits/stdc++.h>
using namespace std;
 
const int MAXN = 805;
char comb[212345];
int sick[20];
int resis[MAXN][MAXN];
int marc[MAXN][MAXN];
bool checked[MAXN][MAXN];
vector<pair<int, int> > perm;
int x, n, m;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int dc[] = {'E', 'S', 'W', 'N'};
int ans, ans2;
 
void calc_comb() {
	for(int i = x+1; i <= x+x; i++) comb[i] = comb[i-x];
 
	for(int mask = 0; mask < (1<<4); mask++) {
		int mx = 0, cnt = 0;
		for(int i = 1; i <= x+x; i++) {
			bool ok = 0;
			for(int k = 0; k < 4; k++) {
				if(((1<<k)&mask) && dc[k] == comb[i]) {
					ok = 1;
					cnt++;
				}
			}
			mx = max(mx, cnt);
			if(!ok) cnt = 0;
		}
		if(mx == x+x) mx = 1e6;
		sick[mask] = mx;
		// printf("mask[%d] -> %d\n", mask, mx);
	}
}
 
bool isvalid(int i, int j) {
	if(i < 1 || i > n) return 0;
	if(j < 1 || j > m) return 0;
	return 1;
}
 
int bfs(int ox, int oy) {
	int cnt = 0;
 
	vector<pair<int, int> > qu;
	qu.push_back({ox, oy});
	int p = 0;
 
	while(p < qu.size()) {
		int ux, uy;
		tie(ux, uy) = qu[p++];
		if(marc[ux][uy] == 1) continue;
		marc[ux][uy] = 1;
		cnt++;
		if(cnt > ans) {
			for(auto cur : qu) marc[cur.first][cur.second] = 0;
			return -1;
		} 
		for(int k = 0; k < 4; k++) {
			int vx = ux + dx[k];
			int vy = uy + dy[k];
			if(!isvalid(vx, vy)) continue;
			if(marc[vx][vy] || resis[vx][vy] == 0) continue;
 
			int mask = 0;
			for(int k2 = 0; k2 < 4; k2++) {
				int vx2 = vx + dx[k2];
				int vy2 = vy + dy[k2];
				if(!isvalid(vx2, vy2)) continue;
				if(marc[vx2][vy2]) mask |= (1<<k2);
			}
 
			if(sick[mask] >= resis[vx][vy]) {
				// printf("  add %d %d - %d\n", vx, vy, mask);
				if(checked[vx][vy]) {
					for(auto cur : qu) marc[cur.first][cur.second] = 0;
					return -1;
				}
				marc[vx][vy] = 2;
				qu.push_back({vx, vy});
			}
		}
	}
 
	for(auto cur : qu) marc[cur.first][cur.second] = 0;
 
	return cnt;
}
 
int main() {
	scanf("%d %d %d", &x, &n, &m);
	ans = n*m;
	scanf(" %s", &comb[1]);
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= m; j++) {
			scanf("%d", &resis[i][j]);
			perm.push_back({i, j});
		}
	}
 
	calc_comb();
 
	srand(time(0));
	random_shuffle(perm.begin(), perm.end());
	for(auto cur : perm) {
		int cx, cy;
		tie(cx, cy) = cur;
		checked[cx][cy] = 1;
		if(resis[cx][cy] == 0) continue;
		int val = bfs(cx, cy);
 
		// printf("%d %d >>> %d\n", cx, cy, val);
		if(val == -1) continue;
		if(val < ans) {
			ans = val;
			ans2 = 0;
		}
		if(val == ans) ans2 += ans;
	}
 
	printf("%d\n%d\n", ans, ans2);
}

Compilation message

virus.cpp: In function 'int bfs(int, int)':
virus.cpp:52:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(p < qu.size()) {
        ~~^~~~~~~~~~~
virus.cpp: In function 'int main()':
virus.cpp:94:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d", &x, &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
virus.cpp:96:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf(" %s", &comb[1]);
  ~~~~~^~~~~~~~~~~~~~~~~
virus.cpp:99:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &resis[i][j]);
    ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 512 KB Output is correct
2 Correct 256 ms 12496 KB Output is correct
3 Correct 327 ms 14680 KB Output is correct
4 Correct 253 ms 12368 KB Output is correct
5 Correct 343 ms 14904 KB Output is correct
6 Correct 9 ms 4864 KB Output is correct
7 Correct 582 ms 12624 KB Output is correct
8 Correct 109 ms 7652 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 416 KB Output is correct
2 Correct 20 ms 640 KB Output is correct
3 Correct 40 ms 760 KB Output is correct
4 Correct 23 ms 640 KB Output is correct
5 Correct 42 ms 640 KB Output is correct
6 Correct 47 ms 1020 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 39 ms 1016 KB Output is correct
9 Correct 7 ms 768 KB Output is correct
10 Correct 23 ms 640 KB Output is correct
11 Correct 6 ms 768 KB Output is correct
12 Correct 7 ms 768 KB Output is correct
13 Correct 39 ms 1016 KB Output is correct
14 Correct 38 ms 1016 KB Output is correct
15 Correct 39 ms 1016 KB Output is correct
16 Correct 39 ms 1016 KB Output is correct
17 Correct 23 ms 896 KB Output is correct
18 Correct 7 ms 768 KB Output is correct
19 Correct 40 ms 1016 KB Output is correct

Subtask #3
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 512 KB Output is correct
2 Correct 256 ms 12496 KB Output is correct
3 Correct 327 ms 14680 KB Output is correct
4 Correct 253 ms 12368 KB Output is correct
5 Correct 343 ms 14904 KB Output is correct
6 Correct 9 ms 4864 KB Output is correct
7 Correct 582 ms 12624 KB Output is correct
8 Correct 109 ms 7652 KB Output is correct
9 Correct 5 ms 416 KB Output is correct
10 Correct 20 ms 640 KB Output is correct
11 Correct 40 ms 760 KB Output is correct
12 Correct 23 ms 640 KB Output is correct
13 Correct 42 ms 640 KB Output is correct
14 Correct 47 ms 1020 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 39 ms 1016 KB Output is correct
17 Correct 7 ms 768 KB Output is correct
18 Correct 23 ms 640 KB Output is correct
19 Correct 6 ms 768 KB Output is correct
20 Correct 7 ms 768 KB Output is correct
21 Correct 39 ms 1016 KB Output is correct
22 Correct 38 ms 1016 KB Output is correct
23 Correct 39 ms 1016 KB Output is correct
24 Correct 39 ms 1016 KB Output is correct
25 Correct 23 ms 896 KB Output is correct
26 Correct 7 ms 768 KB Output is correct
27 Correct 40 ms 1016 KB Output is correct
28 Correct 579 ms 24272 KB Output is correct
29 Correct 655 ms 24272 KB Output is correct
30 Correct 540 ms 24272 KB Output is correct
31 Correct 384 ms 12368 KB Output is correct
32 Correct 404 ms 13992 KB Output is correct
33 Correct 366 ms 12472 KB Output is correct
34 Correct 687 ms 24016 KB Output is correct
35 Correct 456 ms 15068 KB Output is correct
36 Correct 531 ms 12752 KB Output is correct
37 Correct 686 ms 16336 KB Output is correct
38 Correct 617 ms 24140 KB Output is correct
39 Correct 354 ms 13648 KB Output is correct
40 Correct 375 ms 13648 KB Output is correct
41 Correct 253 ms 12600 KB Output is correct
42 Correct 404 ms 19296 KB Output is correct
43 Correct 327 ms 16484 KB Output is correct
44 Correct 119 ms 7656 KB Output is correct