oj.uz

Submission #377855

# Submission time Handle Problem Language Result Execution time Memory
377855 2021-03-15T10:59:30 Z SavicS Savez (COCI15_savez) C++14
108 / 120
 423 ms 53228 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 1000005;
const int inf = 1e9 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n;
string s[maxn];

int dp[maxn];

const ll mod = 1e9 + 9;
ll add(ll a, ll b){
    return (a + b) % mod;
}
ll sub(ll a, ll b){
    return (a - b + mod) % mod;
}
ll mul(ll a, ll b){
    return (a * b) % mod;
}
ll power(ll a, ll b){
    if(!b)return 1;
    ll pola = power(a, b / 2);
    pola = mul(pola, pola);
    if(b % 2)pola = mul(pola, a);
    return pola;
}
ll inv(ll a){
    return power(a, mod - 2);
}

const int p = 67;
ll pw[maxn];
ll invz[maxn];
ll hsh[maxn];

ll get(int l, int r){
    if(l == r)return 1;
    if(l > r)return 0;
    return mul(sub(hsh[r], hsh[l - 1]), invz[l - 1]);
}

map<ll,int> kol;

int main()
{
   	ios::sync_with_stdio(false);
   	cout.tie(nullptr);
  	cin.tie(nullptr);
	cin >> n;
	ff(i,1,n)cin >> s[i];
	
	pw[0] = 1;
	ff(i,1,maxn - 1)pw[i] = mul(pw[i - 1], p);
	invz[0] = 1;
    ff(i,1,maxn - 1)invz[i] = mul(invz[i - 1], inv(p));
	
	ff(i,1,n){
		// ja bi trebao da hasujem i u nekoj mapi da cuvaj za vrednost hasha max dp do njega
		int len = sz(s[i]);
		s[i] = ' ' + s[i];
		ff(j,1,len)hsh[j] = add(hsh[j - 1], mul(pw[j - 1], (s[i][j] - 'A' + 1))); 
		dp[i] = 1;
		ff(j,1,len){
			ll a = hsh[j];
			ll b = get(len - j + 1, len);
			if(a == b)dp[i] = max(dp[i], kol[a] + 1);
		}
		kol[hsh[len]] = max(kol[hsh[len]], dp[i]);
	}
	int rez = 0;
	ff(i,1,n)rez = max(rez, dp[i]);
	cout << rez << endl;
   	return 0;
}
/**

5
A
B
AA
BBB
AAA


// probati bojenje sahovski ili slicno

**/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 298 ms 47340 KB Output is correct
2 Correct 309 ms 47340 KB Output is correct
3 Correct 302 ms 47340 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 300 ms 47468 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 389 ms 48620 KB Output is correct
2 Correct 382 ms 48620 KB Output is correct
3 Correct 387 ms 48728 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 301 ms 47468 KB Output is correct
2 Correct 330 ms 48492 KB Output is correct
3 Correct 353 ms 48876 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 326 ms 48620 KB Output is correct
2 Correct 321 ms 48492 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 324 ms 48748 KB Output is correct
2 Correct 321 ms 48748 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 328 ms 49216 KB Output is correct
2 Correct 324 ms 49260 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 335 ms 49132 KB Output is correct
2 Correct 331 ms 49260 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 343 ms 48908 KB Output is correct
2 Correct 341 ms 49516 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 367 ms 49924 KB Output is correct
2 Correct 362 ms 50284 KB Output is correct
3 Correct 423 ms 53228 KB Output is correct