제출 #584550

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
584550		Kanaifu	Miners (IOI07_miners)	C++14	92 / 100	1573 ms	162772 KiB

miners

#include <bits/stdc++.h>

using namespace std;

int arr[100001];

unordered_map<int,int> dp[4][4][4][4];

int n;

int rec(int pos, int last_l, int plast_l, int last_r, int plast_r)
{
    if (pos == n)
    {
        return 0;
    }
    if (dp[last_l][plast_l][last_r][plast_r][pos] != 0)
    {
        return dp[last_l][plast_l][last_r][plast_r][pos];
    }
    int inc = 1;
    if (last_l != arr[pos] and last_l != 0)
    {
        inc++;
    }
    if (plast_l != arr[pos] and plast_l != last_l and plast_l != 0)
    {
        inc++;
    }
    dp[last_l][plast_l][last_r][plast_r][pos] = rec(pos+1, arr[pos], last_l, last_r, plast_r) + inc;

    inc = 1;
    if (last_r != arr[pos] and last_r != 0)
    {
        inc++;
    }
    if (plast_r != arr[pos] and plast_r != last_r and plast_r != 0)
    {
        inc++;
    }
    dp[last_l][plast_l][last_r][plast_r][pos] = max (dp[last_l][plast_l][last_r][plast_r][pos], rec(pos+1, last_l, plast_l, arr[pos], last_r) + inc);
    return dp[last_l][plast_l][last_r][plast_r][pos];
}

int main()
{
    cin>>n;
    for (int i=0; i<n; i++)
    {
        char c;
        cin>>c;
        if (c=='B')
        {
            arr[i] = 1;
        }
        else if (c=='F')
        {
            arr[i] = 2;
        }
        else
        {
            arr[i] = 3;
        }
    }
    cout<<rec(0, 0, 0, 0, 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: 0 / 8