oj.uz

Submission #756642

# Submission time Handle Problem Language Result Execution time Memory
756642 2023-06-12T03:30:35 Z SanguineChameleon Miners (IOI07_miners) C++17
100 / 100
 126 ms 101100 KB 
#include <bits/stdc++.h>
using namespace std;

void just_do_it();

int main() {
	#ifdef KAMIRULEZ
		freopen("kamirulez.inp", "r", stdin);
		freopen("kamirulez.out", "w", stdout);
	#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	just_do_it();
	return 0;
}

const int maxn = 1e5 + 20;
int a[maxn];
int dp[maxn][4][4][4][4];

int cnt(int x, int y, int z) {
	if (x == 0 && y == 0) {
		return 1;
	}
	if (x == 0) {
		if (y == z) {
			return 1;
		}
		else {
			return 2;
		}
	}
	if (x == y && y == z) {
		return 1;
	}
	if (x == y || y == z || z == x) {
		return 2;
	}
	return 3;
}

void just_do_it() {
	fill_n(&dp[0][0][0][0][0], maxn * 4 * 4 * 4 * 4, -1);
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		char c;
		cin >> c;
		if (c == 'M') {
			a[i] = 1;
		}
		if (c == 'F') {
			a[i] = 2;
		}
		if (c == 'B') {
			a[i] = 3;
		}
	}
	dp[0][0][0][0][0] = 0;
	int res = 0;
	for (int i = 0; i < n; i++) {
		for (int x = 0; x < 4; x++) {
			for (int y = 0; y < 4; y++) {
				for (int z = 0; z < 4; z++) {
					for (int w = 0; w < 4; w++) {
						if (dp[i][x][y][z][w] == -1) {
							continue;
						}
						int t = a[i + 1];
						dp[i + 1][y][t][z][w] = max(dp[i + 1][y][t][z][w], dp[i][x][y][z][w] + cnt(x, y, t));
						dp[i + 1][x][y][w][t] = max(dp[i + 1][x][y][w][t], dp[i][x][y][z][w] + cnt(z, w, t));
						res = max(res, dp[i + 1][y][t][z][w]);
						res = max(res, dp[i + 1][x][y][w][t]);
					}
				}
			}
		}
	}
	cout << res;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 100520 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 100492 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 100492 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 100596 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 100428 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 100436 KB Output is correct

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 100620 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 100520 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 100556 KB Output is correct

Subtask #10
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 100644 KB Output is correct

Subtask #11
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 100892 KB Output is correct

Subtask #12
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 101100 KB Output is correct