oj.uz

Submission #566107

# Submission time Handle Problem Language Result Execution time Memory
566107 2022-05-21T20:00:04 Z beaconmc Miners (IOI07_miners) C++14
100 / 100
 166 ms 201672 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

#define FOR(i,x,y) for(ll i = x; i<y; i++)

ll dp[100001][4][4][4][4];

int main(){
	ll n;
	cin >> n;
	string sussy;

	cin >> sussy;

	vector<ll> food(n+1);

	FOR(i,1,n+1){
		if (sussy[i-1] == 'M') food[i] = 1;
		if (sussy[i-1] == 'F') food[i] = 2;
		if (sussy[i-1] == 'B') food[i] = 3;
	}

	FOR(i,0,n+1){
		FOR(j,0,4){
			FOR(k,0,4){
				FOR(l,0,4){
					FOR(m,0,4){
						dp[i][j][k][l][m] = -1;
					}
				}
			}
		}
	}
	dp[0][0][0][0][0] = 0;

	FOR(i,1,n+1){
		FOR(j,0,4){
			FOR(k,0,4){
				FOR(l,0,4){
					FOR(m,0,4){
						if (dp[i-1][j][k][l][m] == -1) continue;
						ll sus = 1;

						if (food[i] != j && j!=0) sus += 1;
						if (food[i] != k && k!=0) sus += 1;
						if (j == k && j!=0 && k!=0 && (food[i] != j || food[i] != k )) sus -= 1;

						dp[i][k][food[i]][l][m] = max(dp[i][k][food[i]][l][m], dp[i-1][j][k][l][m] + sus);

						sus = 1;

						if (food[i] != l && l!=0) sus += 1;
						if (food[i] != m && m!=0) sus += 1;
						if (l==m && l!=0 && m!=0 && (food[i] != l || food[i] != m )) sus -= 1;

						dp[i][j][k][m][food[i]] = max(dp[i][j][k][m][food[i]], dp[i-1][j][k][l][m] + sus);
					}
				}
			}
		}
	}
	ll ans = 0;


	FOR(j,0,4){
		FOR(k,0,4){
			FOR(l,0,4){
				FOR(m,0,4){
					ans = max(ans,dp[n][j][k][l][m]);
				}
			}
		}
	}
	cout << ans;


}

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
7.0 / 7.0

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

Subtask #7
8.0 / 8.0

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

Subtask #8
8.0 / 8.0

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

Subtask #9
8.0 / 8.0

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

Subtask #10
8.0 / 8.0

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

Subtask #11
8.0 / 8.0

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

Subtask #12
8.0 / 8.0

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