oj.uz

Submission #639997

# Submission time Handle Problem Language Result Execution time Memory
639997 2022-09-13T07:06:01 Z IWTIM Savez (COCI15_savez) C++17
120 / 120
 224 ms 2132 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double;	// or double, if TL is tight
using str = string;	// yay python! 

// pairs
using pii = pair<int, int> ;
using pl = pair<ll, ll> ;
using pd = pair<db, db> ;
//#define mp make_pair
#define f first
#define s second
#define tcT template < class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT > using V = vector<T> ;
tcT, size_t SZ > using AR = array<T, SZ> ;
using vi = V<int> ;
using vb = V<bool> ;
using vl = V<ll> ;
using vd = V<db> ;
using vs = V<str> ;
using vpi = V<pii> ;
using vpl = V<pl> ;
using vpd = V<pd> ;

// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define lb lower_bound
#define ub upper_bound
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define rep(a) F0R(_, a)
#define each(a, x) for (auto &a: x)
	const int mod = 998244353;
const int MX = 2e5 + 5;
const ll BIG = 1e18;	// not too close to LLONG_MAX
const db PI = acos((db) - 1);
const int dx[4]
{
	1, 0, -1, 0
}, dy[4]
{
	0, 1, 0, -1
};	// for every grid problem!!
mt19937 rng((uint32_t) chrono::steady_clock::now().time_since_epoch().count());
template < class T > using pqg = priority_queue<T, vector < T>, greater < T>> ;
struct DSU
{
	vi e;
	void init(int N)
	{
		e = vi(N, -1);
	}

	int get(int x)
	{
		return e[x] < 0 ? x : e[x] = get(e[x]);
	}

	bool sameSet(int a, int b)
	{
		return get(a) == get(b);
	}

	int size(int x)
	{
		return -e[get(x)];
	}

	bool unite(int x, int y)
	{
		// union by size
		x = get(x), y = get(y);
		if (x == y) return 0;
		if (e[x] > e[y]) swap(x, y);
		e[x] += e[y];
		e[y] = x;
		return 1;
	}
};
/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void > struct is_iterable : false_type {};
	tcT > struct is_iterable<T, void_t<decltype(begin(declval < T>())),
	                                  decltype(end(declval < T>()))
	                                 >
	                       > : true_type {};
	tcT > constexpr bool is_iterable_v = is_iterable<T>::value;

	//////////// is_readable
	tcT, class = void > struct is_readable : false_type {};
	tcT > struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v < decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT > constexpr bool is_readable_v = is_readable<T>::value;

	//////////// is_printable
	//	// https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void > struct is_printable : false_type {};
	tcT > struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v < decltype(cout <<declval < T>()), ostream&>
	        >
	    > : true_type {};
	tcT > constexpr bool is_printable_v = is_printable<T>::value;
}*/
using ll = long long;
using db = long double;	// or double, if TL is tight
using str = string;	// yay python! 

// pairs
using pii = pair<int, int> ;
using pl = pair<ll, ll> ;
using pd = pair<db, db> ;
//#define mp make_pair
#define f first
#define s second
#define tcT template < class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT > using V = vector<T> ;
tcT, size_t SZ > using AR = array<T, SZ> ;
using vi = V<int> ;
using vb = V<bool> ;
using vl = V<ll> ;
using vd = V<db> ;
using vs = V<str> ;
using vpi = V<pii> ;
using vpl = V<pl> ;
using vpd = V<pd> ;

// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define lb lower_bound
#define ub upper_bound
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define rep(a) F0R(_, a)
#define each(a, x) for (auto &a: x)
	template < class T > using pqg = priority_queue<T, vector < T>, greater < T>> ;

/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void > struct is_iterable : false_type {};
	tcT > struct is_iterable<T, void_t<decltype(begin(declval < T>())),
	                                  decltype(end(declval < T>()))
	                                 >
	                       > : true_type {};
	tcT > constexpr bool is_iterable_v = is_iterable<T>::value;

	//////////// is_readable
	tcT, class = void > struct is_readable : false_type {};
	tcT > struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v < decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT > constexpr bool is_readable_v = is_readable<T>::value;

	//////////// is_printable
	//	// https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void > struct is_printable : false_type {};
	tcT > struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v < decltype(cout <<declval < T>()), ostream&>
	        >
	    > : true_type {};
	tcT > constexpr bool is_printable_v = is_printable<T>::value;
}*/
#define int long long
int t, n, a[MX], hs[MX], pw[MX], z[MX];
string s;
map<int, int> mp;
int f_p(int baz, int pou)
{
	int otv = 1;
	while (pou > 0)
	{
		if (pou % 2) otv = (otv *baz) % mod;
		baz = (baz *baz) % mod;
		pou /= 2;
	}

	return otv;
}

int get(char ch)
{
	return (ch - 'A' + 1);
}

int geth(int le, int ri)
{
	return ((hs[ri] - hs[le - 1] + mod) *f_p(pw[le], mod - 2)) % mod;
}

main()
{
	ios_base::sync_with_stdio(false),
		cin.tie(NULL), cout.tie(NULL);
	cin >> n;
	pw[0] = 1;
	for (int i = 1; i < MX; i++)
	{
		pw[i] = pw[i - 1] * 37LL % mod;
	}

	int ans = 1;
	for (int i = 1; i <= n; i++)
	{
		cin >> s;
		int curhs = 0;
		int sz = (int) s.size();
		for (int j = 0; j < sz; j++)
		{
			curhs += pw[j] *get(s[j]);
			curhs %= mod;
			hs[j] = curhs;
		}

		int l = 0, r = 0;
		for (int j = 1; j < sz; j++)
		{
			if (j <= r)
			{
				z[j] = min(r - j + 1, z[j - l]);
			}

			while (j + z[j] < sz && s[z[j]] == s[z[j] + j])
			{
				z[j]++;
			}

			if (j + z[j] - 1 > r)
			{
				l = j;
				r = j + z[j] - 1;
			}
		}

		z[0] = s.size();
		int mx = 1;
		for (int i = 0; i < sz; i++)
		{
			if (z[i] == (int) sz - i)
			{
				mx = max(mx, mp[geth(i, sz - 1)] + 1);
			}
		}

		ans = max(ans, mx);
		mp[hs[sz - 1]] = max(mx, mp[hs[sz - 1]]);
		for (int j = 0; j < sz; j++) z[j] = 0;
	}

	cout << ans << "\n";
}

Compilation message

savez.cpp:233:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  233 | main()
      | ^~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1876 KB Output is correct
2 Correct 2 ms 1864 KB Output is correct
3 Correct 2 ms 1876 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1876 KB Output is correct
2 Correct 2 ms 1876 KB Output is correct
3 Correct 4 ms 1876 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 218 ms 2044 KB Output is correct
2 Correct 215 ms 2052 KB Output is correct
3 Correct 224 ms 2048 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1876 KB Output is correct
2 Correct 77 ms 1996 KB Output is correct
3 Correct 122 ms 2132 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 1908 KB Output is correct
2 Correct 102 ms 2036 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 1996 KB Output is correct
2 Correct 102 ms 1928 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 1876 KB Output is correct
2 Correct 99 ms 1932 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 1932 KB Output is correct
2 Correct 106 ms 1876 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 1876 KB Output is correct
2 Correct 111 ms 1876 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 194 ms 1884 KB Output is correct
2 Correct 203 ms 1888 KB Output is correct
3 Correct 216 ms 1996 KB Output is correct