oj.uz

Submission #81706

# Submission time Handle Problem Language Result Execution time Memory
81706 2018-10-26T09:09:53 Z aminra Strah (COCI18_strah) C++14
110 / 110
 249 ms 36092 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int MAXN = (int)2007;
const int infint = (int)1e9;
const ll inf = (ll)1e18;
ll n, m, up[MAXN][MAXN], lft[MAXN], rgt[MAXN];
char c[MAXN][MAXN];
ll sum(ll x)
{
	return x * (x + 1) / 2;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> m;
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
			cin >> c[i][j];
	for (int j = 0; j < m; j++)
		if(c[0][j] == '#')	
			up[0][j] = 0;
		else
			up[0][j] = -1;
	for (int i = 1; i < n; i++)
		for (int j = 0; j < m; j++)
			if(c[i][j] == '#')
				up[i][j] = i;
			else
				up[i][j] = up[i - 1][j];
	ll ans = 0;
	for (int i = 0; i < n; i++)
	{
		stack<ll> S;
		for (int j = 0; j < m; j++)
		{
			while(!S.empty() && up[i][j] > up[i][S.top()])
				S.pop();
			if(S.empty())
				lft[j] = -1;
			else
				lft[j] = S.top();
			S.push(j);
		}
		while(!S.empty())
			S.pop();
		for (int j = m - 1; j >= 0; j--)
		{
			while(!S.empty() && up[i][j] >= up[i][S.top()])
				S.pop();
			if(S.empty())
				rgt[j] = m;
			else
				rgt[j] = S.top();
			S.push(j);
		}
		for (int j = 0; j < m; j++)
		{
			ll t = i - up[i][j];
			t = sum(t);
			ans += t * (rgt[j] - j) * sum(j - lft[j]);
			ans += t * (j - lft[j]) * sum(rgt[j] - j - 1);
		}
	}
	cout << ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 532 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 544 KB Output is correct
2 Correct 2 ms 600 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3092 KB Output is correct
2 Correct 8 ms 3092 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 3092 KB Output is correct
2 Correct 8 ms 3128 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3128 KB Output is correct
2 Correct 8 ms 3128 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 13792 KB Output is correct
2 Correct 150 ms 27312 KB Output is correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 27312 KB Output is correct
2 Correct 222 ms 34736 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 34736 KB Output is correct
2 Correct 165 ms 34736 KB Output is correct

Subtask #9
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 34736 KB Output is correct
2 Correct 180 ms 34736 KB Output is correct

Subtask #10
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 36092 KB Output is correct
2 Correct 249 ms 36092 KB Output is correct