제출 #890779

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
890779		Sir_Ahmed_Imran	Miners (IOI07_miners)	C++17	84 / 100	1557 ms	100444 KiB

miners

                              ///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define ff first
#define ss second
#define ll long long 
#define append push_back
#define all(x) (x).begin(),(x).end()
#define N 100001
int dp[N][4][4][4][4];
int c(int n,int m,int o){
    set<int> s;
    if(n) s.insert(n);
    if(m) s.insert(m);
    if(o) s.insert(o);
    return s.size();
}
map<char,int> x;
void solve(){
    char s;
    int n,m,o,p,q,r;
    cin>>n;
    x['M']=1;
    x['F']=2;
    x['B']=3;
    for(int i=0;i<=n;i++)
        for(int j=0;j<4;j++)
            for(int k=0;k<4;k++)
                for(int l=0;l<4;l++)
                    for(int t=0;t<4;t++)
                        dp[i][j][k][l][t]=-1e9;
    dp[0][0][0][0][0]=0;
    for(int i=0;i<n;i++){
        cin>>s;
        m=x[s];
        for(int j=0;j<4;j++){
            for(int k=0;k<4;k++){
                for(int l=0;l<4;l++){
                    for(int t=0;t<4;t++){
                        dp[i+1][k][m][l][t]=max(dp[i+1][k][m][l][t]
                        ,dp[i][j][k][l][t]+c(j,k,m));
                        dp[i+1][j][k][t][m]=max(dp[i+1][j][k][t][m]
                        ,dp[i][j][k][l][t]+c(l,t,m));
                    }
                }
            }
        }
    }
    for(int i=o=0;i<4;i++)
        for(int j=0;j<4;j++)
            for(int k=0;k<4;k++)
                for(int l=0;l<4;l++)
                    o=max(o,dp[n][i][j][k][l]);
    cout<<o;
}
int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    solve();
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

miners.cpp: In function 'void solve()':
miners.cpp:22:15: warning: unused variable 'p' [-Wunused-variable]
   22 |     int n,m,o,p,q,r;
      |               ^
miners.cpp:22:17: warning: unused variable 'q' [-Wunused-variable]
   22 |     int n,m,o,p,q,r;
      |                 ^
miners.cpp:22:19: warning: unused variable 'r' [-Wunused-variable]
   22 |     int n,m,o,p,q,r;
      |                   ^

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 7 / 7
• Subtask 7: 8 / 8
• Subtask 8: 8 / 8
• Subtask 9: 8 / 8
• Subtask 10: 8 / 8
• Subtask 11: 0 / 8
• Subtask 12: 0 / 8