oj.uz

Submission #660065

# Submission time Handle Problem Language Result Execution time Memory
660065 2022-11-20T09:46:45 Z 600Mihnea Cubeword (CEOI19_cubeword) C++17
21 / 100
 255 ms 8904 KB 
bool home = 0;
#include <bits/stdc++.h>

using namespace std;

const int MODULO = 998244353;

int get_char_id(char ch) {
  assert(('a' <= ch && ch <= 'z') || ('A' <= ch && ch <= 'Z') || ('0' <= ch && ch <= '9'));
  if ('a' <= ch && ch <= 'z') {
    return ch - 'a';
  }
  if ('A' <= ch && ch <= 'Z') {
    return 1 + get_char_id('z') + ch - 'A';
  }
  return 1 + get_char_id('Z') + ch - '0';
}

const int MAX_WORD_LENGTH = 10;
///const int ALPHABET_SIZE = 2 * 26 + 10;
const int ALPHABET_SIZE = 6;
vector<string> words[MAX_WORD_LENGTH + 1];
int cnt_words[ALPHABET_SIZE][ALPHABET_SIZE];

int main() {
  if (home == 0) {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  } else {
    freopen ("input.txt", "r", stdin);
  }

  {
    size_t num_samples;
    cin >> num_samples;
    for (size_t sample_index = 0; sample_index < num_samples; sample_index++) {
      string word;
      cin >> word;
      words[word.size()].push_back(word);
    }
  }
  int solution = 0;
  for (size_t word_length = 1; word_length <= MAX_WORD_LENGTH; word_length++) {
    if (words[word_length].empty()) {
      continue;
    }
    size_t word_count = words[word_length].size();
    for (size_t word_index = 0; word_index < word_count; word_index++) {
      string reverse_word = words[word_length][word_index];
      reverse(reverse_word.begin(), reverse_word.end());
      words[word_length].push_back(reverse_word);
    }
    sort(words[word_length].begin(), words[word_length].end());
    words[word_length].resize(unique(words[word_length].begin(), words[word_length].end()) - words[word_length].begin());
    word_count = words[word_length].size();
    for (size_t first_letter = 0; first_letter < ALPHABET_SIZE; first_letter++) {
      for (size_t last_letter = 0; last_letter < ALPHABET_SIZE; last_letter++) {
        cnt_words[first_letter][last_letter] = 0;
      }
    }
    for (size_t word_index = 0; word_index < word_count; word_index++) {
      cnt_words[get_char_id(words[word_length][word_index][0])][get_char_id(words[word_length][word_index].back())]++;
    }

    for (size_t corner1 = 0; corner1 < ALPHABET_SIZE; corner1++) {
      for (size_t corner2 = 0; corner2 < ALPHABET_SIZE; corner2++) {
        for (size_t corner3 = 0; corner3 < ALPHABET_SIZE; corner3++) {
          for (size_t corner4 = 0; corner4 < ALPHABET_SIZE; corner4++) {
            for (size_t corner5 = 0; corner5 < ALPHABET_SIZE; corner5++) {
              for (size_t corner6 = 0; corner6 < ALPHABET_SIZE; corner6++) {
                for (size_t corner7 = 0; corner7 < ALPHABET_SIZE; corner7++) {
                  for (size_t corner8 = 0; corner8 < ALPHABET_SIZE; corner8++) {
                    solution = (solution + 1LL * cnt_words[corner1][corner2] % MODULO * cnt_words[corner2][corner3] % MODULO * cnt_words[corner3][corner4] % MODULO * cnt_words[corner4][corner1] % MODULO
                       * cnt_words[corner5][corner6] % MODULO * cnt_words[corner6][corner7] % MODULO * cnt_words[corner7][corner8] % MODULO * cnt_words[corner8][corner5] % MODULO
                       * cnt_words[corner1][corner5] % MODULO * cnt_words[corner2][corner6] % MODULO * cnt_words[corner3][corner7] % MODULO * cnt_words[corner4][corner8]) % MODULO;
                  }
                }
              }
            }
          }
        }
      }
    }
    if (0) {
      cout << " ---> ";
      for (auto &word : words[word_length]) {
        cout << word << " ";
      }
      cout << "\n";
    }
  }
  cout << solution << "\n";

  return 0;
}

Compilation message

cubeword.cpp: In function 'int main()':
cubeword.cpp:29:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |     freopen ("input.txt", "r", stdin);
      |     ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 242 ms 7900 KB Output is correct
