Submission #305502

#	Time	Username	Problem	Language	Result	Execution time	Memory
305502		Akashi	Miners (IOI07_miners)	C++14	76 / 100	1594 ms	512 KiB

miners

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

const int INF = 1e9;
const int DIM = 1e5 + 5;

int n;
int dp[2][4][4][4][4];
char s[DIM];

int trans(char ch) {
    if (ch == 'M') return 3;
    if (ch == 'F') return 1;
    return 2;
}

void calc(int &dp, int &aux, int a, int b, int c) {
    vector <int> v;

    v.push_back(a); v.push_back(b); v.push_back(c);
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());

    int ad = v.size();
    if (v[0] == 0) --ad;

    dp = max(dp, aux + ad);
}

int main() {
    #ifdef HOME
    freopen("miners.in", "r", stdin);
    freopen("miners.out", "w", stdout);
    #endif // HOME

    scanf("%d", &n);
    scanf("%s", s);

    memset(dp, -0x3f, sizeof(dp));

    dp[0][0][0][0][0] = 0;

    for (int i = 1, l = 1; i <= n ; ++i, l = 1 - l) {
        int tip = trans(s[i - 1]);

        for (int a = 0; a <= 3 ; ++a) for(int b = 0; b <= 3 ; ++b) for (int x = 0; x <= 3 ; ++x) for (int y = 0; y <= 3 ; ++y)
            dp[l][a][b][x][y] = -INF;

        for (int a = 0; a <= 3 ; ++a) for(int b = 0; b <= 3 ; ++b) for (int x = 0; x <= 3 ; ++x) for (int y = 0; y <= 3 ; ++y) {
            calc(dp[l][b][tip][x][y], dp[1 - l][a][b][x][y], a, b, tip);
            calc(dp[l][a][b][y][tip], dp[1 - l][a][b][x][y], x, y, tip);
        }
    }

    int ans = 0;
    for (int a = 0; a <= 3 ; ++a) for(int b = 0; b <= 3 ; ++b) for (int x = 0; x <= 3 ; ++x) for (int y = 0; y <= 3 ; ++y)
        ans = max(ans, dp[n % 2][a][b][x][y]);

    printf("%d", ans);
    return 0;
}

Compilation message (stderr)

miners.cpp: In function 'int main()':
miners.cpp:36:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   36 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
miners.cpp:37:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   37 |     scanf("%s", s);
      |     ~~~~~^~~~~~~~~

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