제출 #592350

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
592350		Hanksburger	Miners (IOI07_miners)	C++17	100 / 100	153 ms	100508 KiB

miners

#include <bits/stdc++.h>
#define f(i) for (int i=0; i<4; i++)
using namespace std;
int dp[100005][4][4][4][4];
int d(int x, int y, int z)
{
    if (x)
    {
        if (x==y && y==z)
            return 1;
        else if ((x==y)^(y==z)^(z==x))
            return 2;
        else
            return 3;
    }
    if (y)
    {
        if (y==z)
            return 1;
        else
            return 2;
    }
    return 1;
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, ans=0;
    cin >> n;
    for (int i=0; i<=n; i++)
        f(j) f(k) f(l) f(m)
            dp[i][j][k][l][m]=-1e9;
    dp[0][0][0][0][0]=0;
    for (int i=1; i<=n; i++)
    {
        char c;
        cin >> c;
        int x=(c=='M'?1:(c=='F'?2:3));
        f(j) f(k) f(l) f(m)
        {
            dp[i][j][x][l][m]=max(dp[i][j][x][l][m], dp[i-1][k][j][l][m]+d(k, j, x));
            dp[i][j][k][l][x]=max(dp[i][j][k][l][x], dp[i-1][j][k][m][l]+d(m, l, x));
        }
    }
    f(i) f(j) f(k) f(l)
        ans=max(ans, dp[n][i][j][k][l]);
    cout << ans;
    return 0;
}

• 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