oj.uz

Submission #340182

# Submission time Handle Problem Language Result Execution time Memory
340182 2020-12-27T09:02:57 Z lohacho Sandwich (JOI16_sandwich) C++14
35 / 100
 8000 ms 16084 KB 
#include <bits/stdc++.h>

using namespace std;

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int N, M;
	cin >> N >> M;
	vector<string> a(N);
	for(int i = 0; i < N; ++i){
		cin >> a[i];
	}
	vector<vector<int>> chk(N, vector<int>(M, 0));
	vector<vector<int>> ans(N, vector<int>(M, (int)1e9));
	vector<int> NN = {0, 0, 1, 1}, ZZ = {0, 1, 1, 0};
	vector<int> wx = {-1, 0, 1, 0}, wy = {0, 1, 0, -1};
	function<int(int, int, int)> dfs = [&](int x, int y, int dir){
		if(chk[x][y] == 1){
			return (int)1e9;
		}
		if(chk[x][y] == 2){
			return 0;
		}
		int rv = 1;
		chk[x][y] = 1;
		for(int i = 0; i < 4; ++i){
			if((a[x][y] == 'N' && NN[i] == dir) || (a[x][y] == 'Z' && ZZ[i] == dir)){
				int nx = x + wx[i], ny = y + wy[i];
				if(nx >= 0 && ny >= 0 && nx < N && ny < M){
					if(a[nx][ny] == 'N'){
						rv += dfs(nx, ny, NN[i]);
						rv = min(rv, (int)1e9);
					}
					else{
						rv += dfs(nx, ny, ZZ[i]);
						rv = min(rv, (int)1e9);
					}
				}
			}
		}
		chk[x][y] = 2;
		return rv;
	};
	for(int j = 0; j < M; ++j){
		chk = vector<vector<int>>(N, vector<int>(M, 0));
		int sum = 0;
		for(int i = 0; i < N; ++i){
			sum += dfs(i, j, 0);
			if(sum > (int)1e9){
				break;
			}
			ans[i][j] = min(sum * 2, ans[i][j]);
		}
		chk = vector<vector<int>>(N, vector<int>(M, 0));
		sum = 0;
		for(int i = N - 1; i >= 0; --i){
			sum += dfs(i, j, 1);
			if(sum > (int)1e9){
				break;
			}
			ans[i][j] = min(sum * 2, ans[i][j]);
		}
	}
	for(int i = 0; i < N; ++i){
		for(int j = 0; j < M; ++j){
			if(ans[i][j] == (int)1e9){
				ans[i][j] = -1;
			}
			cout << ans[i][j] << ' ';
		}
		cout << '\n';
	}
	return 0;
}

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 17 ms 620 KB Output is correct
7 Correct 9 ms 364 KB Output is correct
8 Correct 9 ms 364 KB Output is correct
9 Correct 5 ms 364 KB Output is correct
10 Correct 10 ms 364 KB Output is correct
11 Correct 9 ms 364 KB Output is correct
12 Correct 5 ms 492 KB Output is correct
13 Correct 9 ms 492 KB Output is correct
14 Correct 10 ms 492 KB Output is correct
15 Correct 6 ms 364 KB Output is correct
16 Correct 5 ms 364 KB Output is correct
17 Correct 5 ms 364 KB Output is correct
18 Correct 5 ms 364 KB Output is correct
19 Correct 6 ms 364 KB Output is correct
20 Correct 6 ms 364 KB Output is correct
21 Correct 5 ms 364 KB Output is correct
22 Correct 5 ms 364 KB Output is correct
23 Correct 6 ms 364 KB Output is correct
24 Correct 12 ms 492 KB Output is correct
25 Correct 12 ms 492 KB Output is correct
26 Correct 10 ms 492 KB Output is correct
27 Correct 12 ms 364 KB Output is correct
28 Correct 11 ms 364 KB Output is correct

Subtask #2
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 17 ms 620 KB Output is correct
7 Correct 9 ms 364 KB Output is correct
8 Correct 9 ms 364 KB Output is correct
9 Correct 5 ms 364 KB Output is correct
10 Correct 10 ms 364 KB Output is correct
11 Correct 9 ms 364 KB Output is correct
12 Correct 5 ms 492 KB Output is correct
13 Correct 9 ms 492 KB Output is correct
14 Correct 10 ms 492 KB Output is correct
15 Correct 6 ms 364 KB Output is correct
16 Correct 5 ms 364 KB Output is correct
17 Correct 5 ms 364 KB Output is correct
18 Correct 5 ms 364 KB Output is correct
19 Correct 6 ms 364 KB Output is correct
20 Correct 6 ms 364 KB Output is correct
21 Correct 5 ms 364 KB Output is correct
22 Correct 5 ms 364 KB Output is correct
23 Correct 6 ms 364 KB Output is correct
24 Correct 12 ms 492 KB Output is correct
25 Correct 12 ms 492 KB Output is correct
26 Correct 10 ms 492 KB Output is correct
27 Correct 12 ms 364 KB Output is correct
28 Correct 11 ms 364 KB Output is correct
29 Correct 8 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Execution timed out 8045 ms 16084 KB Time limit exceeded
32 Halted 0 ms 0 KB -