oj.uz

Submission #672443

# Submission time Handle Problem Language Result Execution time Memory
672443 2022-12-16T08:46:05 Z sudheerays123 Miners (IOI07_miners) C++17
34 / 100
 169 ms 212520 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;

vector<ll> mine1,mine2;
ll dp[N][(1ll<<4)][(1ll<<4)];
ll n;
string s;

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

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

	if(i == n+1) return 0;
	if(dp[i][mask1][mask2] != -1) return dp[i][mask1][mask2];

	ll ans = 0;

	ll curmask1 = mask1;
	curmask1 |= (1ll<<(chartoll(s[i])));
	ll c1 = __builtin_popcount(curmask1);

	ll newmask1 = (1ll<<(chartoll(s[i])));
	if(mine1.size() >= 1){
		ll x = mine1[mine1.size()-1];
		newmask1 |= (1ll<<x);
	}
	mine1.push_back(chartoll(s[i]));
	ans = max(ans,c1+go(i+1,newmask1,mask2));
	mine1.pop_back();

	ll curmask2 = mask2;
	curmask2 |= (1ll<<(chartoll(s[i])));
	ll c2 = __builtin_popcount(curmask2);

	ll newmask2 = (1ll<<(chartoll(s[i])));
	if(mine2.size() >= 1){
		ll x = mine2[mine2.size()-1];
		newmask2 |= (1ll<<x);
	}
	mine2.push_back(chartoll(s[i]));
	ans = max(ans,c2+go(i+1,mask1,newmask2));
	mine2.pop_back();

	return dp[i][mask1][mask2] = ans;
}

void solve(){

	cin >> n >> s;
	s = ' '+s;

	memset(dp,-1,sizeof dp);

	cout << go(1,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 73 ms 200628 KB Output is correct

Subtask #2
9.0 / 9.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 84 ms 200684 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 83 ms 200580 KB Output is correct

Subtask #6
7.0 / 7.0

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

Subtask #7
0 / 8.0

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

Subtask #8
0 / 8.0

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

Subtask #9
0 / 8.0

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

Subtask #10
0 / 8.0

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

Subtask #11
0 / 8.0

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

Subtask #12
0 / 8.0

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