# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
994101 | vjudge1 | Rima (COCI17_rima) | C++17 | 214 ms | 101572 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 10;
int n, sz;
string S[N];
int dp[N * 6];
bool have[N * 6];
vector<pair<char, int>> g[N * 6];
void add(string s){
int cur = 0;
for (int i = 0; i < s.size(); i ++){
int nxt = 0;
for (auto [c, v] : g[cur]){
if (c == s[i]){
nxt = v;
break;
}
}
if (nxt){
cur = nxt;
}
else{
for (int j = i; j < s.size(); j ++){
sz++;
g[cur].push_back({s[j], sz});
cur = sz;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |