제출 #643678

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
643678		ErXiM	Miners (IOI07_miners)	C++14	0 / 100	24 ms	1564 KiB

miners

#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <iostream>
using namespace std;

const int MAXN=1e5+5;

int n;
int dostawy[MAXN];
int dp[2][4][4][4];

inline int ore (int a, int b, int c) {
  int sol = 0;
  if (a == 1 || b == 1 || c == 1) sol++;
  if (a == 2 || b == 2 || c == 2) sol++;
  if (a == 3 || b == 3 || c == 3) sol++;
  return sol;
}

int main() {
    int n;
    cin >> n;
    string input;
    cin >> input;
    for(int i = 0;i<n;i++){
        if(input[i]=='F'){
            dostawy[i] = 1;
            //s[i] = 1;
        }
        else if(input[i]=='M'){
            dostawy[i] = 2;
            //s[i] = 2;
        }
        else{
            dostawy[i] = 3;
            //s[i] = 3;
        }
    }
    int now = 0, prev = 1;
    for (int k=n-1; k>=0;k--){
       for (int a=0; a<=3;a++){
          for (int b=0; b<=3;b++){
             for (int c=0;c<=3;c++){
                int fir = ore(dostawy[k], dostawy[k-1], a) + dp[prev][dostawy[k-1]][b][c];
                int sec = ore(dostawy[k], b, c) + dp[prev][b][dostawy[k-1]][a];
                dp[now][a][b][c] = max(sec, fir);
             }
          }
       }
       swap(now, prev);
    }
    printf("%d\n", dp[prev][0][0][0]);
    return 0;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 9
• Subtask 3: 0 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 7
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 8
• Subtask 10: 0 / 8
• Subtask 11: 0 / 8
• Subtask 12: 0 / 8