# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
99167 |
2019-03-01T11:45:27 Z |
dalgerok |
Rima (COCI17_rima) |
C++17 |
|
253 ms |
22100 KB |
#include<bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
int n;
string s[N];
inline bool check(string &a, string &b){
int i = 0, res = 0;
while(i < min((int)a.size(), (int)b.size()) && a[i] == b[i]){
i += 1;
res += 1;
}
return res >= max((int)a.size(), (int)b.size()) - 1;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n;
for(int i = 1; i <= n; i++){
cin >> s[i];
reverse(s[i].begin(), s[i].end());
}
sort(s + 1, s + n + 1);
int cur = 1, ans = 1;
for(int i = 2; i <= n; i++){
if(check(s[i - 1], s[i])){
cur += 1;
}
else{
cur = 1;
}
ans = max(ans, cur);
}
cout << ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
17 ms |
16000 KB |
Output isn't correct |
2 |
Correct |
17 ms |
15992 KB |
Output is correct |
3 |
Incorrect |
17 ms |
16000 KB |
Output isn't correct |
4 |
Incorrect |
253 ms |
18744 KB |
Output isn't correct |
5 |
Correct |
33 ms |
21752 KB |
Output is correct |
6 |
Incorrect |
22 ms |
17276 KB |
Output isn't correct |
7 |
Incorrect |
22 ms |
17060 KB |
Output isn't correct |
8 |
Incorrect |
20 ms |
16980 KB |
Output isn't correct |
9 |
Incorrect |
44 ms |
22100 KB |
Output isn't correct |
10 |
Incorrect |
19 ms |
17092 KB |
Output isn't correct |