| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 94072 |
2019-01-15T16:08:31 Z |
updown1 |
Rima (COCI17_rima) |
C++17 |
|
275 ms |
187908 KB |
/*
The length decreases and then increases
for every node, count everything with the same suffix
dp[node] = (increasing sequence) max length sequence starting from this node ( but not counting count[node] or this node )
try every length as the smallest length
answer is max(big1[len]+big2[len]+count[word] where big1 an big2 have the same suffix,
1 + big1 + big2 + count[word])
Use a trie to speed up counting things (avoid a map)
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, a, b) for(int i=a; i<b; i++)
#define ffi For(i, 0, N)
#define ffj For(j, 0, M)
#define ffa ffi ffj
#define s <<" "<<
#define c <<" : "<<
#define w cout
#define e "\n"
#define pb push_back
#define mp make_pair
#define a first
#define b second
//#define int ll
const int MAXN=500000, INF=1000000000;
///500,000,000
int N, dp[MAXN], out, tat=1, treesm[MAXN], treeinp[MAXN];
string inp[MAXN], sm[MAXN];
bool vis[MAXN];
//map<string, vector<int> > cnt; /// (suffix, vector<index> )
struct Trie {
int nex[26];
vector<int> forw;
} tree[300001];
void add (const string& use, int tnode, int ind, int loc) {
if (ind == use.length()) {
treeinp[loc] = tnode;
return;
}
if (ind == use.length()-1) {
tree[tnode].forw.pb(loc);
treesm[loc] = tnode;
}
int x = use[ind]-'a';
if (tree[tnode].nex[x] == -1) {
tree[tnode].nex[x] = tat;
For (i, 0, 26) tree[tat].nex[i] = -1;
tat++;
}
add (use, tree[tnode].nex[x], ind+1, loc);
}
void go(int at) {
if (vis[at]) return;
vis[at] = true;
int siz = tree[treeinp[at]].forw.size(); //cnt[inp[at]].size();
for (int i: tree[treeinp[at]].forw/*cnt[inp[at]]*/) {
go(i);
dp[at] = max(dp[at], dp[i]+siz);
}
//w<< inp[at] s (int)(cnt[inp[at]].size())<<e;
}
main() {
//ifstream cin("test.in");
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> N;
For (i, 0, 26) tree[0].nex[i] = -1;
ffi {
cin >> inp[i];
sm[i] = inp[i].substr(1);
//cnt[sm[i]].pb(i);
string cop = inp[i];
reverse(cop.begin(), cop.end());
add(cop, 0, 0, i);
}
ffi go(i);
//ffi w<< inp[i] c dp[i]<<e;
ffi vis[i] = false;
ffi if (!vis[i]) {
string use = sm[i];
int big1 = 0, big2 = 0;
int siz = tree[treesm[i]].forw.size(); //cnt[use].size();
for (int j: /*cnt[use]*/tree[treesm[i]].forw) {
big2 = max(big2, dp[j]);
if (big2 > big1) swap(big2, big1);
vis[j] = true;
}
out = max(out, big1+big2+siz);
big1 = big2 = 0;
for (int j: tree[treeinp[i]].forw/*cnt[inp[i]]*/) {
big2 = max(big2, dp[j]);
if (big2 > big1) swap(big2, big1);
}
//w<< big1 s big2 s (int)cnt[inp[i]].size()<<e;
out = max(out, 1+big1+big2+(int)tree[treeinp[i]].forw.size()/*cnt[inp[i]].size()*/);
}
w<< out<<e;
}
Compilation message
rima.cpp: In function 'void add(const string&, int, int, int)':
rima.cpp:39:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (ind == use.length()) {
~~~~^~~~~~~~~~~~~~~
rima.cpp:43:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (ind == use.length()-1) {
~~~~^~~~~~~~~~~~~~~~~
rima.cpp: At global scope:
rima.cpp:69:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main() {
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
60 ms |
69240 KB |
Output is correct |
| 2 |
Correct |
59 ms |
69240 KB |
Output is correct |
| 3 |
Correct |
61 ms |
69368 KB |
Output is correct |
| 4 |
Runtime error |
275 ms |
152056 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 5 |
Correct |
98 ms |
78200 KB |
Output is correct |
| 6 |
Incorrect |
95 ms |
90596 KB |
Output isn't correct |
| 7 |
Incorrect |
80 ms |
90224 KB |
Output isn't correct |
| 8 |
Incorrect |
80 ms |
89904 KB |
Output isn't correct |
| 9 |
Runtime error |
185 ms |
187908 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 10 |
Incorrect |
95 ms |
89984 KB |
Output isn't correct |
