oj.uz

Submission #672528

# Submission time Handle Problem Language Result Execution time Memory
672528 2022-12-16T13:51:16 Z sudheerays123 Miners (IOI07_miners) C++17
34 / 100
 164 ms 186724 KB 
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
const ll N = 1e5+5 , INF = 1e18 , MOD = 1e9+7;

ll dp[N][15][15];
vector<ll> a(N);
ll n;

ll chartoll(char x){
	if(x == 'M') return 1ll;
	if(x == 'B') return 2ll;
	return 3ll;
}

ll score(ll mask , ll cur){
	mask |= (1ll<<cur);
	ll x = __builtin_popcountll(mask);
	return x;
}

ll newmask(ll cur , ll pre){
	ll y = (1ll<<cur);
	if(pre != 0) y |= (1ll<<pre);
	return y;
}

ll go(ll i , ll mask1 , ll mask2 , ll pre1 , ll pre2){

	if(i == n+1) return 0;
	if(dp[i][mask1][mask2] != -1) return dp[i][mask1][mask2];
		
	ll ans = score(mask1,a[i])+go(i+1,newmask(a[i],pre1),mask2,a[i],pre2);
	ans = max(ans,score(mask2,a[i])+go(i+1,mask1,newmask(a[i],pre2),pre1,a[i]));
	
	return dp[i][mask1][mask2] = ans;
}

void solve(){

	string s;
	cin >> n >> s;
	s = ' '+s;
	for(ll i = 1; i <= n; i++) a[i] = chartoll(s[i]);

	// if(n <= 20){

	// 	ll ans = -INF;

	// 	for(ll i = 0; i < (1ll<<n); i++){

	// 		vector<char> mine1,mine2;
	// 		for(ll j = 0; j < n; j++){
	// 			if(i&(1ll<<j)) mine1.push_back(s[j+1]);
	// 			else mine2.push_back(s[j+1]);
	// 		}

	// 		ll score = 0;

	// 		for(ll j = 0; j < mine1.size(); j++){
	// 			set<char> food;
	// 			for(ll k = j; k >= max(0ll,j-2); k--) food.insert(mine1[k]);
	// 			score += food.size();
	// 		}

	// 		for(ll j = 0; j < mine2.size(); j++){
	// 			set<char> food;
	// 			food.insert(mine2[j]);
	// 			for(ll k = j; k >= max(0ll,j-2); k--) food.insert(mine2[k]);
	// 			score += food.size();
	// 		}

	// 		ans = max(ans,score);
	// 	}

	// 	cout << ans;
	// 	return;
	// }

	memset(dp,-1,sizeof dp);

	cout << go(1,0,0,0,0);
}

int main(){

	fast;

	ll tc = 1;
	// cin >> tc;
	while(tc--) solve();

	return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
7.0 / 7.0

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

Subtask #7
0 / 8.0

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

Subtask #8
0 / 8.0

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

Subtask #9
0 / 8.0

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

Subtask #10
0 / 8.0

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

Subtask #11
0 / 8.0

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

Subtask #12
0 / 8.0

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