oj.uz

Submission #707781

# Submission time Handle Problem Language Result Execution time Memory
707781 2023-03-10T06:15:32 Z TAhmed33 Miners (IOI07_miners) C++
84 / 100
 1500 ms 1104 KB 
#include <bits/stdc++.h>
using namespace std;
int n;
vector <int> adds;
int main () {
	string s;
	cin >> n >> s;
	for (auto i : s) {
		if (i == 'M') adds.push_back(1);
		else if (i == 'F') adds.push_back(2);
		else adds.push_back(3);
	}
	int dp[4][4][4][4][2] = {};
	for (int i = n - 1; i >= 0; i--) {
		for (int a = 0; a <= 3; a++) {
			for (int b = 0; b <= 3; b++) {
				for (int c = 0; c <= 3; c++) {
					for (int d = 0; d <= 3; d++) {
						map <int, int> distinct;
						if (a != 0) distinct[a]++;
						if (b != 0) distinct[b]++;
						distinct[adds[i]]++;
						int x = dp[b][adds[i]][c][d][1] + (int)distinct.size();
						distinct.clear();
						if (c != 0) distinct[c]++;
						if (d != 0) distinct[d]++;
						distinct[adds[i]]++;
						dp[a][b][c][d][0] = max(x, dp[a][b][d][adds[i]][1] + (int)distinct.size());
					}
				}
			}
		}
		for (int a = 0; a <= 3; a++) {
			for (int b = 0; b <= 3; b++) {
				for (int c = 0; c <= 3; c++) {
					for (int d = 0; d <= 3; d++) {
						dp[a][b][c][d][1] = dp[a][b][c][d][0];
					}
				}
			}
		}
	}
	cout << dp[0][0][0][0][1] << '\n';
}

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
7.0 / 7.0

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

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 308 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 196 ms 340 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 383 ms 404 KB Output is correct

Subtask #10
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 947 ms 556 KB Output is correct

Subtask #11
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1566 ms 976 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #12
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1569 ms 1104 KB Time limit exceeded
2 Halted 0 ms 0 KB -