제출 #256948

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
256948		someone	Miners (IOI07_miners)	C++14	100 / 100	476 ms	402040 KiB

miners

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

const int N = 2e5, POS = 256, INF = 1e9;

int n, f[N], val[N][POS];

signed main() {
    /*
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    */
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    cin >> n;
    for(int i = 0; i < n; i++) {
        char c; cin >> c;
        if(c == 'M') f[i] = 1;
        if(c == 'F') f[i] = 2;
        if(c == 'B') f[i] = 3;
    }
    
    for(int i = 0; i < N; i++)
        for(int j = 0; j < POS; j++)
            val[i][j] = -INF;
    val[0][0] = 0;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < POS; j++) {
            int p[4], sit = j;
            for(int k = 0; k < 4; k++, sit /= 4)
                p[k] = sit % 4;
            int t1 = 1, t2 = 1;
            if(f[i] != p[0] && p[0] != 0) t1++;
            if(f[i] != p[2] && p[2] != 0) t2++;
            if(f[i] != p[1] && p[0] != p[1] && p[1] != 0) t1++;
            if(f[i] != p[3] && p[2] != p[3] && p[3] != 0) t2++;
            
            int j1 = p[1] + 4*f[i] + 16*p[2] + 64*p[3],
                j2 = p[0] + 4*p[1] + 16*p[3] + 64*f[i];
            val[i+1][j1] = max(val[i+1][j1], val[i][j] + t1);
            val[i+1][j2] = max(val[i+1][j2], val[i][j] + t2);
        }
    }
    int maxi = 0;
    for(int j = 0; j < POS; j++)
        maxi = max(maxi, val[n][j]);
    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