oj.uz

Submission #464559

# Submission time Handle Problem Language Result Execution time Memory
464559 2021-08-13T12:22:05 Z prvocislo Difference (POI11_roz) C++17
80 / 100
 110 ms 2412 KB 
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;

const int maxn = 1e6 + 5, abc = 26;
int ans = 0;
int pf[abc][abc], pfmin[abc][abc], last[abc][abc];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
	string s;
	cin >> s;
	for (int i = 0; i < abc; i++) for (int j = 0; j < abc; j++) pf[i][j] = -1e9;
	for (int i = 0; i < n; i++)
	{
		int a = s[i] - 'a';
		for (int b = 0; b < abc; b++) if (a ^ b)
		{
			pf[a][b]++;
			ans = max(ans, pf[a][b] - pfmin[a][b]);
			pfmin[b][a] = min(pfmin[b][a], last[b][a]);
			last[b][a] = --pf[b][a];
			ans = max(ans, pf[b][a] - pfmin[b][a]);
		}
	}
	cout << ans << "\n";
	return 0;
}

Subtask #1
0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 204 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct

Subtask #6
0 / 10.0

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

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 2408 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 72 ms 2140 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 2408 KB Output is correct
2 Correct 72 ms 2144 KB Output is correct
3 Correct 83 ms 2144 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 2292 KB Output is correct
2 Correct 97 ms 2408 KB Output is correct
3 Correct 83 ms 2412 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 2408 KB Output is correct
2 Correct 99 ms 2408 KB Output is correct
3 Correct 81 ms 2408 KB Output is correct