oj.uz

Submission #167933

# Submission time Handle Problem Language Result Execution time Memory
167933 2019-12-10T21:04:53 Z Thuleanx Difference (POI11_roz) C++14
0 / 100
 751 ms 2512 KB 
#include <bits/stdc++.h>
using namespace std;

const int M = 26;
int n;
string s;

int best[M][M];
int invalid[M][M];
int update_local[M];
int update_global[M];

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	cin>>n>>s;
	int ans = 0;

	for (int _ = 0; _ < 2; _++) {
		for (int i = 0; i < M; i++) {
			for (int j = 0; j < M; j++)
				best[i][j] = invalid[i][j] = -1e9;
			update_local[i] = update_global[i] = 0;
		}
		for (int i = 0; i < n; i++) {
			// [i][s[i]-'a']--
			update_global[s[i]-'a']--;
			// [s[i]-'a'][i]++
			update_local[s[i]-'a']++;

			for (int c = 0; c < M; c++) if (c != s[i]-'a') {
				// make things valid
				best[c][s[i]-'a'] = max(best[c][s[i]-'a'], invalid[c][s[i]-'a']);
				best[c][s[i]-'a'] = max(best[s[i]-'a'][c], -1-update_local[c] -update_global[s[i]-'a']);

				ans = max(ans, best[s[i]-'a'][c] + update_local[s[i]-'a'] + update_global[c]);

				// now new updates are invalid until activated
				invalid[s[i]-'a'][c] = max(invalid[s[i]-'a'][c], 1 - update_local[s[i]-'a'] - update_global[c]);
			}
		}
		reverse(begin(s), end(s));
	}


	cout << ans << endl;

	return 0;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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