# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
370646 | FatihSolak | Rima (COCI17_rima) | C++17 | 1098 ms | 77220 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 N 500005
using namespace std;
string s[N];
unordered_map<string,int> mp;
unordered_map<string,int> mp2;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int n;
cin >> n;
for(int i=0;i<n;i++){
cin >> s[i];
string t = s[i];
reverse(t.begin(), t.end());
mp[t]++;
t.pop_back();
mp2[t]++;
}
int ans = 0;
assert(n > 18);
for(int i=0;i<n;i++){
string c = s[i];
reverse(c.begin(), c.end());
string t = c;
c.pop_back();
int sum = 0;
while(t.size()){
sum += mp2[c];
c.pop_back();
t.pop_back();
if(!mp[t]){
break;
}
}
ans = max(ans,sum);
}
cout << ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |