# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
244838 | VEGAnn | Rima (COCI17_rima) | C++14 | 267 ms | 22236 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 <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define sz(x) ((int)x.size())
using namespace std;
const int N = 500100;
string s[N];
int n, ans = 0;
bool ok(int i, int j){
int ned = max(sz(s[i]), sz(s[j])) - 1;
int lf = 0;
while (lf < min(sz(s[i]), sz(s[j])) && s[i][lf] == s[j][lf])
lf++;
return bool(lf >= ned);
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef _LOCAL
freopen("in.txt","r",stdin);
#endif // _LOCAL
cin >> n;
for (int i = 0; i < n; i++){
cin >> s[i];
reverse(all(s[i]));
}
sort(s, s + n);
for (int i = 0; i < n; ){
int j = i + 1;
while (j < n && ok(j - 1, j))
j++;
ans = max(ans, j - i);
i = j;
}
cout << ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |