oj.uz

Submission #167932

# Submission time Handle Problem Language Result Execution time Memory
167932 2019-12-10T20:51:52 Z Thuleanx Difference (POI11_roz) C++14
40 / 100
 277 ms 2580 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;
	memset(update_local, 0, sizeof(update_local));
	memset(update_global, 0, sizeof(update_global));
	for (int i = 0; i < M; i++)
		for (int j = 0; j < M; j++)
			best[i][j] = invalid[i][j] = -1e9;

	int ans = 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']);

			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]);
		}
	}
	
	cout << ans << endl;

	return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Incorrect 2 ms 376 KB Output isn't correct

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 275 ms 2496 KB Output is correct
2 Correct 221 ms 2188 KB Output is correct
3 Correct 228 ms 2324 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 275 ms 2552 KB Output is correct
2 Correct 273 ms 2452 KB Output is correct
3 Incorrect 266 ms 2580 KB Output isn't correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 277 ms 2576 KB Output is correct
2 Correct 269 ms 2452 KB Output is correct
3 Correct 264 ms 2528 KB Output is correct