# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
547459 | Olympia | Vještica (COCI16_vjestica) | C++17 | 1184 ms | 5208 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |