oj.uz

답안 #547459

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
547459 2022-04-10T18:48:32 Z Olympia Vještica (COCI16_vjestica) C++17
0 / 160
 1184 ms 5208 KB 
#include <cmath>
#include <iostream>
#include <set>
#include <climits>
#include <algorithm>
#include <cassert>
#include <vector>
#include <iomanip>
#include <type_traits>
#include <string>
#include <queue>
#include <map>

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
using namespace std;
int lcp (string& s, string& t) {
    for (int i = 0; i < min(s.length(), t.length()); i++) if (s[i] != t[i]) return i;
    return min(s.length(), t.length());
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    vector<string> vec(n); for (int i = 0; i < n; i++) cin >> vec[i];
    for (int i = 0; i < n; i++) sort(vec[i].begin(), vec[i].end());
    sort(vec.begin(), vec.end());
    int ans = 0;
    for (int i = 0; i < n; i++) {
        ans += vec[i].size();
    }
    int dp[(1 << n)][n];
    for (int i = 0; i < (1 << n); i++) for (int j = 0; j < n; j++) dp[i][j] = 0;
    for (int i = 0; i < n; i++) dp[(1 << i)][i] = 0;
    for (int i = 0; i < (1 << n); i++) {
        for (int j = 0; j < n; j++) {
            if (!(i & (1 << j))) continue;
            for (int k = 0; k < n; k++) {
                if (!(i & (1 << k))) continue;
                if (k == j) continue;
                dp[i][j] = max(dp[i - (1 << j)][k] + lcp(vec[j], vec[k]), dp[i][j]);
            }
        }
    }
    int res = 0;
    for (int i = 0; i < n; i++) {
        res = max(res, dp[(1 << n) - 1][i]);
    }
    cout << ans - res;

}

Compilation message

vjestica.cpp:15: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   15 | #pragma GCC optimization ("O3")
      | 
vjestica.cpp:16: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   16 | #pragma GCC optimization ("unroll-loops")
      | 
vjestica.cpp: In function 'int lcp(std::string&, std::string&)':
vjestica.cpp:19:23: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
   19 |     for (int i = 0; i < min(s.length(), t.length()); i++) if (s[i] != t[i]) return i;
      |                     ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 160.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 Incorrect 145 ms 4420 KB Output isn't correct
5 Incorrect 572 ms 4568 KB Output isn't correct
6 Incorrect 673 ms 4980 KB Output isn't correct
7 Incorrect 1014 ms 5156 KB Output isn't correct
8 Incorrect 1184 ms 5208 KB Output isn't correct
9 Incorrect 1031 ms 5204 KB Output isn't correct
10 Incorrect 1039 ms 5204 KB Output isn't correct