# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
547456 | 2022-04-10T18:41:47 Z | Olympia | Vještica (COCI16_vjestica) | C++17 | 14 ms | 1236 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(); } for (int i = 1; i < n; i++) { ans -= lcp(vec[i], vec[i - 1]); } cout << ans + 1; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Incorrect | 0 ms | 212 KB | Output isn't correct |
4 | Incorrect | 1 ms | 340 KB | Output isn't correct |
5 | Incorrect | 2 ms | 468 KB | Output isn't correct |
6 | Incorrect | 8 ms | 852 KB | Output isn't correct |
7 | Incorrect | 13 ms | 1108 KB | Output isn't correct |
8 | Incorrect | 14 ms | 1228 KB | Output isn't correct |
9 | Incorrect | 13 ms | 1236 KB | Output isn't correct |
10 | Incorrect | 13 ms | 1236 KB | Output isn't correct |