oj.uz

Submission #237113

# Submission time Handle Problem Language Result Execution time Memory
237113 2020-06-04T17:17:02 Z DanShaders Strah (COCI18_strah) C++17
88 / 110
 791 ms 15480 KB 
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,ssse3,sse4.1,sse4.2,avx,avx2")

#include <bits/stdc++.h>
#include <immintrin.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];
int last[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) {
		last[m] = m;
		for (int j = m; j--; ) {
			last[j] = j + 1;
			while (last[j] < m && b[i][last[j]] >= b[i][j])
				last[j] = last[last[j]];
		}
		for (int j = 0; j < m; ++j) {
			int lef = j - 1;
			while (lef >= 0 && b[i][lef] > b[i][j])
				--lef;
			int mult = 0;
			for (int h1 = lef + 1; h1 <= j; ++h1)
				for (int h2 = j; h2 < last[j]; ++h2)
					mult += h2 - h1 + 1;
			ans += mult * b[i][j] * (b[i][j] + 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 4 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 4 ms 384 KB Output is correct

Subtask #3
11.0 / 11.0

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

Subtask #4
11.0 / 11.0

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

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 2304 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 146 ms 5632 KB Output is correct
2 Correct 390 ms 11744 KB Output is correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 436 ms 8448 KB Output is correct
2 Correct 662 ms 15480 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 291 ms 5752 KB Output is correct
2 Correct 425 ms 12464 KB Output is correct

Subtask #9
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 11392 KB Output is correct
2 Correct 476 ms 11648 KB Output is correct

Subtask #10
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 791 ms 12536 KB Output isn't correct
2 Halted 0 ms 0 KB -