oj.uz

Submission #346860

# Submission time Handle Problem Language Result Execution time Memory
346860 2021-01-11T09:32:25 Z BlancaHM Miners (IOI07_miners) C++14
100 / 100
 359 ms 1132 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e5;

int food[N + 1];
// Dimensiones: n, penultima comida mina 1, ultima comida mina1,
//                 penultima comida mina 2, ultima comida mina2
int dp[2][4][4][4][4];
string str;

int nFood;

int value(int a, int b, int c) {
  int ans = 0;
  if (a == 1 || b == 1 || c == 1) {
    ++ans;
  }
  if (a == 2 || b == 2 || c == 2) {
    ++ans;
  }
  if (a == 3 || b == 3 || c == 3) {
    ++ans;
  }
  return ans;
}

int main() {
  cin >> nFood;
  cin >> str;
  for (int i = 1; i <= nFood; ++i) {
    char foodchar = str[i - 1];
    // un switch es una alternativa a los bloques 'if' cuando todas las condiciones son sobre el valor de la misma variable
    switch(foodchar) {
      case 'M':
        food[i] = 1;
        break;
      case 'F':
        food[i] = 2;
        break;
      case 'B':
        food[i] = 3;
        break;
    }
  }

  for (int i = nFood + 1; i >= 1; --i) {
    for (int x1 = 0; x1 <= 3; ++x1) {
      for (int x2 = 0; x2 <= 3; ++x2) {
        for (int y1 = 0; y1 <= 3; ++y1) {
          for (int y2 = 0; y2 <= 3; ++y2) {
            int curr = i % 2;
            int next = curr ^ 1;
            if (i == nFood + 1) {
              dp[curr][x1][x2][y1][y2] = 0;
            } else {
              int send_to_mine1 =
                  value(x1, x2, food[i]) + dp[next][food[i]][x1][y1][y2];
              int send_to_mine2 =
                  value(y1, y2, food[i]) + dp[next][x1][x2][food[i]][y1];
              dp[curr][x1][x2][y1][y2] = max(send_to_mine1, send_to_mine2);
            }
          }
        }
      }
    }
  }
  cout << dp[1][0][0][0][0];
  return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
7.0 / 7.0

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

Subtask #7
8.0 / 8.0

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

Subtask #8
8.0 / 8.0

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

Subtask #9
8.0 / 8.0

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

Subtask #10
8.0 / 8.0

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

Subtask #11
8.0 / 8.0

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

Subtask #12
8.0 / 8.0

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