제출 #254174

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
254174		tdmi	Miners (IOI07_miners)	C++14	100 / 100	252 ms	101184 KiB

miners

#include <bits/stdc++.h>
using namespace std;

const int MAXSHIPS = 100*1000;
const int MINUSINF = -(MAXSHIPS * 3 + 1);
int nbship;
int ships[MAXSHIPS+1];
int maxcoal[MAXSHIPS+1][4][4][4][4];
string shipstring;

int prodwith(int ship1,int ship2,int ship3)
{
    if(ship3==3 && ship1==ship2)
    {
        return 1;
    }
    else if(ship3==3 && ship2==3)
    {
        return 1;
    }
    else if(ship3==3)
    {
        return 2;
    }
    if(ship1==ship2 && ship1==ship3)
    {
        return 1;
    }
    else if(ship1==ship2 || ship1==ship3 || ship2==ship3)
    {
        return 2;
    }
    else
    {
        return 3;
    }
    
}

signed main()
{
    ios::sync_with_stdio(false);
    cout.tie(nullptr);
    cin.tie(nullptr);
    cin>>nbship>>shipstring;
    for(int iship = 0 ; iship < nbship ; iship++)
    {
        ships[nbship-iship-1]=(shipstring[iship]=='M'?0:(shipstring[iship]=='B'?1:2));
    }
    for(int iship = 0 ; iship < nbship+1 ; iship++)
    {
        for(int i = 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++)
                    {
                        maxcoal[iship][i][j][k][l]=(i==3 && j==3 && k==3 && l==3 ? 0 : MINUSINF);
                    }
                }
            }
        }
    }
    for(int iship = nbship ; iship>0 ; iship--)
    {
        for(int i = 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++)
                    {
                        maxcoal[iship-1][ships[iship-1]][i][k][l] = max(maxcoal[iship-1][ships[iship-1]][i][k][l] ,maxcoal[iship][i][j][k][l]+prodwith(ships[iship-1],i,j));
                        maxcoal[iship-1][i][j][ships[iship-1]][k] = max(maxcoal[iship-1][i][j][ships[iship-1]][k] ,maxcoal[iship][i][j][k][l]+prodwith(ships[iship-1],k,l));
                    }
                }
            }
        }
    }
    int maxi = 0;
    for(int i = 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++)
                {
                    maxi = max(maxi,maxcoal[0][i][j][k][l]);
                }
            }
        }
    }
    cout<<maxi;
}

• 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: 8 / 8
• Subtask 12: 8 / 8