oj.uz

Submission #237110

# Submission time Handle Problem Language Result Execution time Memory
237110 2020-06-04T16:51:59 Z DanShaders Strah (COCI18_strah) C++17
55 / 110
 1000 ms 16000 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;

#define all(x) begin(x), end(x)
#define x first
#define y second
typedef long long ll;
typedef long double ld;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

template<typename T>
using normal_queue = priority_queue<T, vector<T>, greater<T>>;

const int MAX_N = 2e3 + 10, INF = 0x3f3f;

char a[MAX_N][MAX_N];
short b[MAX_N][MAX_N];

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < n; ++i)
		cin >> a[i];
	for (int i = n; i--; ) {
		for (int j = 0; j < m; ++j) {
			b[i][j] = b[i + 1][j] + 1;
			if (a[i][j] == '#')
				b[i][j] = 0;
		}
	}
	ll ans = 0;
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			short ss = +INF;
			for (int h = j; h < m; ++h) {
				ss = min(ss, b[i][h]);
				ans += (h - j + 1) * ss * (ss + 1) / 2;
			}
		}
	}
	cout << ans << "\n";
	return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 2176 KB Output is correct
2 Correct 38 ms 2176 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 2176 KB Output is correct
2 Correct 38 ms 2176 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 2176 KB Output is correct
2 Correct 42 ms 2304 KB Output is correct

Subtask #6
0 / 11.0

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

Subtask #7
0 / 11.0

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

Subtask #8
0 / 11.0

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

Subtask #9
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 11392 KB Output is correct
2 Execution timed out 1096 ms 14336 KB Time limit exceeded

Subtask #10
0 / 11.0

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