| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 637407 |
2022-09-01T16:15:18 Z |
IWTIM |
Rima (COCI17_rima) |
C++17 |
|
331 ms |
149820 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;
}*/
const int N = 5e5 + 5,
M = 3e6 + 5;
int t, n, a[N], dp[M], trie[M][26], ans = 1, cn, cnt[M];
vector<int> v[M];
string s;
void add(string s)
{
int cur = 0;
for (int i = 0; i < s.size(); i++)
{
int ch = s[i];
if (!trie[cur][ch - 'a'])
{
trie[cur][ch - 'a'] = ++cn;
v[cur].pb(trie[cur][ch - 'a']);
}
cur = trie[cur][ch - 'a'];
}
cnt[cur]++;
}
void dfs(int a, int p)
{
if (v[a].size() == 0 && a > 0)
{
dp[a] = 1;
return;
}
int mx = 0;
vector<int> vv;
for (int to: v[a])
{
if (to == p) continue;
dfs(to, a);
mx = max(mx, dp[to]);
if (dp[to])
vv.pb(dp[to]);
}
sort(vv.begin(), vv.end());
if (vv.size() >= 2)
{
if (a) ans = max(ans, vv.back() + vv[vv.size() - 2] + cnt[a] + (int) vv.size() - 2);
else ans = max(ans, vv.back() + vv[vv.size() - 2] + (int) vv.size() - 2);
}
ans = max(ans, mx + (int) vv.size() - (!cnt[a]));
if (cnt[a]) dp[a] = mx + 1 + vv.size() - min((int) vv.size(), 1);
else dp[a] = 0;
}
main()
{
ios_base::sync_with_stdio(false),
cin.tie(NULL), cout.tie(NULL);
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> s;
reverse(s.begin(), s.end());
add(s);
}
dfs(0, -1);
cout << ans << "\n";
}
Compilation message
rima.cpp: In function 'void add(std::string)':
rima.cpp:216:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
216 | for (int i = 0; i < s.size(); i++)
| ~~^~~~~~~~~~
rima.cpp: At global scope:
rima.cpp:263:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
263 | main()
| ^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
34 ms |
70740 KB |
Output is correct |
| 2 |
Correct |
38 ms |
70808 KB |
Output is correct |
| 3 |
Correct |
37 ms |
70920 KB |
Output is correct |
| 4 |
Correct |
331 ms |
149820 KB |
Output is correct |
| 5 |
Correct |
59 ms |
74204 KB |
Output is correct |
| 6 |
Correct |
85 ms |
145916 KB |
Output is correct |
| 7 |
Correct |
88 ms |
145800 KB |
Output is correct |
| 8 |
Correct |
88 ms |
145624 KB |
Output is correct |
| 9 |
Correct |
105 ms |
149788 KB |
Output is correct |
| 10 |
Correct |
126 ms |
145704 KB |
Output is correct |
