Submission #1494524

---

Source Code Expand

#include <cstdint>
#include <iostream>

using namespace std;

#define MAX_ANIMALS 100000
char animals[MAX_ANIMALS];
char answers[MAX_ANIMALS];

void decide_animals(uint64_t N)
{
  for (uint64_t i = 1; i < N - 1; i++) {
    switch (animals[i]) {
    case 'S':
      if (answers[i] == 'o') {
        animals[i + 1] = animals[i - 1];
      } else {
        animals[i + 1] = animals[i - 1] == 'S' ? 'W' : 'S';
      }
      break;
    case 'W':
      if (answers[i] == 'x') {
        animals[i + 1] = animals[i - 1];
      } else {
        animals[i + 1] = animals[i - 1] == 'S' ? 'W' : 'S';
      }
      break;
    }
  }
}

bool check_validity(uint64_t N)
{
  switch (animals[N - 1]) {
  case 'S':
    if (answers[N - 1] == 'o') {
      return animals[N - 2] == animals[0];
    } else {
      return animals[N - 2] != animals[0];
    }
    break;
  case 'W':
    if (answers[N - 1] == 'x') {
      return animals[N - 2] == animals[0];
    } else {
      return animals[N - 2] != animals[0];
    }
    break;
  }
  return false;
}

void valid(uint64_t N)
{
  for (uint64_t i = 0; i < N; i++) {
    cout << animals[i];
  }
  cout << endl;
}

void invalid()
{
  cout << -1 << endl;
}

int32_t main()
{
  uint64_t N;
  cin >> N;

  for (uint64_t i = 0; i < N; i++) {
    char answer;
    cin >> answer;
    answers[i] = answer;
  }

  animals[0] = 'S';
  animals[1] = 'S';
  decide_animals(N);
  if (check_validity(N)) {
    valid(N);
    return 0;
  }

  animals[0] = 'S';
  animals[1] = 'W';
  decide_animals(N);
  if (check_validity(N)) {
    valid(N);
    return 0;
  }

  animals[0] = 'W';
  animals[1] = 'S';
  decide_animals(N);
  if (check_validity(N)) {
    valid(N);
    return 0;
  }

  animals[0] = 'W';
  animals[1] = 'W';
  decide_animals(N);
  if (check_validity(N)) {
    valid(N);
    return 0;
  }

  invalid();

  return 0;
}

Submission Info

Judge Result