2 Correct 247 ms 8804 KB Output is correct
3 Correct 245 ms 8640 KB Output is correct
4 Correct 250 ms 8716 KB Output is correct
5 Correct 245 ms 8904 KB Output is correct
6 Correct 249 ms 8716 KB Output is correct
7 Correct 244 ms 8664 KB Output is correct
8 Correct 242 ms 8788 KB Output is correct
9 Correct 241 ms 8884 KB Output is correct
10 Correct 253 ms 8760 KB Output is correct
11 Correct 248 ms 8728 KB Output is correct
12 Correct 242 ms 8716 KB Output is correct
13 Correct 253 ms 8744 KB Output is correct
14 Correct 238 ms 8704 KB Output is correct
15 Correct 243 ms 8752 KB Output is correct
16 Correct 253 ms 8832 KB Output is correct
17 Correct 255 ms 8624 KB Output is correct
18 Correct 239 ms 8724 KB Output is correct
19 Correct 243 ms 8756 KB Output is correct
20 Correct 243 ms 8716 KB Output is correct
21 Correct 244 ms 8748 KB Output is correct

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 242 ms 7900 KB Output is correct
2 Correct 247 ms 8804 KB Output is correct
3 Correct 245 ms 8640 KB Output is correct
4 Correct 250 ms 8716 KB Output is correct
5 Correct 245 ms 8904 KB Output is correct
6 Correct 249 ms 8716 KB Output is correct
7 Correct 244 ms 8664 KB Output is correct
8 Correct 242 ms 8788 KB Output is correct
9 Correct 241 ms 8884 KB Output is correct
10 Correct 253 ms 8760 KB Output is correct
11 Correct 248 ms 8728 KB Output is correct
12 Correct 242 ms 8716 KB Output is correct
13 Correct 253 ms 8744 KB Output is correct
14 Correct 238 ms 8704 KB Output is correct
15 Correct 243 ms 8752 KB Output is correct
16 Correct 253 ms 8832 KB Output is correct
17 Correct 255 ms 8624 KB Output is correct
18 Correct 239 ms 8724 KB Output is correct
19 Correct 243 ms 8756 KB Output is correct
20 Correct 243 ms 8716 KB Output is correct
21 Correct 244 ms 8748 KB Output is correct
22 Runtime error 40 ms 8148 KB Execution killed with signal 11
23 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 242 ms 7900 KB Output is correct
2 Correct 247 ms 8804 KB Output is correct
3 Correct 245 ms 8640 KB Output is correct
4 Correct 250 ms 8716 KB Output is correct
5 Correct 245 ms 8904 KB Output is correct
6 Correct 249 ms 8716 KB Output is correct
7 Correct 244 ms 8664 KB Output is correct
8 Correct 242 ms 8788 KB Output is correct
9 Correct 241 ms 8884 KB Output is correct
10 Correct 253 ms 8760 KB Output is correct
11 Correct 248 ms 8728 KB Output is correct
12 Correct 242 ms 8716 KB Output is correct
13 Correct 253 ms 8744 KB Output is correct
14 Correct 238 ms 8704 KB Output is correct
15 Correct 243 ms 8752 KB Output is correct
16 Correct 253 ms 8832 KB Output is correct
17 Correct 255 ms 8624 KB Output is correct
18 Correct 239 ms 8724 KB Output is correct
19 Correct 243 ms 8756 KB Output is correct
20 Correct 243 ms 8716 KB Output is correct
21 Correct 244 ms 8748 KB Output is correct
22 Runtime error 40 ms 8148 KB Execution killed with signal 11
23 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 242 ms 7900 KB Output is correct
2 Correct 247 ms 8804 KB Output is correct
3 Correct 245 ms 8640 KB Output is correct
4 Correct 250 ms 8716 KB Output is correct
5 Correct 245 ms 8904 KB Output is correct
6 Correct 249 ms 8716 KB Output is correct
7 Correct 244 ms 8664 KB Output is correct
8 Correct 242 ms 8788 KB Output is correct
9 Correct 241 ms 8884 KB Output is correct
10 Correct 253 ms 8760 KB Output is correct
11 Correct 248 ms 8728 KB Output is correct
12 Correct 242 ms 8716 KB Output is correct
13 Correct 253 ms 8744 KB Output is correct
14 Correct 238 ms 8704 KB Output is correct
15 Correct 243 ms 8752 KB Output is correct
16 Correct 253 ms 8832 KB Output is correct
17 Correct 255 ms 8624 KB Output is correct
18 Correct 239 ms 8724 KB Output is correct
19 Correct 243 ms 8756 KB Output is correct
20 Correct 243 ms 8716 KB Output is correct
21 Correct 244 ms 8748 KB Output is correct
22 Runtime error 40 ms 8148 KB Execution killed with signal 11
23 Halted 0 ms 0 KB -