# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
872863 |
2023-11-14T02:16:23 Z |
josanneo22 |
Miners (IOI07_miners) |
C++17 |
|
618 ms |
101724 KB |
/*
Problem: IOI 2007 Miners
When: 2023-11-13 21:27:07
Author: JN
*/
#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
using pii = pair<int, int>;
#define L(i,j,k) for(int i=(j);i<=(k);++i)
#define R(i,j,k) for(int i=(j);i>=(k);--i)
#define all(x) x.begin(), x.end()
const int N=1e5+500;
int dp[N][4][4][4][4];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
int n; cin>>n;
string s; cin>>s;
vector<int> a(n+1);
L(i,0,n-1){
if(s[i]=='M') a[i]=1;
if(s[i]=='B') a[i]=2;
if(s[i]=='F') a[i]=3;
}
memset(dp,-1,sizeof(dp));
dp[0][0][0][0][0]=0;
auto profit=[&](int x,int y,int z){
set<int> s; s.insert(x); s.insert(y); s.insert(z);
int cnt=s.size();
if(*s.begin()==0) cnt--;
return cnt;
};
L(i,0,n-1){
L(a1,0,3) L(a2,0,3) L(b1,0,3) L(b2,0,3){
if(dp[i][a1][a2][b1][b2]==-1) continue;
dp[i+1][a2][a[i]][b1][b2]=max(dp[i+1][a2][a[i]][b1][b2], dp[i][a1][a2][b1][b2]+profit(a1,a2,a[i]));
dp[i+1][a1][a2][b2][a[i]]=max(dp[i+1][a1][a2][b2][a[i]], dp[i][a1][a2][b1][b2]+profit(b1,b2,a[i]));
// cout<<a1<<' '<<a2<<' '<<b1<<' '<<b2<<' ';
// cout<<profit(a1,a2,a[i])<<' ';
// cout<<profit(b1,b2,a[i])<<'\n';
}
}
int ans=0;
L(a1,0,3) L(a2,0,3) L(b1,0,3) L(b2,0,3){
if(ans<dp[n][a1][a2][b1][b2]){
ans=dp[n][a1][a2][b1][b2];
//cout<<a1<<' '<<a2<<' '<<b1<<' '<<b2<<'\n';
}
}
cout<<ans<<'\n';
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
100948 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
101032 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
18 ms |
100956 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
101088 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
100992 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
100952 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
22 ms |
100952 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
29 ms |
100956 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
82 ms |
101204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
141 ms |
101300 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
257 ms |
101460 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
618 ms |
101724 KB |
Output is correct |