Submission #165412

#TimeUsernameProblemLanguageResultExecution timeMemory
165412Atill83Savez (COCI15_savez)C++14
96 / 120
241 ms16744 KiB
#include <bits/stdc++.h> #define ff first #define ss second #define endl '\n' using namespace std; const long long INF = (long long) 1e18; const int mod = (int) 1e9+7; const int MAXN = (int) 2e6+5; typedef long long ll; typedef unsigned long long ull; typedef pair<int,int> pii; typedef pair<ll,ll> pll; ll n; string s; map<ll, ll> mp; ll pw[MAXN]; int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr);cout.tie(nullptr); #ifdef Local freopen("../IO/int.txt","r",stdin); freopen("../IO/out.txt","w",stdout); #endif cin>>n; pw[0] = 1; for(int i = 1; i < MAXN; i++){ pw[i] = pw[i - 1]*37%mod; } ll ans = 0; for(int i = 0; i < n; i++){ cin>>s; ll hash = 0; for(int j = 0; j < (int)s.length(); j++){ hash += (int)(s[j] - 'A' + 1)*pw[j]; hash %= mod; } ll cur = mp[hash]; //cout<<i<<" "<<hash<<endl; ll curH = 0; for(int l = 0; l < (int) s.length() - 1; l++){ curH += pw[l]*((int)(s[l] - 'A' + 1)); curH %= mod; //cout<<l<<" "; //cout<<curH<<endl; //cout<<mp[curH]<<endl; mp[hash] = max(mp[hash], mp[curH] + 1); } mp[hash] = max(mp[hash], cur + 1LL); //cout<<mp[hash]<<endl; ans = max(ans, mp[hash]); } cout<<ans<<endl; #ifdef Local cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds "; #endif }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...