Submission #466901

#	Time	Username	Problem	Language	Result	Execution time	Memory
466901		ntabc05101	Bob (COCI14_bob)	C++14	120 / 120	173 ms	13940 KiB

bob

#include<bits/stdc++.h>
using namespace std;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	int n, m; cin >> n >> m;
  
	int a[n][m];
	int col[m];
	memset(col, 0, sizeof(col));
	
	long long res = 0;
	for (int i = 0; i < n; i++) {
		vector<int> ranges;
		ranges.push_back(0);
		for (int j = 0; j < m; j++) {
			cin >> a[i][j];
			if (i > 0 && a[i][j] != a[i - 1][j]) {
				col[j] = 0;
			}
			col[j]++;
			if (j > 0 && a[i][j] != a[i][j - 1]) {
				ranges.push_back(j);
			}
		}
		ranges.push_back(m);
		
		for (int c = 1; c < ranges.size(); c++) {
			int left[m];
			stack<int> st;
			for (int j = ranges[c - 1]; j < ranges[c]; j++) {
				while (!st.empty() && col[st.top()] >= col[j]) {
					st.pop();
				}
				left[j] = st.empty() ? ranges[c - 1] - 1: st.top();
				st.push(j);
			}
			
			while (!st.empty()) {
				st.pop();
			}
			for (int j = ranges[c] - 1; j >= ranges[c - 1]; j--) {
				while (!st.empty() && col[st.top()] > col[j]) {
					st.pop();
				}
				int right = st.empty() ? ranges[c]: st.top();
				int mx = max((left[j] == ranges[c - 1] - 1 ? 0: col[left[j]]), (right == ranges[c] ? 0 : col[right]));
				st.push(j);
				
				res += 1ll * (col[j] - mx) * (right - left[j]) * (right - left[j] - 1) / 2;
			}
		}
	}
	
	cout << res << endl;
	
	return 0;
}

Compilation message (stderr)

bob.cpp: In function 'int main()':
bob.cpp:29:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |   for (int c = 1; c < ranges.size(); c++) {
      |                   ~~^~~~~~~~~~~~~~~

• Subtask 1: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 12 / 12
• Subtask 4: 12 / 12
• Subtask 5: 12 / 12
• Subtask 6: 12 / 12
• Subtask 7: 12 / 12
• Subtask 8: 12 / 12
• Subtask 9: 12 / 12
• Subtask 10: 12 / 12