oj.uz

Submission #592350

# Submission time Handle Problem Language Result Execution time Memory
592350 2022-07-09T02:34:46 Z Hanksburger Miners (IOI07_miners) C++17
100 / 100
 153 ms 100508 KB 
#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.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1236 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 5460 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 10336 KB Output is correct

Subtask #10
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 25360 KB Output is correct

Subtask #11
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 75456 KB Output is correct

Subtask #12
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 100508 KB Output is correct