# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
634257 | Mahdi | Dabbeh (INOI20_dabbeh) | C++17 | 2081 ms | 192760 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;
#define all(v) v.begin(), v.end()
#define F first
#define S second
typedef long long ll;
typedef pair<int, int> pii;
const int N=5e5+5, M=1e4+5;
int n, q, h, dis[N], nxt[N][28], C[N][28], f[N], p[N][22], ff[N];
vector<int>g[N];
string s[M], L;
void add(const string &t){
int v=0;
for(int i=0;i<t.size();++i){
int z=t[i]-'a';
if(nxt[v][z]==0){
dis[h]=dis[v]+1;
nxt[v][z]=h++;
}
v=nxt[v][z];
}
}
int opr(const int &v, const int &x){
if(nxt[v][x]!=0){
C[v][x]=nxt[v][x];
f[nxt[v][x]]=C[f[v]][x];
}
else
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |