oj.uz

Submission #583265

# Submission time Handle Problem Language Result Execution time Memory
583265 2022-06-25T07:22:47 Z beaconmc Miners (IOI07_miners) C++14
100 / 100
 137 ms 1328 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[2][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,2){
		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[0][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[1][k][food[i]][l][m] = max(dp[1][k][food[i]][l][m], dp[0][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[1][j][k][m][food[i]] = max(dp[1][j][k][m][food[i]], dp[0][j][k][l][m] + sus);
					}
				}
			}
		}
		FOR(j,0,4){
			FOR(k,0,4){
				FOR(l,0,4){
					FOR(m,0,4){
						dp[0][j][k][l][m] = dp[1][j][k][l][m];
					}
				}
			}
		}
	}

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

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 304 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 1 ms 328 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 2 ms 212 KB Output is correct

Subtask #8
8.0 / 8.0

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

Subtask #9
8.0 / 8.0

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

Subtask #10
8.0 / 8.0

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

Subtask #11
8.0 / 8.0

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

Subtask #12
8.0 / 8.0

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