Submission #251721

#TimeUsernameProblemLanguageResultExecution timeMemory
251721kartelRima (COCI17_rima)C++14
14 / 140
1079 ms130424 KiB
#include <bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> #define in(x) freopen(x, "r", stdin) #define out(x) freopen(x, "w", stdout) //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") //#pragma GCC optimize("Ofast,nso-stack-protector,unroll-loops,fast-math,-O3") #define F first #define S second #define pb push_back #define N +500500 #define M ll(1e9 + 7) #define sz(x) (int)x.size() #define re return #define oo ll(1e9) #define el '\n' #define Max_A int(1e9) //#define el endl #define pii pair <int, int> #define err ld(1e-9) #define Max_S int(3e6) #define last(x) x.back() #define all(x) (x).begin(), (x).end() #define arr_all(x, n) (x + 1), (x + 1 + n) using namespace std; //using namespace __gnu_pbds; //typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set; typedef long long ll; typedef long double ld; int f[N], i, n; string s; ll st[Max_S + 50], hsh[N][2]; int mrk[N]; map <int, set <int> > g; int mult(ll a, ll b) {return (a * b) % M;} int sum(ll a, ll b) {return (a + b + M) % M;} void dfs(int v, int pr) { if (mrk[v]) return; mrk[v] = 1; for (auto u : g[hsh[v][1]]) { if (mrk[u] == 1) continue; dfs(u, v); f[v] = max(f[u] + 1, f[v]); } for (auto u : g[hsh[v][0]]) { if (mrk[u] == 1) continue; dfs(u, v); f[v] = max(f[u] + 1, f[v]); } mrk[v] = 2; } int main() { cout.precision(2); srand(time(0)); ios_base::sync_with_stdio(0); iostream::sync_with_stdio(0); ios::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); // in("input.txt"); // out("output.txt"); cin >> n; st[0] = 1; for (i = 1; i <= Max_S; i++) st[i] = mult(st[i - 1], 29); for (i = 1; i <= n; i++) { cin >> s; f[i] = 1; hsh[i][0] = hsh[i][1] = 0; for (int j = 1; j < sz(s); j++) hsh[i][1] = sum(hsh[i][1], mult(s[j] - 'a' + 1, st[j - 1])); hsh[i][0] = sum(s[0] - 'a' + 1, mult(hsh[i][1], 29)); g[hsh[i][0]].insert(i); g[hsh[i][1]].insert(i); } // cerr << sz(g[0]) << el; for (i = 1; i <= n; i++) { if (mrk[i]) continue; dfs(i, -1); } int ans = 1; for (i = 1; i <= n; i++) ans = max(ans, f[i]); cout << ans; } // //00000 //00110 //00111 //00011 //00000
#Verdict Execution timeMemoryGrader output
Fetching results...