oj.uz

Submission #232537

# Submission time Handle Problem Language Result Execution time Memory
232537 2020-05-17T10:12:17 Z alishahali1382 Savez (COCI15_savez) C++14
108 / 120
 178 ms 65400 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const ll Base=10007, Mod=1000000009;
const int MAXN=2000010, LOG=20;

int n, m, k, u, v, x, y, t, a, b, ans;
int f[MAXN];
ll H[MAXN];
string S[MAXN];
map<ll, int> dp;

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n;
	for (int i=1; i<=n; i++){
		cin>>S[i];
		m=S[i].size();
		k=0;
		for (int j=1; j<m; j++){
			while (k && S[i][k]!=S[i][j]) k=f[k];
			f[j+1]=++k;
		}
		for (int j=1; j<=m; j++) H[j]=(H[j-1]*Base+S[i][j-1])%Mod;
		for (int j=m; j; j=f[j]) dp[H[m]]=max(dp[H[m]], 1+dp[H[j]]);
		ans=max(ans, dp[H[m]]);
		//debug2(i, ans)
	}
	cout<<ans<<'\n';
	
	return 0;
}
/*
3
A
ABA
ABABA

1
ABABA


*/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 62968 KB Output is correct
2 Correct 41 ms 62976 KB Output is correct
3 Correct 40 ms 62976 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 39 ms 62976 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 65144 KB Output is correct
2 Correct 155 ms 65276 KB Output is correct
3 Correct 178 ms 65144 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 63100 KB Output is correct
2 Correct 84 ms 65144 KB Output is correct
3 Correct 116 ms 65272 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 65144 KB Output is correct
2 Correct 77 ms 65168 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 65248 KB Output is correct
2 Correct 78 ms 65272 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 65400 KB Output is correct
2 Correct 70 ms 65376 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 65272 KB Output is correct
2 Correct 69 ms 65196 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 64172 KB Output is correct
2 Correct 85 ms 64248 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 64400 KB Output is correct
2 Correct 97 ms 64376 KB Output is correct
3 Correct 126 ms 64888 KB Output is correct