oj.uz

Submission #464690

# Submission time Handle Problem Language Result Execution time Memory
464690 2021-08-13T17:01:48 Z Hamed5001 Strah (COCI18_strah) C++14
55 / 110
 1000 ms 69856 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

/*
	dp[i][j] = potential value in range (i, j) -> (N, M);
	dp[i][j] = dp[i+1][j] + dp[i][j+1] - dp[i+1][j+1] + (sum())
*/

const int mxN = 2e3+10;
ll N, M;
char land[mxN][mxN]; 
ll cum[mxN][mxN];

ll maxLen(int i, int ii, int j) {
	int l = j, r = M, mid;

	while(l < r) {
		mid = (l + r + 1) >> 1;
		if ((cum[ii][mid] + cum[i-1][j-1] - cum[ii][j-1] - cum[i-1][mid]) == 0) l = mid;
		else r = mid - 1;
	}

	return l - j + 1;
}

ll calc(int i, int j) {
	ll ret = 0;
	if (land[i][j] == '#')
		return ret;
	for (ll ii = i; ii <= N && land[ii][j] != '#'; ii++) {
		ll len = maxLen(i, ii, j);
		ret += (len*(len+1)/2) * (ii-i+1);
	}

	return ret;
}

void solve() {
	cin >> N >> M;
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= M; j++) {
			cin >> land[i][j];
			cum[i][j] = ((land[i][j] == '#') + cum[i-1][j] + cum[i][j-1] - cum[i-1][j-1]);
		}
	}

	

	vector<vector<ll>> dp(mxN, vector<ll>(mxN, 0));
	dp[N][M] = (land[N][M] != '#');

	for (int i = N; i; i--) {
		for (int j = M; j; j--) {
			dp[i][j] = dp[i+1][j] + dp[i][j+1] - dp[i+1][j+1] + calc(i, j);
		}
	}

	// for (int i = 1; i <= N; i++) {
	// 	for (int j = 1; j <= M; j++) {
	// 		cout << dp[i][j] << " \n"[j == M];
	// 	}
	// }

	cout << dp[1][1];
}

int main() {

	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	solve();
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 32076 KB Output is correct
2 Correct 18 ms 32080 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 32076 KB Output is correct
2 Correct 17 ms 32052 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 34508 KB Output is correct
2 Correct 67 ms 34620 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 34484 KB Output is correct
2 Correct 68 ms 34616 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 301 ms 34528 KB Output is correct
2 Correct 67 ms 34436 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 45212 KB Output is correct
2 Execution timed out 1097 ms 61140 KB Time limit exceeded

Subtask #7
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 522 ms 55556 KB Output is correct
2 Execution timed out 1095 ms 69856 KB Time limit exceeded

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1099 ms 47044 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 44944 KB Output is correct
2 Execution timed out 1070 ms 68028 KB Time limit exceeded

Subtask #10
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1095 ms 67376 KB Time limit exceeded
2 Halted 0 ms 0 KB -