oj.uz

Submission #581578

# Submission time Handle Problem Language Result Execution time Memory
581578 2022-06-22T18:50:02 Z Omar_Elgedawy Miners (IOI07_miners) C++14
100 / 100
 972 ms 210296 KB 
#include <bits/stdc++.h>
using namespace std;
#define cin(vec)        for(auto& i : vec) cin >> i
#define cout(vec)       for(auto& i : vec) cout << i << " "; cout << "\n";
#define fast            ios::sync_with_stdio(0);cin.tie(0);
#define loop(i,a,b)     for (int i = a; i < b; i++)
#define F               first
#define S               second
#define pb(n)           push_back(n)
#define pf(n)           push_front(n)
#define dci(d)          fixed<<setprecision(d)
#define sp              ' '
#define el              '\n'
#define all(v)          v.begin(),v.end()
#define int             long long
int dx[8]= {0,0,1,-1,-1,1,1,-1};
int dy[8]= {-1,1,0,0,-1,1,-1,1};
int const N=1e5+1,M=1e3+1,Mod=1e9+7;
string s;
int n;
int dp[N][4][4][4][4];
int value(int a,int b,int c){
  set<int>s;
  s.insert(a);
  s.insert(b);
  s.insert(c);
  s.erase(0ll);
  return s.size();
}
int trans(char x){
  if(x=='M')return 1;
  if(x=='B')return 2;
  return 3;
}
int rec(int idx, int left_a, int left_b, int right_a, int right_b){
  if(idx==n)return 0;
  int &ret=dp[idx][left_a][left_b][right_a][right_b];
  if(~ret)return ret;
  int c=trans(s[idx]);
  int c1=0,c2=0;
  swap(right_b,right_a);
  c1=rec(idx+1,left_a,left_b,right_a,c)+value(right_a,right_b,c);
  swap(right_b,right_a);
  swap(left_a,left_b);
  c2=rec(idx+1,left_a,c,right_a,right_b)+value(left_a,left_b,c);
  return ret=max(c1,c2);
}
void testcase(int h){
  cin>>n>>s;
  memset(dp,-1,sizeof dp);
  cout<<rec(0,0,0,0,0);
}
int32_t main()
{
  fast
  testcase(1);
  // int tc;cin>>tc;for(int i=1;i<=tc;i++)testcase(i);
  return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 200652 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 200572 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 200592 KB Output is correct

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 200616 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 200680 KB Output is correct

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 200780 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 201056 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 201576 KB Output is correct

Subtask #10
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 274 ms 203084 KB Output is correct

Subtask #11
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 408 ms 207988 KB Output is correct

Subtask #12
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 972 ms 210296 KB Output is correct