oj.uz

Submission #643676

# Submission time Handle Problem Language Result Execution time Memory
643676 2022-09-22T18:31:45 Z ErXiM Miners (IOI07_miners) C++14
100 / 100
 22 ms 568 KB 
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <iostream>
using namespace std;

const int MAX=100005;

int n;
char s[MAX+1];
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'){
            s[i] = 1;
        }
        else if(input[i]=='M'){
            s[i] = 2;
        }
        else{
            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(s[k], s[k-1], a) + dp[prev][s[k-1]][b][c];
                int sec = ore(s[k], b, c) + dp[prev][b][s[k-1]][a];
                dp[now][a][b][c] = max(sec, fir);
             }
          }
       }

       swap(now, prev);
    }
    printf("%d\n", dp[prev][0][0][0]);
    return 0;
}

Compilation message

miners.cpp: In function 'int main()':
miners.cpp:42:64: warning: array subscript has type 'char' [-Wchar-subscripts]
   42 |                 int fir = ore(s[k], s[k-1], a) + dp[prev][s[k-1]][b][c];
      |                                                           ~~~~~^
miners.cpp:43:62: warning: array subscript has type 'char' [-Wchar-subscripts]
   43 |                 int sec = ore(s[k], b, c) + dp[prev][b][s[k-1]][a];
      |                                                         ~~~~~^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 212 KB Output is correct

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
7.0 / 7.0

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

Subtask #7
8.0 / 8.0

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

Subtask #8
8.0 / 8.0

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

Subtask #9
8.0 / 8.0

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

Subtask #10
8.0 / 8.0

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

Subtask #11
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 568 KB Output is correct

Subtask #12
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 532 KB Output is correct