# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
244865 |
2020-07-05T07:49:25 Z |
NONAME |
Rima (COCI17_rima) |
C++14 |
|
1000 ms |
19164 KB |
#include <bits/stdc++.h>
#define dbg(x) cerr << #x << " = " << x << "\n"
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie()
using namespace std;
using ll = long long;
const int N = 5e5 + 10;
int n, f[N];
string s[N];
int main() {
fast_io;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> s[i];
int ans = 0;
for (int msk = 0; msk < (1 << n); ++msk) {
string t = "";
bool gd = 1;
for (int i = 0; i < n; ++i) {
if (!(msk & (1 << i)))
continue;
if (t == "") {
t = s[i];
continue;
}
int l1 = int(s[i].size()) - 1, l2 = int(t.size()) - 1, k = 0;
while (l1 >= 0 && l2 >= 0) {
if (s[i][l1] != t[l2])
break;
--l1, --l2;
++k;
}
if (k < max(int(s[i].size()) - 1, int(t.size()) - 1))
gd = 0;
}
if (gd)
ans = max(ans, __builtin_popcount(msk));
}
cout << ans << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
55 ms |
16000 KB |
Output isn't correct |
2 |
Correct |
301 ms |
16120 KB |
Output is correct |
3 |
Incorrect |
196 ms |
16000 KB |
Output isn't correct |
4 |
Incorrect |
57 ms |
16000 KB |
Output isn't correct |
5 |
Execution timed out |
1093 ms |
18944 KB |
Time limit exceeded |
6 |
Execution timed out |
1093 ms |
16664 KB |
Time limit exceeded |
7 |
Execution timed out |
1096 ms |
16548 KB |
Time limit exceeded |
8 |
Incorrect |
15 ms |
16496 KB |
Output isn't correct |
9 |
Incorrect |
22 ms |
19164 KB |
Output isn't correct |
10 |
Incorrect |
15 ms |
16708 KB |
Output isn't correct |