oj.uz

Submission #566101

# Submission time Handle Problem Language Result Execution time Memory
566101 2022-05-21T19:51:37 Z beaconmc Miners (IOI07_miners) C++14
18 / 100
 156 ms 201676 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) 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 && l!=0) sus += 1;
						if (l==m && l!=0 && m!=0) 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 340 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2260 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 10392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 20368 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 47 ms 50632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 116 ms 151340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 156 ms 201676 KB Output isn't correct
2 Halted 0 ms 0 KB -