oj.uz

Submission #518347

# Submission time Handle Problem Language Result Execution time Memory
518347 2022-01-23T13:26:26 Z PoPularPlusPlus Miners (IOI07_miners) C++17
100 / 100
 159 ms 113328 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

const int N = 100002;

int dp[N][4][4][4][4];
int n;
string s;

int rec(int i , int a , int b , int c ,int d){
	if(i == n)return 0;
	if(dp[i][a][b][c][d]!=-1)return dp[i][a][b][c][d];
	int cur;
	if(s[i] == 'M')cur = 0;
	else if(s[i] == 'F')cur = 1;
	else cur = 2;
	int cnt = 0;
	if(a == 1 || b == 1 || cur == 1)cnt++;
	if(a == 0 || b == 0 || cur == 0)cnt++;
	if(a == 2 || b == 2 || cur == 2)cnt++;
	int res = cnt + rec(i + 1 , b , cur , c , d);
	cnt = 0;
	if(c == 1 || d == 1 || cur == 1)cnt++;
	if(c == 0 || d == 0 || cur == 0)cnt++;
	if(c == 2 || d == 2 || cur == 2)cnt++;
	res = max(res , cnt + rec(i + 1 , a , b , d , cur));
	return dp[i][a][b][c][d] = res;
}

void solve(){
	cin >> n;
	cin >> s;
	memset(dp,-1,sizeof dp);
	cout << rec(0,3,3,3,3) << '\n';
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 100444 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 100388 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 100456 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 100424 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 100472 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 100424 KB Output is correct

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 100612 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 101132 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 101772 KB Output is correct

Subtask #10
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 103700 KB Output is correct

Subtask #11
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 110152 KB Output is correct

Subtask #12
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 159 ms 113328 KB Output is correct