oj.uz

답안 #1006379

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1006379 2024-06-23T23:01:30 Z MilosMilutinovic Rima (COCI17_rima) C++14
42 / 140
 135 ms 262144 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<string> s(n);
  for (int i = 0; i < n; i++) {
    cin >> s[i];
  }
  for (int i = 0; i < n; i++) {
    reverse(s[i].begin(), s[i].end());
  }
  auto Can = [&](string s, string t) {
    if (s.size() > t.size()) {
      swap(s, t);
    }
    int p = 0;
    while (p < (int) s.size() && s[p] == t[p]) {
      p += 1;
    }
    return p >= (int) t.size() - 1;
  };
  vector<vector<bool>> good(1 << n, vector<bool>(n));
  for (int i = 0; i < n; i++) {
    good[1 << i][i] = true;
  }
  for (int mask = 1; mask < (1 << n); mask++) {
    for (int i = 0; i < n; i++) {
      if ((mask >> i & 1) && good[mask][i]) {
        for (int j = 0; j < n; j++) {
          if (mask >> j & 1) {
            continue;
          }
          if (Can(s[i], s[j])) {
            good[mask | (1 << j)][j] = true;
          }
        }
      }
    }
  }
  int res = 0;
  for (int mask = 0; mask < (1 << n); mask++) {
    for (int i = 0; i < n; i++) {
      if (mask >> i & 1) {
        if (good[mask][i]) {
          res = max(res, __builtin_popcount(mask));
        }
      }
    }
  }
  cout << res << '\n';
  return 0;
}

Subtask #1
42.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 4956 KB Output is correct
2 Correct 49 ms 18912 KB Output is correct
3 Correct 45 ms 18872 KB Output is correct
4 Runtime error 34 ms 35152 KB Execution killed with signal 11
5 Runtime error 135 ms 262144 KB Execution killed with signal 9
6 Runtime error 9 ms 12788 KB Execution killed with signal 11
7 Runtime error 4 ms 2288 KB Execution killed with signal 6
8 Runtime error 2 ms 1980 KB Execution killed with signal 11
9 Runtime error 10 ms 10936 KB Execution killed with signal 11
10 Runtime error 3 ms 2144 KB Execution killed with signal 11